Vacations【贪心】
2016-07-23 19:00
375 查看
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
// 0 健身房关门 没比赛 // 1 健身房关门 有比赛 // 2 健身房开门 没比赛 // 3 健身房开门 有比赛 #include <cstdio> #include<cstring> int a[150],b[150]; int main() { int n; while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(int i=1;i<=n;i++) scanf("%d",&a[i]); int k=0; 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 ); } }
相关文章推荐
- [Rails]route.rb理解积累
- javascript继承详解(一):前世今生
- Git用户手册--分布式 Git
- HDU 5675 ztr loves math (数学推导)
- HDU 5656 CA Loves GCD (数论DP)
- Leetcode 257. Binary Tree Paths (Easy) (cpp)
- 在Ubuntu16.04安装OpenCV3.1并实现USB摄像头图像采集
- Vim 小技巧
- Android AIDL 与 Service
- HDU 5660 jrMz and angles (暴力枚举)
- HDU 5665 Lucky (水题)
- HDU 4884 TIANKENG’s rice shop (模拟)
- C++基础:多态的实现原理分析
- Android中的长度单位
- okhttp简单使用【学习笔记】
- MFC之菜单资源详解
- POJ 1182 食物链
- Git用户手册--远程管理-服务器上的Git
- Codeforces Round #310 (Div. 2) D 贪心+set应用
- IIS+TOMCAT+MYSQL服务器部署的方法与常见问题的解决办法