Codeforces Round #363 (Div. 2) C. Vacations(DP)
来源:互联网 发布:樱井知香短发番号 编辑:程序博客网 时间:2024/06/05 18:21
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.
41 3 2 0
2
71 3 3 2 1 2 3
0
22 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[110],dp[110][3],inf=1e9+7;void up(int &x,int y){if(x>y)x=y;}int main(){int n;scanf("%d",&n);F(i,1,n)scanf("%d",a+i);F(i,1,n)F(j,0,2)dp[i][j]=inf;dp[0][0]=0;F(i,0,n-1)F(j,0,2)if(dp[i][j]!=inf){if(a[i+1]==0)up(dp[i+1][0],dp[i][j]+1);if(a[i+1]==1){if(j==1)up(dp[i+1][0],dp[i][j]+1);else up(dp[i+1][1],dp[i][j]);}if(a[i+1]==2){if(j==2)up(dp[i+1][0],dp[i][j]+1);else up(dp[i+1][2],dp[i][j]);}if(a[i+1]==3){if(j==1)up(dp[i+1][2],dp[i][j]);else if(j==2)up(dp[i+1][1],dp[i][j]);else{up(dp[i+1][1],dp[i][j]);up(dp[i+1][2],dp[i][j]);}}}int mi=inf;F(i,0,2)up(mi,dp[n][i]);printf("%d\n",mi);return 0;}
- Codeforces Round #363 (Div. 2) C. Vacations(DP)
- Codeforces Round #363 (Div. 2) C. Vacations(DP 动态规划)
- Codeforces Round #363 (Div. 2) C. Vacations(DP)
- ****Codeforces Round #363 (Div. 2) C. Vacations(DP 动态规划)
- Codeforces Round #363 (Div. 2) C. Vacations (DP)
- Codeforces Round #363 (Div. 2) C. Vacations 贪心+dp
- Codeforces Round #363 (Div. 2) C. Vacations —— DP
- Codeforces Round #363 (Div. 2) C. Vacations
- Codeforces Round #363 (Div. 2) [C] Vacations
- Codeforces Round #363 (Div. 2) C. Vacations
- Codeforces Round #363 C (Div. 2) Vacations
- Codeforces Round #363 (Div. 2) C. Vacations
- Codeforces Round #363 (Div. 2) C. Vacations
- Codeforces Round #363 (Div. 2)C. Vacations
- Codeforces Round #363 (Div. 2) C. Vacations
- Codeforces Round #363 (Div. 2) C Vacations
- Codeforces Round #363 (Div. 2) C. Vacations【n-dp(max) or 暴力模拟】
- 【Codeforces Round 363 (Div 2) C】【简单DP】Vacations 一天运动 一天学习最少休息日数
- iOS开发三方资源 - 欲先攻其事必先利其器
- JAVA图片转为base64格式
- Hadoop集群的JobHistoryServer详解
- 41 和为 s 的连续正数序列
- 谈谈数据库的ACID
- Codeforces Round #363 (Div. 2) C. Vacations(DP)
- kill常用注意点
- 169. Majority Element
- 三:如何创建并运行 Java 线程
- Bundle savedInstanceState的作用
- arm v8汇编指令
- Intent 传递的类型总结
- oozie 客户端常用命令
- Windows下zlib库和libPng库的编译和使用