제출 #497701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497701		vinnipuh01	Bigger segments (IZhO19_segments)	C++17	0 / 100	0 ms	204 KiB

segments

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
 
using namespace std;
 
const long long oo = 1000000000000000000;
 
long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
 
 
/*
    ViHHiPuh
 
   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))
 
 
    cout << fixed << setprecision(6) << x;
 
 
    freopen ( "sum.in", "r", stdin )
*/

pair<int, int> dp[ 500001 ];
int p[ 500001 ];

int main () {
	int n;
	cin >> n;
	int a[ n + 1 ];
	for ( int i = 1; i <= n; i ++ ) {
		cin >> a[ i ];
		p[ i ] = p[ i - 1 ] + a[ i ];
	}
	dp[ 1 ].first = 1;
	dp[ 1 ].second = 1;
	int l, r, mid;
	for ( int i = 1; i <= n; i ++ ) {
		l = i + 1;
		r = n;
		while ( r > l ) {
			mid = ( l + r ) / 2;
			if ( p[ mid ] >= p[ i - 1 ] + p[ dp[ i - 1 ].second ] ) {
				r = mid;
			}
			else
				l = mid + 1;
		}
		dp[ l ] = max( dp[ l ], { dp[ i ].first + 1, i } );
	}
	cout << dp[ n ].first - 1;
}

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