제출 #685379

#제출 시각아이디문제언어결과실행 시간메모리
685379OrazBBigger segments (IZhO19_segments)C++14
13 / 100
1569 ms340 KiB
#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]; 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]; } bit(2); cout << mx; }

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

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