Problem - 1 - Codeforces
题意:较复杂,简单描述困难,原题描述的很好了
思路:线性状态dp,二维表示打到第i个城有j个人的最大贡献值,最难的是有路线转移,由于每一条路只在在u点时起到作用,我们实际上并不需要建图,而是对于每一个边,将其起始点与终点贡献值(包括自己单个点),存在Pair数组里,每到一个点能取则取(同时遍历人的数量(注意上限))
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>
//#define int ll
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 1000000007;
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int n, m, k;
int a[N], b[N], c[N];
int to[N];
int dp[5500][5500];
vector<PII> ves;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll MOD) {
ll res = 1;
while (b) {
if (b & 1) res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
inline void init() {}
void slove()
{
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i] >> c[i], to[i] = i;
while (m--)
{
int u, v;
cin >> u >> v;
to[v] = max(to[v],u);
}
pre(i, 1, n) ves.push_back({ to[i],c[i] });
sort(all(ves));
int flag = 0;
pre(i, 0, k) dp[0][i] = 0;
pre(i, k + 1, 5000) dp[0][i] = -INF;
pre(i, 1, n)
{
pre(j, 0, 5000) dp[i][j] = -INF;
pre(j, a[i], 5000)
dp[i][j + b[i]] = max(dp[i][j + b[i]], dp[i - 1][j]);
while (flag < ves.size() && ves[flag].x == i)
{
pre(j, 0, 5000-1)
{
dp[i][j] = max(dp[i][j], dp[i][j + 1] + ves[flag].y);
}flag++;
}
}
int res = -1;
pre(i, 0, 5000)
res = max(res, dp[n][i]);
cout << res << endl;
return;
}
signed main()
{
//IOS;
int _;
//si(_);
_ = 1;
init();
while (_--)
{
slove();
}
return 0;
}