제출 #497389

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497389		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>
#define int long long

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;

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    freopen ( "sum.in", "r", stdin )
*/

int n;
int a[ 500001 ];

bool f( int o = 1, int sum = 0, int col = 0 ) {
	if ( o == n + 1 ) {
		mx = max( mx, col + 0ll );
		return true;
	}
	int num = 0;
	for ( int i = o; i <= n; i ++ ) {
		num += a[ i ];
		if ( num >= sum ) {
			if ( f( i + 1, num, col + 1 ) && o != 1 )
				return true;
		}
	}
	return false;
}

main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cin >> n;
	for ( int i = 1; i <= n; i ++ ) {
		cin >> a[ i ];
	}
	f();
	cout << mx;
}

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

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

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