Rest Stops(贪心)

题目

• Problem Description
  Farmer John and his personal trainer Bessie are hiking up Mount Vancowver. For their purposes (and yours), the mountain can be represented as a long straight trail of length L meters (1≤L≤10⁶). Farmer John will hike the trail at a constant travel rate of r_F seconds per meter (1≤r_F≤10⁶). Since he is working on his stamina, he will not take any rest stops along the way.

  Bessie, however, is allowed to take rest stops, where she might find some tasty grass. Of course, she cannot stop just anywhere! There are N rest stops along the trail (1≤N≤10⁵); the i-th stop is x_i meters from the start of the trail (0<x_i<L) and has a tastiness value cici (1≤c_i≤10⁶). If Bessie rests at stop ii for tt seconds, she receives c_i⋅t tastiness units.

  When not at a rest stop, Bessie will be hiking at a fixed travel rate of r_B seconds per meter (1≤r_B≤10⁶). Since Bessie is young and fit, r_B is strictly less than r_F.

  Bessie would like to maximize her consumption of tasty grass. But she is worried about Farmer John; she thinks that if at any point along the hike she is behind Farmer John on the trail, he might lose all motivation to continue!

  Help Bessie find the maximum total tastiness units she can obtain while making sure that Farmer John completes the hike.

• Input
  The first line of input contains four integers: L, N,r_F, and r_B. The next N lines describe the rest stops. For each ii between 1 and N, the i+1-st line contains two integers x_i and c_i, describing the position of the i-th rest stop and the tastiness of the grass there.

  It is guaranteed that r_F>r_B, and 0<x₁<…<x_N<L. Note that r_F and r_B are given in seconds per meter!

• Output
  A single integer: the maximum total tastiness units Bessie can obtain.

• input
  10 2 4 3
  7 2
  8 1

• output
  15

题意

F和B爬山，在爬山过程中，保证B不被F超过的情况下尽量让B吃到value高的草
求最多能吃到多少value

思路

贪心，每次都去往F前面最高value的草地吃草，知道F最上后再寻找下一个最高value的草，这样每次吃到的草都是F前面最高value的
数据要用LL存

代码

#include <bits/stdc++.h>
using namespace std;

struct r {
    int l;
    int val;
    bool friend operator<(r a,r b) {
        if(a.val!=b.val)
            return a.val>b.val;
        else return a.l<b.l;
    }
} r[1000010];

int main() {
    int L,N,rf,rb;
    while(scanf("%d %d %d %d",&L,&N,&rf,&rb)!=EOF) {

        int l,val;
        for(int n=1; n<=N; ++n) {
            scanf("%d %d",&r[n].l,&r[n].val);
        }
        sort(r+1,r+1+N);

        int bl=0;
        unsigned long long sum=0;
        for(int i=1; i<=N; ++i) {
            if(r[i].l > bl) {
                unsigned long long t2=r[i].val;
                unsigned long long t= (rf-rb) * t2;
                sum+=( (r[i].l-bl) * t );
                bl=r[i].l;
            }
        }
        cout << sum <<endl;
    }
    return 0;
}