zoukankan      html  css  js  c++  java
  • R

    Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0..N-1) so that she produces as much milk as possible.

    Farmer John has a list of M (1 ≤ M ≤ 1,000) possibly overlapping intervals in which he is available for milking. Each interval i has a starting hour (0 ≤starting_houri ≤ N), an ending hour (starting_houri < ending_houri ≤ N), and a corresponding efficiency (1 ≤ efficiencyi ≤ 1,000,000) which indicates how many gallons of milk that he can get out of Bessie in that interval. Farmer John starts and stops milking at the beginning of the starting hour and ending hour, respectively. When being milked, Bessie must be milked through an entire interval.

    Even Bessie has her limitations, though. After being milked during any interval, she must rest R (1 ≤ R ≤ N) hours before she can start milking again. Given Farmer Johns list of intervals, determine the maximum amount of milk that Bessie can produce in the N hours.

    Input

    * Line 1: Three space-separated integers: NM, and R
    * Lines 2..M+1: Line i+1 describes FJ's ith milking interval withthree space-separated integers: starting_houri , ending_houri , and efficiencyi

    Output

    * Line 1: The maximum number of gallons of milk that Bessie can product in the Nhours

    Sample Input

    12 4 2
    1 2 8
    10 12 19
    3 6 24
    7 10 31

    Sample Output

    43
    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    using namespace std;
    
    #define MAXN 1003
    /*
    最长递增子序列的变形
    */
    int n,m,r;
    struct node
    {
        int beg,end,v,sum;
    }a[MAXN];
    bool cmp(node a,node b)
    {
        return a.beg<b.beg;
    }
    int main()
    {
        scanf("%d%d%d",&n,&m,&r);
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&a[i].beg,&a[i].end,&a[i].v);
            a[i].sum = a[i].v;
        }
        sort(a,a+m,cmp);
        int ans = 0;
        for(int i=1;i<m;i++)
        {
            int Max = 0;
            for(int j=0;j<i;j++)
            {
                if(a[i].beg-a[j].end>=r)
                {
                    Max = max(Max,a[j].sum);
                }
            }
            a[i].sum += Max;
            ans = max(a[i].sum,ans);
        }
        printf("%d
    ",max(ans,a[0].v));
        return 0;
    }
  • 相关阅读:
    Python操作MySQL数据库
    Spark学习--Structured Streaming
    YumRepo Error: All mirror URLs are not using ftp, http[s] or file.
    Spark学习--SparkStreaming
    Spark学习--SparkSQL04
    Spark学习--SparkSQL03
    Spark学习--SparkSQL02
    Bootstrap简介
    Linux Shell系列教程之(一)Shell简介
    Linux命令之必须掌握的十条命令
  • 原文地址:https://www.cnblogs.com/joeylee97/p/6653123.html
Copyright © 2011-2022 走看看