# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42472 | MatheusLealV | Divide and conquer (IZhO14_divide) | C++14 | 13 ms | 2668 KiB |
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>
#define N 100050
#define f first
using namespace std;
typedef long long ll;
int cnt;
ll n, sum[N], g[N], x[N], E[N], dp[N], ans, bit[N];
vector<int> v;
map<int, int> mapa;
void upd(int x, ll v)
{
for(int i = x; i < N; i += (i&-i)) bit[i] = min(bit[i], v);
}
int query(int x)
{
ll sum = 2000000000000000000LL;
for(int i = x; i > 0; i -= (i&-i)) sum = min(sum, bit[i]);
return sum;
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin>>n;
for(int i = 1, a, b, c; i <= n; i++)
{
cin>>x[i]>>g[i]>>E[i];
sum[i] = E[i] + sum[i - 1];
g[i] += g[i - 1];
v.push_back(sum[i] - x[i]);
v.push_back(sum[i - 1] - x[i]);
}
for(int i = 0; i < N; i++) bit[i] = 2000000000000000000LL;
sort(v.begin(), v.end());
for(auto x: v) if(!mapa[x]) mapa[x] = ++cnt;
for(int i = 1; i <= n; i++)
{
upd( mapa [ sum[i - 1] - x[i] ], g[i - 1]);
ll q = g[i] - query( mapa[ sum[i] - x[i] ] );
ans = max(ans, q);
}
cout<<ans<<"\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |