CodeForces 698A——Vacations（动态规划）

D - Vacations

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest was carried out in the Internet on that day. For the i-th day there are four options:

1. on this day the gym is closed and the contest is not carried out;
2. on this day the gym is closed and the contest is carried out;
3. on this day the gym is open and the contest is not carried out;
4. on this day the gym is open and the contest is carried out.

On each of days Vasya can either have a rest or write the contest (if it is carried out on this day), or do sport (if the gym is open on this day).

Find the minimum number of days on which Vasya will have a rest (it means, he will not do sport and write the contest at the same time). The only limitation that Vasya has — he does not want to do the same activity on two consecutive days: it means, he will not do sport on two consecutive days, and write the contest on two consecutive days.

Input

The first line contains a positive integer n (1 ≤ n ≤ 100) — the number of days of Vasya's vacations.

The second line contains the sequence of integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 3) separated by space, where:

• a_i equals 0, if on the i-th day of vacations the gym is closed and the contest is not carried out;
• a_i equals 1, if on the i-th day of vacations the gym is closed, but the contest is carried out;
• a_i equals 2, if on the i-th day of vacations the gym is open and the contest is not carried out;
• a_i equals 3, if on the i-th day of vacations the gym is open and the contest is carried out.

Output

Print the minimum possible number of days on which Vasya will have a rest. Remember that Vasya refuses:

• to do sport on any two consecutive days,
• to write the contest on any two consecutive days.

Sample Input

Input

4
1 3 2 0

Output

2

Input

7
1 3 3 2 1 2 3

Output

0

Input

2
2 2

Output

1

题意：Vasyayo有n天的假期，他每天可以选择运动，比赛或者休息。但每天都四个状态，体育场开门没有比赛，体育场关门有比赛，体育场开门有比赛，体育场关门没比赛。问他最少休息多少天？

思路：显然是状态的转移。就用dp咯。dp[i][j]表示第i天做j事最少休息的天数。

dp[i+1][0]=min{dp[i][0]+1,dp[i][1]+1,dp[i][2]+1}第i+1天休息

dp[i+1][1]=min{dp[i][0],dp[i][2]}第i+1天可以运动

dp[i+1][2]=min{dp[i][0],dp[i][1]}第i天可以打比赛

res=min{dp[n][0],dp[n][1],dp[n][2]}

代码：

#include <cmath>
#include <cstring>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <string>
#include <set>


using namespace std;

#define MAXN 110
#define LEN 1000000
#define INF 1e9+7
#define MODE 1000000
typedef long long ll;


int n;
int a[MAXN];
int f[MAXN][3];

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",a+i);
    for(int i=0;i<4;i++)
        f[0][i]=0;
    for(int i=1;i<=n;i++)
    {
        f[i][0]=min(f[i-1][0],min(f[i-1][1],f[i-1][2]))+1;
        if(a[i]==1||a[i]==3)
            f[i][1]=min(f[i-1][0],f[i-1][2]);
        else
            f[i][1]=INF;
        if(a[i]==2||a[i]==3)
            f[i][2]=min(f[i-1][0],f[i-1][1]);
        else
            f[i][2]=INF;
        if(a[i]==0)
        {
            f[i][1]=INF;
            f[i][2]=INF;
        }
    }
    printf("%d\n",min(f[n][0],min(f[n][1],f[n][2])));
}