任务分配()

                                                任务分配

任务分配 - 题目 - Daimayuan Online Judge

 思路：一开始考虑的贪心，发现样例都过不了。。。这个题用dp做，我们定义f[i]为当进行到第i时刻时，我们能够获得的最大收益，那么他有两种转移状态，一种是接下来他什么都不做，能够转移到f[i+1]，另一种是他做一个正好在i时刻开始的任务，能够转移到f[ei]=f[i]+w[i]，所以他只有两种转移状态，用vector存一下以当前时刻结尾的的开始的时间和收益，然后转移一下即可

#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<vector> 
#include<set>
#include<unordered_map>
#include<ctime>
#include<cstdlib>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int> > PIII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}

int T,hackT;
int n,m,k;
vector<PII> vis[1010];
struct Node{
	int l,r,w;
	bool operator < (const Node &k) const {
		return w>k.w;
	}
};

Node w[N];
int f[N];

void solve() {
	n=read();
	
	for(int i=1;i<=n;i++) {
		w[i].l=read(),w[i].r=read(),w[i].w=read();
		vis[w[i].r].push_back({w[i].l,w[i].w});
	}
	
	for(int i=1;i<=1000;i++) {
		f[i]=f[i-1];
		for(int j=0;j<vis[i].size();j++) {
			f[i]=max(f[i],f[vis[i][j].fi]+vis[i][j].se);
		}
	}
	
	write(f[1000],'\n');
}   

int main() {
    // init();
    // stin();

    // scanf("%d",&T);
    T=1; 
    while(T--) hackT++,solve();
    
    return 0;       
}