hdu(4502)

题目： http://acm.hdu.edu.cn/showproblem.php?pid=4502

 

#include <stdio.h>
#include<string.h>
#include<iostream>
#include <math.h>
using namespace std;
const int maxn = 1005;
struct work{
    int s;
    int e;
    int c;
    friend bool operator<(const work &a,const work &b){
        return a.e<b.e;
    }
}w[maxn];
int dp[maxn];
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int m,n;
        scanf("%d%d",&m,&n);
        for(int i = 1;i <=n;i++)
            scanf("%d%d%d",&w[i].s,&w[i].e,&w[i].c);
        sort(w+1,w+n+1);
        
        memset(dp, 0,sizeof(dp));
        for(int i = 0;i <=n;i++){
            if(w[i].e>m)continue;
            for(int j = w[i].e;j <= m;j++)
                if(dp[w[i].s-1]+w[i].c>dp[j])
                    dp[j] = dp[w[i].s-1]+w[i].c;
        }
        //for(int i = 0;i<= m;i++)
        printf("%d\n",dp[m]);
        
    }
    return 0;
}