Codeforces Round #363 (Div. 2) C dp
来源:互联网 发布:计量经济学软件 编辑:程序博客网 时间:2024/06/11 12:28
链接:戳这里
C. Vacations
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.
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.
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.
题意:
给出n个数,0表示这天休息,1表示做比赛,2表示健身,3表示想健身又想比赛
问每天只能做一件事,n天最少能休息多少天
思路:
dp[i][0]表示第i天休息的情况下当前i天最少能休息多少天
dp[i][1]表示第i天比赛的情况下当前i天最少能休息多少天
dp[i][2]表示第i天健身的情况下当前i天最少能休息多少天
状态转移就是:
dp[i][1]=min(dp[i-1][0],dp[i-1][2])
dp[i][2]=min(dp[i-1][0],dp[i-1][1])
dp[i][0]=min(dp[i-1][0],dp[i-1][1],dp[i-1][2])+1
其他的到不了的状态直接复制INF
代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<string>#include<vector>#include <ctime>#include<queue>#include<set>#include<map>#include<stack>#include<iomanip>#include<cmath>#define mst(ss,b) memset((ss),(b),sizeof(ss))#define maxn 0x3f3f3f3f#define MAX 1000100///#pragma comment(linker, "/STACK:102400000,102400000")typedef long long ll;typedef unsigned long long ull;#define INF (1ll<<60)-1using namespace std;int n;int a[110];int dp[110][3];int Min(int a,int b,int c){ int t=min(a,b); return min(t,c);}int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); for(int i=1;i<=n;i++){ if(a[i]==0) { dp[i][1]=1e9; dp[i][2]=1e9; } else if(a[i]==1){ dp[i][1]=min(dp[i-1][0],dp[i-1][2]); dp[i][2]=1e9; } else if(a[i]==2){ dp[i][1]=1e9; dp[i][2]=min(dp[i-1][0],dp[i-1][1]); } else if(a[i]==3){ dp[i][2]=min(dp[i-1][0],dp[i-1][1]); dp[i][1]=min(dp[i-1][0],dp[i-1][2]); } dp[i][0]=Min(dp[i-1][0],dp[i-1][1],dp[i-1][2])+1; } cout<<Min(dp[n][1],dp[n][2],dp[n][0])<<endl; return 0;}
0 0
- Codeforces Round #363 (Div. 2) C dp
- 【DP】Codeforces Round #336 (Div. 2) C
- Codeforces Round #303 (Div. 2) C dp
- Codeforces Round #286 (Div. 2) C dp
- Codeforces Round #369 (Div. 2) C dp
- DP-Codeforces Round #369 Div.2-C
- Codeforces Round #376(Div. 2) C 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 —— DP
- Codeforces Round #363 (Div. 1) C. LRU(状态压缩dp)
- [DP] Codeforces Round #197 (Div. 2) C. Xenia and Weights
- Codeforces Round #139 (Div. 2) C. Barcode(DP)
- Codeforces Round #FF (Div. 2/C)/Codeforces446A_DZY Loves Sequences(DP)
- 完全理解Android中的RemoteViews
- 在SQLserver中stuff 函数用法
- 【HDU】5468 Puzzled Elena
- hdu5723(16多校第1场,树上两点平均距离的期望)
- 监听开关机,发送广播
- Codeforces Round #363 (Div. 2) C dp
- uva 401 回文词
- 可变參函数设计
- 对话机器学习大神Michael Jordan:简介
- React Native开发android应用
- dddd
- Python 读文件
- 个人学习-java-事
- 陪审团制度