#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
#define MAX 10001
int N,ans=0,f[MAX],a[MAX];
int check()
{
for(int i=2;i<N;i++)
{
f[i+1]=a[i]-f[i]-f[i-1];
if(f[i+1]<0) return 0;
}
if(a[N]-f[N]-f[N-1]!=0) return 0;
return 1;
}
int main()
{
//freopen("input.in","r",stdin);
//freopen("output.out","w",stdout);
scanf("%d",&N);
for(int i=1;i<=N;i++)
scanf("%d",&a[i]);
if(a[1]==0)
ans+=check();
else if(a[1]==1)
{
f[1]=1;
ans+=check();
memset(f,0,sizeof(f));
f[2]=1;
ans+=check();
}
else
{
f[1]=1;
f[2]=1;
ans+=check();
}
printf("%d\n",ans);
//system("pause");
return 0;
}
BZOJ 1088 扫雷Mine
最新推荐文章于 2018-11-04 10:46:31 发布