제출 #287853

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

segments

#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
int n;
int a[500005];
ii dp[500005];
ll p[500005];
int main(){
    scanf("%d",&n);
    for (int i = 1 ; i <= n; i++){
        scanf("%d",&a[i]);
        p[i] = p[i-1]+a[i];
    }
    dp[0] = ii(0,0);
    for (int i = 1; i <= n; i++){
        for (int j = 0; j < i; j++){
            if (p[i]-p[j] >= dp[j].se){
                if (dp[i].fi < dp[j].fi+1 || (dp[i].fi == dp[j].fi+1 && dp[i].se > p[i]-p[j]) ){
                    dp[i] = {dp[j].fi+1, p[i]-p[j]};
                }
            }
        }
    }
    printf("%d\n",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("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~

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