【打CF，学算法——三星级】Codeforces 698A Vacations (动态规划)

【CF简介】

题目链接：CF 698A

题面：

A. Vacations

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

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

Note

In the first test Vasya can write the contest on the day number 1 and do sport on the day number 3. Thus, he will have a rest for only 2 days.

In the second test Vasya should write contests on days number 1, 3, 5 and 7, in other days do sport. Thus, he will not have a rest for a single day.

In the third test Vasya can do sport either on a day number 1 or number 2. He can not do sport in two days, because it will be contrary to the his limitation. Thus, he will have a rest for only one day.

题意：

    Vasya假期有两种活动，打比赛和运动。每天都有可以选择的情况，如0，则只能休息，1，则只能打比赛，2，则只能取运动，3则既可以运动，也可以打比赛。要求相邻两天不重复相同的活动，问Vasya最少休息几天。

解题：

    起初想用贪心解，发现不行，随后用dp[i][j]解这个问题。第一维表示第几天，第二维j为0,表示休息，1表示打比赛，2表示运动，dp的值表示该状态下的最少休息天数。

代码：

#include<iostream>
#include<cstdio> 
#include<algorithm>
#include <fstream> 
#include <cstring>
#include <set>
using namespace std;
int a[105],dp[105][3];
int main()
{
  int n,cnt=0,res=110;
  scanf("%d",&n);
  memset(dp,0x3f,sizeof(dp));
  for(int i=1;i<=n;i++)
    scanf("%d",&a[i]);
  if(a[1]==0)
    dp[1][0]=1;
  else if(a[1]==1)
    dp[1][1]=0;
  else if(a[1]==2)
    dp[1][2]=0;
  else if(a[1]==3)
  {
  	dp[1][2]=0;
  	dp[1][1]=0;
  }
  for(int i=2;i<=n;i++)
  {
     if(a[i]==0)
     {
     	dp[i][0]=min(dp[i][0],min(dp[i-1][2],min(dp[i-1][1],dp[i-1][0]))+1);
     }
  	 else if(a[i]==1)
  	 {
 	    dp[i][1]=min(dp[i][1],min(dp[i-1][2],dp[i-1][0]));
 	    dp[i][0]=min(dp[i][0],min(dp[i-1][2],min(dp[i-1][1],dp[i-1][0]))+1);
  	 }
     else if(a[i]==2)
     {
     	dp[i][2]=min(dp[i][2],min(dp[i-1][1],dp[i-1][0]));
     	dp[i][0]=min(dp[i][0],min(dp[i-1][2],min(dp[i-1][1],dp[i-1][0]))+1);
     }
     else
     {
     	dp[i][1]=min(dp[i][1],min(dp[i-1][0],dp[i-1][2]));
     	dp[i][2]=min(dp[i][2],min(dp[i-1][0],dp[i-1][1]));
     }
  }
  if(a[n]==0)
    res=dp[n][0];
  else if(a[n]==1)
    res=min(dp[n][1],dp[n][0]);
  else if(a[n]==2)
    res=min(dp[n][2],dp[n][0]);
  else
    res=min(dp[n][0],min(dp[n][1],dp[n][2]));
  printf("%d\n",res);
  return 0;
}