Submission #952496

#	Time	Username	Problem	Language	Result	Execution time	Memory
952496		nguyennh	Divide and conquer (IZhO14_divide)	C++14	17 / 100	1041 ms	600 KiB

divide

#include<bits/stdc++.h>
#define el '\n'
using namespace std ;

const int MN = 1e5 + 6;

int x[MN] , g[MN] , d[MN] , n;

namespace sub_trau{
  void solve(){
    int64_t ans = 0;
    for ( int i = 1 ; i <= n ; i++ ){
      for ( int j = i ; j <= n ; j++ ){
        int64_t energy = 0 , gold = 0;
        for ( int k = i ; k <= j ; k++ ){
          energy += d[k];
          gold += g[k];
        }
        if (energy >= x[j] - x[i]) ans = max(ans , gold);
      }
    }
    cout << ans;
  }
}

int32_t main (){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for ( int i = 1 ; i <= n ; i++ ) cin >> x[i] >> g[i] >> d[i];
  if (n <= 5000) sub_trau::solve();
}

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