http://codeforces.com/problemset/problem/698/A
题意:有n天,0休息,1运动,2比赛,3可以运动或比赛;(每天都可以选择休息);问最少的休息天数;
思路:dp;找到最大的非休息天数k;ans=n-k; dp[i][0]第i天休息,dp[i][1]运动,dp[i][2]比赛;维护最大的非休息数目;
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e5+9;
const int mod=1e9+7;
template <class T>
inline void sc(T &ret)
{
char c;
ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9')
{
ret = ret * 10 + (c - '0'), c = getchar();
}
}
int a[maxn],dp[maxn][3];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
dp[i][0]=max( max( dp[i-1][0],dp[i-1][1] ),dp[i-1][2] );
if(a[i]==1||a[i]==3)
{
dp[i][1]=max(dp[i-1][2]+1,dp[i-1][0]+1);
}
if(a[i]==2||a[i]==3)
{
dp[i][2]=max(dp[i-1][0]+1,dp[i-1][1]+1);
}
}
int ans=max(max(dp[n][0],dp[n][1]),dp[n][2]);
cout<<n-ans<<endl;
return 0;
}