# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1040392 | vjudge1 | Divide and conquer (IZhO14_divide) | C++17 | 63 ms | 7932 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>
using namespace std;
main()
{
long long n;
cin >> n;
vector<long long> x(n+1), g(n+1), d(n+1), g1(n+1, 0), d1(n+1, 0);
for (long long i = 1; i <= n; ++i)
{
cin >> x[i] >> g[i] >> d[i];
g1[i] = g1[i-1] + g[i];
d1[i] = d1[i-1] + d[i];
}
vector <long long> h(n+2);
for (long long i=1; i<=n+1; i++) h[i]=-1e15;
for (long long i=n; i>=1; i--) h[i]=max(h[i+1],d1[i]-x[i]);
long long res = 0;
for (long long i=1; i<=n; i++)
{
long long l = i, r = n, temp;
while(l <= r)
{
long long mid = (l + r) / 2;
if (h[mid] >= d1[i - 1] - x[i])
{
temp = mid;
l = mid + 1;
}
else r = mid - 1;
}
res=max(res,g1[temp] - g1[i - 1]);
}
cout << res;
return 0;
}
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... |