CSES-Problem-Set/Dynamic Programming/Projects.cpp at main · saikumar1752/CSES-Problem-Set · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include<iostream>
#include<vector>
#include<climits>
#include<map>
#include<cstring>
#include<array>
usingnamespacestd;

signedmain()
{
longlong n;
 cin >> n;
 vector<longlong> a(n), b(n), p(n);
 map<longlong, longlong> compress;
for(longlong i=0;i<n;i++){
 cin>>a[i]>>b[i]>>p[i];
 b[i]++;
 compress[a[i]];
 compress[b[i]];
 }
longlong coords = 0;
for (auto &v : compress)
 {
 v.second = coords++;
 }
 vector<vector<pair<longlong, longlong>>> projects(coords);
for (longlong i = 0; i < n; i++)
 {
 projects[compress[b[i]]].emplace_back(compress[a[i]], p[i]);
 }
 vector<longlong> dp(coords, 0);
for(longlong i=0;i<coords;i++){
 dp[i]=i>0?dp[i-1]:dp[i];
for(auto p : projects[i]){
 dp[i]=max(dp[i], dp[p.first]+p.second);
 }
 }
 cout << dp[coords - 1] << endl;
}