cf #363 c
2016-07-21 09:51
232 查看
C. 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:
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
output
input
output
input
output
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.
View Code
dp可以的,但是麻烦。
贪心:对于每一天,尽量不休息。最后输出结果。
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:
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.
#include<stdio.h> #include<iostream> using namespace std; int max(int a,int b,int c){ int tmp; tmp=(a>=b)?a:b; tmp=(tmp>=c)?tmp:c; return tmp; } int max(int a,int b){ int tmp; tmp=(a>=b)?a:b; return tmp; } int main(){ int n; scanf("%d",&n); int dp[105][3]; int a[105]; int ans=-2; for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } for(int i=0;i<=n;i++){ for(int j=0;j<3;j++) dp[i][j]=0; } dp[0][0]=0; dp[0][1]=0; dp[0][2]=0; for(int i=1;i<=n;i++){ if(a[i]==0){ dp[i][0]=max(dp[i-1][0],dp[i-1][1],dp[i-1][2]); dp[i][1]=max(dp[i-1][0],dp[i-1][2],dp[i-1][1]); dp[i][2]=max(dp[i-1][0],dp[i-1][1],dp[i-1][2]); }else if(a[i]==1){ dp[i][0]=max(dp[i-1][0],dp[i-1][1],dp[i-1][2]); dp[i][1]=max(dp[i-1][0],dp[i-1][2],dp[i-1][1]); dp[i][2]=max(dp[i-1][0]+1,dp[i-1][1]+1,dp[i-1][2]); }else if(a[i]==2){ dp[i][0]=max(dp[i-1][0],dp[i-1][1],dp[i-1][2]); dp[i][1]=max(dp[i-1][0]+1,dp[i-1][2]+1,dp[i-1][1]); dp[i][2]=max(dp[i-1][0],dp[i-1][1],dp[i-1][2]); }else if(a[i]==3){ dp[i][0]=max(dp[i-1][0],dp[i-1][1],dp[i-1][2]); dp[i][1]=max(dp[i-1][0]+1,dp[i-1][2]+1,dp[i-1][1]); dp[i][2]=max(dp[i-1][0]+1,dp[i-1][1]+1,dp[i-1][2]); } } for(int i=0;i<=n;i++){ for(int j=0;j<3;j++) ans=max(dp[i][j],ans); } printf("%d\n",n-ans); return 0; }
View Code
dp可以的,但是麻烦。
贪心:对于每一天,尽量不休息。最后输出结果。
相关文章推荐
- 最大连续子序列<hdoj1231>
- Elasticsearch 合理内存分配
- 为CentOS7/RHEL7安装EPEL 仓库(repo)
- vulkan中对图像image的读写——image view
- hdu1860-统计字符出现次数问题 string.find()
- 现代统计学——读书笔记
- List集合里面按照人的年龄属性排序
- Leetcode 6. ZigZag Conversion
- nyoj 824 Greedy Mouse
- linux下vi命令大全
- Android studio中.so文件的提交
- Windows下搭建Nginx实现负载均衡
- sublime text2和3怎么设置修改字体
- Android中Application类用法
- ehcach缓存测试类
- The Python Tutorial - Modules
- INSTALL_FAILED_SHARED_USER_INCOMPATIBLE while using shared user id
- mysql在windows上如何使用
- Sublime Text 3 + MarkdownEditing Plugins
- Android的两种上下文的区别