# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521540 | Kalashnikov | Divide and conquer (IZhO14_divide) | C++17 | 1034 ms | 3280 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 ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
ll x[N] , g[N], d[N] , p[N] , ps[N];
void solve(int tc) {
int n;
cin >> n;
for(int i = 1; i <= n; i ++) {
cin >> x[i] >> g[i] >> d[i];
p[i] = p[i-1] + d[i];
ps[i] = ps[i-1] + g[i];
}
ll ans = 0;
for(int i = 1; i <= n; i ++) {
for(int j = i; j <= n; j ++) {
if(x[j] - x[i] <= p[j] - p[i-1]) {
ans = max(ans , ps[j] - ps[i-1]);
}
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... |