제출 #501121

#제출 시각아이디문제언어결과실행 시간메모리
501121NachoLibreBigger segments (IZhO19_segments)C++17
27 / 100
1 ms336 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define sz(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() using namespace std; const int N = 500005; int n, b[N][2]; ll a[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 1; i <= n; ++i) { cin >> a[i]; a[i] += a[i - 1]; } a[n + 1] = 1e17; b[1][0] = 1; b[1][1] = 0; int x = 0, y = 0; for(int i = 1; i <= n; ++i) { if(b[i][0] >= x) { x = b[i][0]; y = b[i][1]; } int l = i + 1, r = n + 1; while(l < r) { int m = l + r >> 1; if(a[m] - a[i] >= a[i] - a[y]) r = m; else l = m + 1; } if(x + 1 >= b[l][0]) { b[l][0] = x + 1; b[l][1] = i; } // cout << i << " " << x << " " << y << endl; } cout << x << endl; return 0; }

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

segments.cpp: In function 'int main()':
segments.cpp:26:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |    int m = l + r >> 1;
      |            ~~^~~
#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...