제출 #210226

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210226		super_j6	Bigger segments (IZhO19_segments)	C++14	0 / 100	5 ms	376 KiB

segments

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define pi pair<long long, long long>
#define f first
#define s second
 
const int maxn = 500000;
int n;
int a[maxn];
pi dp[maxn];
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n;
	
	for(int i = 1; i <= n; i++) cin >> a[i];
	
	for(int i = 1; i <= n; i++){
		for(long long j = i - 1, s = a[i]; j >= 0; j--){
			if(dp[j].f >= dp[i].f && s >= dp[j].s) dp[i] = {dp[j].f + 1, s};
			s += a[j];
		}
		cout << dp[i].f << " " << dp[i].s << endl;
	}
	
	cout << dp[n].f << endl;
 
	return 0;
}

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