Submission #497412

#TimeUsernameProblemLanguageResultExecution timeMemory
497412ergaganBigger segments (IZhO19_segments)C++17
0 / 100
1 ms204 KiB
//я так много думал, что опять попал #include <bits/stdc++.h> #define all(x) x.begin(),x.end() #define pb push_back #define ppb pop_back #define pf push_front #define ppf pop_front #define f first #define s second #define left(v) v + v #define right(v) v + v + 1 #define ub upper_bound #define lb lower_bound #define pll pair<ll,ll> //17 SEVENTEEN //#pragma comment(linker, "/stack:200000000") //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") using namespace std; typedef long long ll; const long double Pi = acos(-1.0); const ll dx[] = {0,0,1,-1}; const ll dy[] = {1,-1,0,0}; const ll N = (ll) 1e6 + 17; const ll M = (ll) 5e3 + 69; const ll inf = (ll) 1e14 + 3; const ll mod = (ll) 1e9 + 7; ll sq(ll x) { return x * x; } ll zxc = 1, a[N], p[N]; void solve() { ll n; cin >> n; for(ll i = 1; i <= n; i++) { cin >> a[i]; p[i] = p[i - 1] + a[i]; } ll sum = 0, ans = 0; for(ll i = 1; i <= n; i++) { sum = p[i]; ll cnt = 1, cur = 0; for(ll j = i + 1; j <= n; j++) { cur += a[j]; if(cur >= sum) cnt++, sum = cur, cur = 0; } ans = max(cnt, ans); } cout << ans << "\n"; } int main(/*Уверенно*/) { ios_base::sync_with_stdio(0); cin.tie(0); /* freopen(".in", "r", stdin); freopen(".out", "w", stdout); */ // cin >> zxc; while(zxc--) { solve(); } return 0; } // さよならさ いかなくちゃ
#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...