oj.uz

Submission #681435

# Submission time Handle Problem Language Result Execution time Memory
681435 2023-01-13T05:35:16 Z boykut Divide and conquer (IZhO14_divide) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 100100;
int x[N], g[N], e[N];
long long pe[N], pg[N];

int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> g[i] >> e[i];
    pg[i] = pg[i-1]+g[i];
    pe[i] = pe[i-1]+e[i];
  }
  long long ans = 0;
  for (int r = 1; r <= n; r++) {
    long long mn = LLONG_MAX;
    for (int l = 1; l <= r; l++) {
      if (x[l]-pe[l-1] <= x[r]-pe[r]) {
        mn = pg[l-1];
        break;
      }
    }
    if (mn != LLONG_MAX)
      ans = max(ans, pg[r]-mn);
  }
  cout << ans << "\n";
  return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -