[BZOJ1088] 扫雷游戏mine

题目太简单就略了qwq

#include"stdio.h"
#define rep(f,a,b) for(f=a;f<=b;f++)
using namespace std;
const int N=10005;
const int x[8]={0,1,1,2};
int dp[4][N],n,val[N];

int main(){
    int i,j; scanf("%d",&n);
    rep(i,1,n) scanf("%d",val+i);
    dp[0][0]=dp[1][0]=1;
    rep(i,1,n-1) rep(j,0,3){
        int k=x[j],k0=val[i];
        if (dp[j][i-1]&&(k0==k||k0==k+1)){
            int t=k0-k;
            dp[j%2*2+t][i]+=dp[j][i-1];
        }
    }
    if(val[n]==2) printf("%d\n",dp[3][n-1]);
    else if(val[n]) printf("%d\n",dp[1][n-1]+dp[2][n-1]);
    else printf("%d",dp[0][n-1]);
    return 0;
}