Submission #299745

#	Time	Username	Problem	Language	Result	Execution time	Memory
299745		dantoh000	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	512 KiB

segments

#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll, int> li;
ii dp[500005];
int n;
ll p[500005];
priority_queue<li ,vector<li>, greater<li> > pq;
int main(){
    scanf("%d",&n);
    pq.push({0,0});
    for (int i = 1; i <= n; i++){
        scanf("%lld",&p[i]);
        p[i]+=p[i-1];
        for (int j = i-1; j >= 0; j--){
            if (p[i]-p[j] >= p[j]-p[dp[j].se]){
                dp[i].fi = dp[pq.top().se].fi + 1;
                dp[i].se = pq.top().se;
                break;
            }
        }
    }
    printf("%d",dp[n].fi);
}

Compilation message (stderr)

segments.cpp: In function 'int main()':
segments.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
segments.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |         scanf("%lld",&p[i]);
      |         ~~~~~^~~~~~~~~~~~~~

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