bzoj 1088 题解

确定第一第二个剩下的往下推

Code：

/**************************************************************
    Problem: 1088
    User: wohenshuai
    Language: C++
    Result: Accepted
    Time:20 ms
    Memory:1360 kb
****************************************************************/
 
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int n;
int a[11000];
void Input()
{
  scanf("%d",&n);
  for(int i=1;i<=n;i++)
    scanf("%d",&a[i]);
}
int ans=0;
int bh[11000];
int dfs(int x,int y)
{
   
  for(int i=2;i<=n;i++)
  {
    int fr=bh[i]+bh[i-1];
    if(fr==a[i]) bh[i+1]=0;
    else if(fr==a[i]-1) bh[i+1]=1;
    else return 0;
  }
  if(bh[n+1]==0) return 1;
  else return 0;
}
void Solve()
{
  if(n==1){if(a[1]<=1) ans=1; return ;}
  for(int x=0;x<=1;x++)
    for(int y=0;y<=1;y++)
    {
      memset(bh,0,sizeof(bh));
      bh[1]=x; bh[2]=y;
      int tmp=x+y;
      if(tmp!=a[1]) continue;
      else ans+=dfs(x,y);
    }
}
void Output()
{
  printf("%d\n",ans);
}
int main()
{
  Input();
  Solve();
  Output();
  return 0;
}