這道題目不難，就是簡(jiǎn)單的模擬算法。但是還是給了我一個(gè)教訓(xùn)，就是以后看題要仔細(xì)仔細(xì)，

因?yàn)閯傞_始老是評(píng)測(cè)不能過，后來發(fā)現(xiàn)是少輸出了個(gè)日期數(shù)，就是一開始把日期數(shù)輸入了，然后把他輸出一遍就可以了。

1、

#include<iostream> using namespace std; #include<string> int main() {int k,n,i,day,year;string month[19]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};string month1[20]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};string mon;cin>>k;char s;cout<<k<<endl;while (k--){cin>>day>>s>>mon>>year;for (i=0;i<19;i++)if (mon==month[i]) n=20*i;n=year*365+n+day+1;year=(n-1)/260;if (n%260==0) n=260;else n=n%260;if (n%13==0) day=13;else day=n%13;if (n%20==0) n=20;else n=n%20;cout<<day<<' '<<month1[n-1]<<' '<<year<<endl;} return 0; }程序有點(diǎn)缺陷，那就是費(fèi)事多了點(diǎn)，用了16ms，內(nèi)存占了248k。

2、改進(jìn)：把一維字符串?dāng)?shù)組改為二維的字符數(shù)組，將cin、cout改為scanf、printf。

效率提高了不少。耗時(shí)0s，內(nèi)存為160k。不過與排名靠前的0s，8k,還是有很大距離。

如果大家有什么好方法，請(qǐng)指教，謝謝！

改進(jìn)后代碼：

#include<stdio.h> #include<iostream> using namespace std; #include<string> int main() {int k,n,i;int day,year;char month[19][7]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};char month1[20][9]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};char mon[7];scanf("%d",&k);printf("%d\n",k);while (k--){scanf("%d.%s%d",&day,mon,&year);for (i=0;i<19;i++)if (!strcmp(mon,month[i])) n=20*i;n=year*365+n+day+1;year=(n-1)/260;if (n%260==0) n=260;else n=n%260;if (n%13==0) day=13;else day=n%13;if (n%20==0) n=20;else n=n%20;printf("%d %s %d\n",day,month1[n-1],year);} return 0; }

總結(jié)

以上是生活随笔為你收集整理的poj1008(Maya Calendar)玛雅历（c++实现）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。