Submission #870490

#TimeUsernameProblemLanguageResultExecution timeMemory
870490KiaRezBigger segments (IZhO19_segments)C++17
37 / 100
1531 ms7560 KiB
/* IN THE NAME OF GOD */ #include <bits/stdc++.h> // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") using namespace std; typedef long long ll; typedef pair<ll, ll> pll; typedef pair<int, int> pii; typedef long double ld; #define F first #define S second #define Mp make_pair #define pb push_back #define pf push_front #define size(x) ((ll)x.size()) #define all(x) (x).begin(),(x).end() #define kill(x) cout << x << '\n', exit(0); #define fuck(x) cout << "(" << #x << " , " << x << ")" << endl #define endl '\n' const int N = 3e5+23, lg = 18; ll Mod = 1e9+7; //998244353; inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;} inline ll poww(ll a, ll b, ll mod=Mod) { ll ans = 1; a=MOD(a, mod); while (b) { if (b & 1) ans = MOD(ans*a, mod); b >>= 1; a = MOD(a*a, mod); } return ans; } ll t, n, a[N], dp[N], pd[N]; int main () { ios_base::sync_with_stdio(false), cin.tie(0); cin>>n; for(int i=1; i<=n; i++) cin>>a[i]; dp[1]=a[1], pd[1]=1; for(int i=2; i<=n; i++) { ll x = 0; for(int j=i; j>=1; j--) { x += a[j]; if(x >= dp[j-1]) { pd[i] = pd[j-1] + 1; dp[i] = x; break; } } } cout<<pd[n]<<endl; 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...