poj3616 Milking Time

思路：

dp。

实现：

 #include <iostream>
 #include <cstdio>
 #include <algorithm>
 using namespace std;
 typedef long long ll;
 ll n,m,r;
 struct node
 {
     ll start;
     ll end;
     ll p;
 };
 node a[];
 ll dp[];
 bool cmp(const node & a,const node & b)
 {
     if(a.start != b.start)
     {
         return a.start < b.start;
     }
     return a.end < b.end;
 }
 ll solve()
 {
     for(int i = ;i < m;i ++)
     {
         dp[i] = a[i].p;
         for(int j = ;j < i;j ++)
         {
             if(a[j].end <= a[i].start)
                 dp[i] = max(dp[i], dp[j] + a[i].p);
         }
     }
     ll maxn = ;
     for(int i = ;i < m;i ++)
         maxn = max(maxn, dp[i]);
     return maxn;
 }
 int main()
 {
     cin >> n >> m >> r;
     for(int i = ;i < m;i ++)
     {
         scanf("%lld%lld%lld",&a[i].start,&a[i].end,&a[i].p);
         a[i].end += r;
     }
     sort(a, a + m,cmp);
     cout << solve() << endl;
     return ;
 }