#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 1e5+5;
ll n, m, a[N], pref[N], dp[N], ans[N];
void solve(){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
pref[i] = a[i];
if(i) pref[i] += pref[i-1];
ans[i] = 1;
dp[i] = pref[i];
}
// dp[0] = a[0];
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(pref[j] - pref[i] >= dp[i] && ans[i]+1 >= ans[j]){
dp[j] = pref[j] - pref[i];
ans[j] = ans[i]+1;
}
}
for(int j=0;j<n;j++) cout<<dp[j]<<" ";
cout<<endl;
}
cout<<ans[n-1]<<"\n";
return;
}
signed main(){
fastios
int t = 1;
//cin>>t;
while(t--) solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
