Submission #1192797

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192797		stefanopulos	Bigger segments (IZhO19_segments)	C++20	0 / 100	1 ms	328 KiB

segments

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

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)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 500005; 

int n;
int niz[mxN];

ll pref[mxN];

ll dp[mxN][2];

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    ff(i,1,n)cin >> niz[i];

    ff(i,1,n)pref[i] = pref[i - 1] + niz[i];

    dp[1][0] = 1; dp[1][1] = niz[1]; int j = 0;
    ff(i,2,n){
        dp[i][0] = dp[i - 1][0];
        dp[i][1] = dp[i - 1][1] + niz[i];

        while(j + 1 < i && pref[i] >= pref[j + 1] + dp[j + 1][1]){
            j += 1;
        }

        if(dp[j][0] + 1 > dp[i][0]){
            dp[i][0] = dp[j][0] + 1;
            dp[i][1] = pref[i] - pref[j];
            j = i - 1;
        }

    }

    cout << dp[n][0] << '\n';

    return 0;
}
/*

4
2 3 1 7

5
6 2 3 9 13

3
3 1 2

// probati bojenje sahovski
*/
 
 
 
 
 

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27