1 second
256 megabytes
standard input
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:
- 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.
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.
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.
4
1 3 2 0
2
7
1 3 3 2 1 2 3
0
2
2 2
1
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.
题意：
0代表必须休息，1代表只能做运动，2代表只能写作业，3代表两种都可以，然后不能连续两天做同样的事情，除了休息，问你最少休息多少天
题解：
当时比赛的时候做，看到数据n在100以内，然后直接上了一个暴搜，卧槽，殊不知这可以出数据让你暴搜会达到2的100次方，所以这题只能DP
设dp[i][j]表示第i天做第j种事的最小休息天数，因为3代表两种都可以，就更新两种状态就行了
#include<cstdio>
#define F(i,a,b) for(int i=a;i<=b;++i) int a[],dp[][],inf=1e9+;
void up(int &x,int y){if(x>y)x=y;} int main(){
int n;
scanf("%d",&n);
F(i,,n)scanf("%d",a+i);
F(i,,n)F(j,,)dp[i][j]=inf;
dp[][]=;
F(i,,n-)F(j,,)
if(dp[i][j]!=inf){
if(a[i+]==)up(dp[i+][],dp[i][j]+);
if(a[i+]==){
if(j==)up(dp[i+][],dp[i][j]+);
else up(dp[i+][],dp[i][j]);
}
if(a[i+]==){
if(j==)up(dp[i+][],dp[i][j]+);
else up(dp[i+][],dp[i][j]);
}
if(a[i+]==){
if(j==)up(dp[i+][],dp[i][j]);
else if(j==)up(dp[i+][],dp[i][j]);
else{
up(dp[i+][],dp[i][j]);
up(dp[i+][],dp[i][j]);
}
}
}
int mi=inf;
F(i,,)up(mi,dp[n][i]);
printf("%d\n",mi);
return ;
}