제출 #299746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299746		dantoh000	Bigger segments (IZhO19_segments)	C++14	37 / 100	1538 ms	1592 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];
int main(){
    scanf("%d",&n);
    for (int i = 1; i <= n; i++){
        scanf("%lld",&p[i]);
        p[i]+=p[i-1];
        dp[i] = {0,0};
        for (int j = i-1; j >= 0; j--){
            if (p[i]-p[j] >= p[j]-p[dp[j].se]){
                dp[i] = max(dp[i],{dp[j].fi+1, j});
                break;
            }
        }
    }
    printf("%d",dp[n].fi);
}

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

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

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