Submission #1133522

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133522		KasymK	Bigger segments (IZhO19_segments)	C++17	100 / 100	71 ms	21912 KiB

segments

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 5e5+5;
int v[N];
ll par[N];
pli dp[N];

int main(){
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        scanf("%d", v+i), par[i]=par[i-1]+v[i];
    dp[1]={v[1], 1};
    priority_queue<pli, vector<pli>, greater<pli>> pq;
    pq.push({2*v[1], 1});
    int mx=0;
    for(int i = 2; i <= n; ++i){
        while(!pq.empty()){
            auto P=pq.top();
            if(par[i]-par[P.ss]<dp[P.ss].ff)
                break;
            pq.pop();
            umax(mx, P.ss);
        }
        dp[i]={par[i]-par[mx], dp[mx].ss+1};
        pq.push({2*par[i]-par[mx], i});
    }
    int answer=dp[n].ss;
    printf("%d\n", answer);
    return 0;
}

Compilation message (stderr)

segments.cpp: In function 'int main()':
segments.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
segments.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%d", v+i), par[i]=par[i-1]+v[i];
      |         ~~~~~^~~~~~~~~~~

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