zoukankan      html  css  js  c++  java
  • CodeForces 698A Vacations

    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:

    1. on this day the gym is closed and the contest is not carried out;
    2. on this day the gym is closed and the contest is carried out;
    3. on this day the gym is open and the contest is not carried out;
    4. 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 <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cstdlib>
    #include <cmath>
    #include <stack>
    #define Max 101
    using namespace std;
    int s[3][Max],n,d;///s记录不休息的天数
    int main()
    {
        scanf("%d",&n);
        for(int i = 1;i <= n;i ++)
        {
            scanf("%d",&d);
            s[0][i] = max(max(s[0][i - 1],s[1][i - 1]),s[2][i - 1]);///第i天休息 前一天可以休息可以做运动可以比赛
            s[1][i] = (d > 1) + max(s[2][i - 1],s[0][i - 1]);///d是2和3的时候 可以运动 前一天不能运动 
            s[2][i] = (d % 2) + max(s[1][i - 1],s[0][i - 1]);///d是奇数的时候 可以比赛 前一天不能比赛
        }
        cout<<n - max(s[0][n],max(s[1][n],s[2][n]));
    }
    View Code
  • 相关阅读:
    Vue-cli / webpack 加载静态js文件的方法
    shell curl 下载图片并另存为(重命名)
    sublime 技巧与快捷键篇
    es5 温故而知新 创建私有成员、私有变量、特权变量的方法
    es5 温故而知新 简单继承示例
    js 万恶之源 是否滚动到底部?
    ES6 基础知识
    jquery操作select(取值,设置选中)
    WebApi深入学习--特性路由
    Asp.net 代码设置兼容性视图
  • 原文地址:https://www.cnblogs.com/8023spz/p/9061396.html
Copyright © 2011-2022 走看看