Submission #525368

#	Time	Username	Problem	Language	Result	Execution time	Memory
525368		Dilshod_Imomov	Divide and conquer (IZhO14_divide)	C++17	17 / 100	1 ms	332 KiB

divide

# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
// # define int long long
# define fi first
# define se second

using namespace std;

const int N = 1e5 + 7;
const int mod = 1e9 + 7;
// const int INF = 1e18;

int x[N], g[N], d[N];

int32_t main() {
   speed;
   int n;
   cin >> n;
   for ( int i = 1; i <= n; i++ ) {
      cin >> x[i] >> g[i] >> d[i];
      d[i] += d[i - 1];
   }
   int mx = 0;
   for ( int i = 1; i <= n; i++ ) {
      int sum = 0;
      for ( int j = i; j <= n; j++ ) {
         sum += g[j];
         if ( d[j] - d[i - 1] >= x[j] - x[i] ) {
            mx = max( mx, sum );
         }
      }
   }
   cout << mx;
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 31
• Subtask 3: 0 / 52