zoukankan      html  css  js  c++  java
  • POJ-3616

    Milking Time
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 10434   Accepted: 4378

    Description

    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 N hours

    Sample Input

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

    Sample Output

    43

    题意:

    在n时间内,有m个时间段,每段时间的值为v,每一段结束以后要休息r时间才能继续。

    求n时间内v的最大值。

    先按s从小到大排序,而后求出每一项前的最大值,则dp[i]=maxx+dp[j]。

    AC代码:

     1 //#include<bits/stdc++.h>
     2 #include<iostream>
     3 #include<cstring>
     4 #include<cmath>
     5 #include<algorithm>
     6 using namespace std;
     7 
     8 const int MAXN=1010;
     9 int dp[MAXN];
    10 
    11 struct node{
    12     int s,e,v;
    13 }a[MAXN];
    14 
    15 int cmp(node x, node y){
    16     return x.s<y.s;
    17 }
    18 
    19 int main(){
    20     ios::sync_with_stdio(false);
    21     int n,m,r;
    22     while(cin>>n>>m>>r){
    23         for(int i=0;i<m;i++){
    24             cin>>a[i].s>>a[i].e>>a[i].v;
    25         }
    26         sort(a,a+m,cmp);
    27         int res=0;
    28         for(int i=0;i<m;i++){
    29             int maxx=0;
    30             for(int j=0;j<i;j++){
    31                 if(a[j].e+r<=a[i].s&&maxx<dp[j])
    32                 maxx=dp[j];
    33             }
    34             dp[i]=maxx+a[i].v;
    35             res=max(res,dp[i]);
    36         }
    37         cout<<res<<endl;
    38     }
    39     return 0;
    40 }
  • 相关阅读:
    排序--插入排序(Insertion Sort)Java实现
    汉诺塔--递归和非递归 Java实现
    关于mysql使用utf8编码在cmd窗口无法添加中文数据的问题以及解决 方法二
    mysql在cmd中查询到的汉字乱码问题解决 方法一
    mysql绿色版安装以及遇到的问题
    关于按下回车键自动提交表单问题解决
    获取iframe引入页面内的元素
    ORACLE 中如何截取到时间的年月日中的年、月、日
    Jboss 7配置日志
    java中将科学技术发转为正常数据
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/7373486.html
Copyright © 2011-2022 走看看