제출 #334160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334160		Kerim	Bigger segments (IZhO19_segments)	C++17	37 / 100	1593 ms	1644 KiB

segments

#include "bits/stdc++.h"
#define MAXN 500009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int dp[MAXN];
ll par[MAXN],cof[MAXN];
int main(){
   // freopen("file.in", "r", stdin);
    int n,x,tmp=0;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
		scanf("%d",&x);
		par[i]=par[i-1]+x;
		for(int j=0;j<i;j++)
			if(cof[j]<=par[i] and dp[j]>=dp[tmp])
				tmp=j;
		dp[i]=dp[tmp]+1;
		cof[i]=2*par[i]-par[tmp];	
    }
    printf("%d\n",dp[n]);
	return 0;
}

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

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

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