제출 #497510

#제출 시각아이디문제언어결과실행 시간메모리
497510armashkaBigger segments (IZhO19_segments)C++17
13 / 100
28 ms47316 KiB
#include <bits/stdc++.h> //#pragma comment(linker, "/stack:200000000") //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr); #define all(v) v.begin(),v.end() #define pb push_back #define sz size() #define ft first #define sd second using namespace std; typedef long long ll; typedef pair<ll, ll> pll; typedef unsigned long long ull; const int N = 1e6 + 5; const ll M = 1e8; const ll inf = 1e18; const ll mod = 1e9; const double Pi = acos(-1); ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;} ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;} ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); } bool odd(ll n) { return (n % 2 == 1); } bool even(ll n) { return (n % 2 == 0); } struct dinamike { ll cnt = 0, sum = 0; } dp[N]; ll n, a[N], pr[N], cur; multiset <ll> st[N]; const void solve(/*Armashka*/) { cin >> n; for (int i = 1; i <= n; ++ i) { cin >> a[i]; pr[i] = pr[i - 1] + a[i]; dp[i] = {1, pr[i]}; } ll cur = 1; //st[1].insert(pr[i]); cur = 1; for (int i = 2; i <= n; ++ i) { ll l = 1, r = i - 1, j = -1; while (l <= r) { ll mid = (l + r) / 2; if (pr[i] - pr[mid] >= dp[mid].sum) l = mid + 1, j = mid; else r = mid - 1; } if (j != -1) { dp[i] = {dp[j].cnt + 1, pr[i] - pr[j]}; } else { dp[i].cnt = dp[i - 1].cnt; } } cout << dp[n].cnt; } signed main() { fast; //freopen("divide.in", "r", stdin); //freopen("divide.out", "w", stdout); int tt = 1; //cin >> tt; while (tt --) { solve(); } } /* 5 4 4 1 2 3 1 3 4 5 3 4 5 2 3 2 1 3 1 1 3 5 2 3 4 5 2 1 3 1 */

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

segments.cpp: In function 'const void solve()':
segments.cpp:45:5: warning: variable 'cur' set but not used [-Wunused-but-set-variable]
   45 |  ll cur = 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...