Submission #377640

#	Time	Username	Problem	Language	Result	Execution time	Memory
377640		SavicS	Divide and conquer (IZhO14_divide)	C++14	17 / 100	1 ms	364 KiB

divide

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
array<ll,3> niz[maxn];

ll pref[maxn];
ll gold[maxn];

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);
	cin >> n;
	ff(i,1,n)ff(j,0,2)cin >> niz[i][j];
	ff(i,1,n)pref[i] = pref[i - 1] + niz[i][2];
   	ff(i,1,n)gold[i] = gold[i - 1] + niz[i][1];
	ll rez = 0;
	int j = 1;
	ff(i,1,n){
		while(j <= n && pref[i] - pref[j - 1] < niz[i][0] - niz[j][0])j += 1;
		rez = max(rez, gold[i] - gold[j - 1]);
	}
	cout << rez << endl;
   	return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

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