This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void setIO()
{
fast;
}
int main()
{
setIO();
int n;
cin>>n;
vvl a(n + 1,vl(2));
for (int i = 1;i<=n;i++)cin>>a[i][0]>>a[i][1];
sort(a.begin() + 1,a.end());
vl pre(n + 1),dp(n + 1);
ll ans = 0;
for (int i = 1;i<=n;i++)pre[i] = pre[i - 1] + a[i][1];
for (int i = 1;i<=n;i++){
for (int j = i - 1;j>=0;j--){
dp[i] = max(dp[i],pre[i] - pre[j] - (a[i][0] - a[j + 1][0]));
ans = max(ans,dp[i]);
}
}
cout<<ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |