CodeForces 698A Vacations

I - 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:

on this day the gym is closed and the contest is not carried out;
on this day the gym is closed and the contest is carried out;
on this day the gym is open and the contest is not carried out;
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 a1, a2, …, an (0 ≤ ai ≤ 3) separated by space, where:

ai equals 0, if on the i-th day of vacations the gym is closed and the contest is not carried out;
ai equals 1, if on the i-th day of vacations the gym is closed, but the contest is carried out;
ai equals 2, if on the i-th day of vacations the gym is open and the contest is not carried out;
ai 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

题意：数字3表示即可去运动也可去测试，2表示只去运动，1表示只去测试，0表示休息，问运动与测试不相连的情况下最少休息多少天
题解：运用dp思想，动态规划的意思是根据上一步情况把下一步情况表达出来

#include <stdio.h>
#include <cstring>
#include <algorithm>
using namespace std;
#define M 110
#define INF 0x3f3f3f

int dp[M][4];
int min(int a, int b)
{
    return a < b ? a : b;
}
int main()
{
    int a[M], n;
    while(scanf("%d", &n) != EOF)
    {
        for(int i=1; i<=n; i++)
        {
            scanf("%d", &a[i]);
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=0; j<4; j++)
            {
                dp[i][j] = INF;//注意i==0的情况
            }
        }
        for(int i=1; i<=n; i++)
        {
        //每一步dp[i][0]都是改变的，基于上一步的最小值 + 1
            if(a[i] == 0)
            {
                dp[i][0] = min(dp[i-1][0], min(dp[i-1][1], dp[i-1][2])) + 1;//数字为0时只有一种情况
            }
            if(a[i] == 1)
            {
                dp[i][0] = min(dp[i-1][0], min(dp[i-1][1], dp[i-1][2])) + 1;//提取上一步的情况，加1表示这一步上一步数字相同
                dp[i][2] = min(dp[i-1][0], dp[i-1][1]);//记录最小的一个，因为当上一步是2时dp[i-1][1]没有改变值，依旧是个很大的数，
            }
            if(a[i] == 2)
            {
                dp[i][0] = min(dp[i-1][0], min(dp[i-1][1], dp[i-1][2])) + 1;
                dp[i][1] = min(dp[i-1][0], dp[i-1][2]);
            }
            if(a[i] == 3)
            {
                dp[i][0] = min(dp[i-1][0], min(dp[i-1][1], dp[i-1][2])) + 1;
                dp[i][2] = min(dp[i-1][0], dp[i-1][1]);
                dp[i][1] = min(dp[i-1][0], dp[i-1][2]);
            }
        }
        int ans = min(dp[n][0], min(dp[n][1], dp[n][2]));
        printf("%d\n", ans);

    }

    return 0;
}