Submission #392809

#	Time	Username	Problem	Language	Result	Execution time	Memory
392809		SavicS	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	332 KiB

segments

#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 = 500005;
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;
int niz[maxn];

int main() 
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    cin >> n;
    ff(i,1,n)cin >> niz[i];

    int br = 0;

    ll pre = 0;
    ff(i,1,n) {
        br += 1;

        int j = i;
        ll zbir = niz[i];
        while(j + 1 <= n && zbir < pre) {
            j += 1;
            zbir += niz[j];
        }

        pre = zbir;
        i = j;

    }

    cout << br << endl;

    return 0;
}
/**

4
2 3 1 7

5
6 2 3 9 13

3
3 1 2



// probati bojenje sahovski ili slicno

**/

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