zoukankan      html  css  js  c++  java
  • A

    Goneril is a very sleep-deprived cow. Her day is partitioned into N (3 <= N <= 3,830) equal time periods but she can spend only B (2 <= B < N) not necessarily contiguous periods in bed. Due to her bovine hormone levels, each period has its own utility U_i (0 <= U_i <= 200,000), which is the amount of rest derived from sleeping during that period. These utility values are fixed and are independent of what Goneril chooses to do, including when she decides to be in bed.

    With the help of her alarm clock, she can choose exactly which periods to spend in bed and which periods to spend doing more critical items such as writing papers or watching baseball. However, she can only get in or out of bed on the boundaries of a period.

    She wants to choose her sleeping periods to maximize the sum of the utilities over the periods during which she is in bed. Unfortunately, every time she climbs in bed, she has to spend the first period falling asleep and gets no sleep utility from that period.

    The periods wrap around in a circle; if Goneril spends both periods N and 1 in bed, then she does get sleep utility out of period 1.

    What is the maximum total sleep utility Goneril can achieve?

    Input

    • Line 1: Two space-separated integers: N and B

    • Lines 2…N+1: Line i+1 contains a single integer, U_i, between 0 and 200,000 inclusive

    Output

    The day is divided into 5 periods, with utilities 2, 0, 3, 1, 4 in that order. Goneril must pick 3 periods.
    Sample Input
    5 3
    2
    0
    3
    1
    4

    Sample Output

    6

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<iostream>
    using namespace std;
    const int maxn=4e3+10;
    int n,b,f[maxn][2],u[maxn],ans;
    void dp()
    {
        for(int i=2;i<=n;i++)
        {
            for(int j=b;j;j--)
            {
                f[j][0]=max(f[j][0],f[j][1]);
                f[j][1]=max(f[j-1][0],f[j-1][1]+u[i]);
            }
        }
    }
    int main()
    {
        ios::sync_with_stdio(false);
        cin>>n>>b;
        for(int i=1;i<=n;i++)
            cin>>u[i];
        memset(f,0xcf,sizeof(f));
        f[0][0]=f[1][1]=0;
        dp();
        ans=max(ans,max(f[b][0],f[b][1]));
        memset(f,0xcf,sizeof(f));
        f[1][1]=u[1];
        dp();
        ans=max(ans,f[b][1]);
        cout<<ans<<"
    ";
        return 0;
    }
  • 相关阅读:
    'utf-8' codec can't decode byte 0xff in position 0: invalid start byte
    Tensorflow滑动平均模型解析
    [TFRecord格式数据]利用TFRecords存储与读取带标签的图片
    [TFRecord文件格式]基本介绍
    tensorflow Image 解码函数
    Tensorflow ActiveFunction激活函数解析
    tensorflow.python.framework.errors_impl.OutOfRangeError: FIFOQueue
    tf.train.shuffle_batch函数解析
    sparse_softmax_cross_entropy_with_logits
    softmax_cross_entropy_with_logits
  • 原文地址:https://www.cnblogs.com/ylrwj/p/11985254.html
Copyright © 2011-2022 走看看