原题链接:P1664
解题思路:
题目大意:根据打卡规律,算出最终的经验值。
AC代码:
#include<stdio.h>
#include<math.h>
int main(){
int n;
while(~scanf("%d",&n)){
int jy=0,ts=0,a,yilou=0;
for(int i=0;i<n;i++){
scanf("%d",&a);
if(a==1){
// printf(":::%d\n",ts);
if(yilou>0){
ts-=pow(2,yilou-1);
if(ts<0) ts=0;//连续天数不会小于0
}
yilou=0;
ts++;
}
else{
if(ts>0)//如果连续天数为0的话,不计算遗漏天数
yilou++;
continue;
}
if(ts<3){
jy++;
//printf(" %d %d\n",ts,jy);
continue;
}
if(ts<7){
jy+=2;
//printf(" %d %d\n",ts,jy);
continue;
}
if(ts<30){
jy+=3;
//printf(" %d %d\n",ts,jy);
continue;
}
if(ts<120){
jy+=4;
//printf(" %d %d\n",ts,jy);
continue;
}
if(ts<365){
jy+=5;
//printf(" %d %d\n",ts,jy);
continue;
}
jy+=6;
}
printf("%d\n",jy);
}
return 0;
}
样例1
5
1
1
1
0
0
输出:4
样例2
9
1
0
1
0
1
0
1
0
0
输出:4
样例3
10
1
1
1
1
1
1
0
1
1
1
输出:18
样例4
100
0
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
0
1
1
1
1
1
1
1
0
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
0
0
1
1
1
1
0
0
1
1
1
0
0
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
0
1
1
0
1
1
1
1
1
1
1
1
1
1
1
输出:219
样例5
500
0
1
1
1
1
0
0
1
0
1
0
1
0
1
1
0
1
1
0
1
1
1
1
1
1
1
1
1
1
1
0
0
1
1
1
1
1
1
0
1
1
1
0
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
0
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
0
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
0
1
1
1
1
0
1
1
1
1
0
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
0
0
1
1
1
1
0
1
1
1
1
0
1
1
1
1
1
1
0
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
1
0
1
1
1
1
1
0
1
0
0
1
1
1
1
1
0
1
1
0
1
1
1
1
0
1
1
1
1
0
1
1
0
1
0
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
0
1
1
1
1
1
1
1
1
0
1
1
1
0
1
1
1
1
1
1
1
1
0
1
1
1
0
0
1
1
1
0
1
1
1
1
0
0
1
1
1
1
1
1
1
1
1
1
0
1
1
0
1
1
1
1
0
0
1
1
1
1
1
0
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
1
0
1
1
0
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
0
1
1
1
1
1
1
1
1
1
1
0
1
1
1
0
1
0
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
0
1
0
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
0
1
1
1
0
1
1
0
1
1
1
1
0
1
1
1
1
1
0
1
1
0
1
1
1
1
0
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
1
0
0
1
1
1
1
1
1
1
1
1
0
0
1
1
0
1
1
1
1
0
1
1
输出:1850