제출 #685383

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

segments

#include <bits/stdc++.h>
#define N 500005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
using namespace std;

int a[N], mx, n, c[N];
ll dp[N][5];

void bit(int x){
	if (x == n+1){
		ll sum = 0;
		vector<ll> vec;
		for (int i = 1; i <= n; i++){
			if (c[i]){
				vec.pb(sum);
				sum = 0;
			}
			sum += a[i];
		}
		vec.pb(sum);
		bool tr = 0;
		for (int i = 1; i < vec.size(); i++){
			if (vec[i] < vec[i-1]) tr = 1;
		}
		if (!tr) mx = max(mx, (int)vec.size());
		return;
	}
	for (int i = 0; i < 2; i++){
		c[x] = i;
		bit(x+1);
	}
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
	}
	if (n <= 20){
		bit(2);
		return cout << mx, 0;
	}
	dp[1][1] = 1;
	dp[1][2] = a[1];
	for (int i = 2; i <= n; i++){
		ll sum = 0;
		for (int j = i; j > 1; j--){
			sum += a[j];
			if (dp[j-1][2] <= sum){
				dp[i][1] = dp[j-1][1]+1;
				dp[i][2] = sum;
				break;
			}
		}
		if (!dp[i][1]){
			dp[i][1] = 1;
			dp[i][2] = sum+a[1];
		}
	}
	cout << dp[n][1];
}	

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

segments.cpp: In function 'void bit(int)':
segments.cpp:28:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   for (int i = 1; i < vec.size(); i++){
      |                   ~~^~~~~~~~~~~~

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