제출 #707769

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

segments

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, A[500005], P[500005];
pi dp[3005];


void solve(){
	cin >> n;
	for(int i=1;i<=n;i++)cin >> A[i], P[i] = P[i-1] + A[i];
	for(int i=1;i<=n;i++){
		dp[i] = {-1e18, -1e18};
		for(int j = i - 1; j >= 0; j--){
			if(-dp[j].se <= P[i] - P[j])dp[i] = max(dp[i], {dp[j].fi + 1, P[j] - P[i]});
		}
	}
	cout << dp[n].fi;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

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

segments.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main(){
      | ^~~~

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