(贪心) Vacations 求休息的最少天数
2016-07-23 20:30
134 查看
I - Vacations
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
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.
Sample Input
Input
Output
Input
Output
Input
Output
代码:
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
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.
Sample Input
Input
4 1 3 2 0
Output
2
Input
7 1 3 3 2 1 2 3
Output
0
Input
22 2
Output
1
用k记录每天的状态,b[i]记录从第一天到第i天休息的天数,每一天的状态只与前一天有关,尽量保证能工作就不休息。
代码:
#include<stdio.h> int a[110],b[110]={0}; int main() { int n,k; while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } for(int i=1;i<=n;i++) { if(a[i]==0) { b[i]=b[i-1]+1; k=0; } else { if(a[i]==3) { b[i]=b[i-1]; k=3-k; } else { if(a[i]==k) { b[i]=b[i-1]+1; k=0; } else { b[i]=b[i-1]; k=a[i]; } } } } printf("%d\n",b ); } return 0; }
相关文章推荐
- 对象的引用
- 网络修复-可以上qq但是网页等打不开
- NoClassDefFoundError: org/aspectj/weaver/reflect/ReflectionWorld$ReflectionWorld
- 迭代加深搜索
- 双系统ubuntu16.04 64位安装android studio并启动虚拟机
- LeetCode[367] Valid Perfect Square
- while(cin>>temp)如何结束循环
- 欧氏距离比较相似度的python实现
- codeforces #364d As Fast As Possible
- 走遍欧洲 —— 伊比利亚半岛
- BGP选路之local-preference
- 配置中的master指的是master 的候选节点
- mybatis自学入门实例(一)
- 【VS开发】【图像处理】RGB Bayer Color分析
- rails 做api接口入门说明
- 直接运行py文件
- 编写《编辑器》阶段小结
- POJ 2762 Going from u to v or from v to u?
- ubuntu下安装pyqt5
- 探秘Tomcat——连接篇