제출 #173504

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
173504		juggernaut	Bigger segments (IZhO19_segments)	C++14	37 / 100	1539 ms	2272 KiB

segments

//Just try and the idea will come
#include<bits/stdc++.h>
#define ll long long int
#define fr first
#define sc second
using namespace std;
ll pref[500001],i,n,j;
pair<ll,ll>dp[500001];
int main(){
    scanf("%lld",&n);
    for(i=1;i<=n;i++){
        scanf("%lld",&pref[i]);
        pref[i]+=pref[i-1];
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=i;j++)
            if(pref[i]-pref[j-1]>=dp[j-1].sc)dp[i]={dp[j-1].fr+1,pref[i]-pref[j-1]};
    printf("%lld",dp[n].fr);
}

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

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

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