CodeForces
来源:互联网 发布:银行后台数据录入员 编辑:程序博客网 时间:2024/06/03 18:06
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 thisn days: whether that gym opened and whether a contest was carried out in the Internet on that day. For thei-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 thei-th day of vacations the gym is closed and the contest is not carried out;
- ai equals 1, if on thei-th day of vacations the gym is closed, but the contest is carried out;
- ai equals 2, if on thei-th day of vacations the gym is open and the contest is not carried out;
- ai equals 3, if on thei-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,或者3的地方开始,1212121212,或者21212121(3可以为1也可以为2)这两种情况尽可能多
#include<cstdio>using namespace std;int main(){ int t; int a[110],b[110]; while(~scanf("%d",&t)) { for(int i=1;i<=t;i++) { scanf("%d",&a[i]); } int ans=0,i; for(i=1;i<=t;i++) { if(a[i]==0) ans++; else if(a[i]==3) continue; else break; } int n=a[i]; for(i+=1;i<=t;i++) { if(n==a[i]&&n!=3) { ans++; n=0; } if(n!=a[i]&&a[i]!=0) { n=3-n; } if(a[i]==0) { ans++; n=3; } if(n==0&&a[i]!=0) { n=a[i]; } } printf("%d\n",ans); } return 0;}
用dp 解法
#include<cstdio>#include<cstring>#include<algorithm>#define inf 0x3f3f3f3fusing namespace std;int dp[110][4];int main(){ int t,m; while(~scanf("%d",&t)) { memset(dp,inf,sizeof(dp)); dp[0][0]=0; for(int i=1;i<=t;i++) { scanf("%d",&m); dp[i][0]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0])+1; if(m==1) { dp[i][1]=min(dp[i-1][0],dp[i-1][2]); } if(m==2) { dp[i][2]=min(dp[i-1][0],dp[i-1][1]); } if(m==3) { dp[i][1]=min(dp[i-1][0],dp[i-1][2]); dp[i][2]=min(dp[i-1][0],dp[i-1][1]); } } printf("%d\n",min(min(dp[t][1],dp[t][2]),dp[t][0])); } return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- 模拟(洛谷1403 [AHOI2005]约数研究)
- Nginx配置子域名
- 小知识备忘
- JavaScript switch语句和调试程序
- isap最大流
- CodeForces
- 高斯求和等差数列前缀和(洛谷1147 连续自然数和)
- 数学方法模拟(洛谷1017 进制转换NOIp2000提高组第一题)
- (洛谷1029 最大公约数和最小公倍数问题)
- 博弈论(noip普及组2010第四题 三国游戏)
- 博弈论(洛谷1288取数游戏2)
- dp+高精度(洛谷1005 矩阵取数游戏NOIP 2007 提高第三题)
- 开源中文分词FudanNLP
- 动态规划(洛谷1373 小a和uim之大逃离)