제출 #392829

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
392829		SavicS	Bigger segments (IZhO19_segments)	C++14	13 / 100	1 ms	336 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];

ll pref[maxn];
int dp[maxn];

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

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

    priority_queue<array<ll,3>, vector<array<ll,3>>, greater<array<ll,3>>> pq;

    int mx = 0;
    ll sum = 0;
    ff(i,1,n) {

        while(!pq.empty() && pq.top()[0] <= pref[i]) {
            // ovaj koji obrisem on ce za sve vece od i isto vaziti
            if(pq.top()[2] >= mx) {
                mx = pq.top()[2];
                sum = pq.top()[1];
            }
            pq.pop();
        }

        dp[i] = mx + 1;

        pq.push({1ll * 2 * pref[i] - sum, pref[i], dp[i]});

    }

    cout << dp[n] << endl;

    return 0;
}
/**

9
4 2 9 9 8 8 9 2 10


5
4 3 1 10 4


4
2 3 1 7

5
6 2 3 9 13

3
3 1 2

// probati bojenje sahovski ili slicno

**/

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