제출 #526327

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526327		CursedCode	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	204 KiB

segments

#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
long long S[501000];
int w[501000], n, D[501000], P[501000], res;
int main(){
    int i;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d",&w[i]);
        S[i]=S[i-1]+w[i];
    }
    for(i=1;i<=n;i++){
        P[i]=max(P[i],P[i-1]);
        D[i]=D[P[i]]+1;
        long long s = S[i]+S[i]-S[P[i]];
        int pv = lower_bound(S+1,S+n+1,s)-S;
        P[pv]=max(P[pv],i);
    }
    for(i=1;i<=n;i++){
    	cout << P[i] << endl;
    }
    printf("%d\n",D[n]);
}

컴파일 시 표준 에러 (stderr) 메시지

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

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