BZOJ 1088 扫雷Mine

来源：互联网发布：谷歌翻译 mac 编辑：程序博客网时间：2024/06/05 02:34

#include<stdio.h>#include<string.h>#include<stdlib.h>#include<algorithm>#include<iostream>#include<vector>#include<stack>#include<queue>using namespace std;#define MAX 10001int 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;}

0 0