This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n,k, arr[300300], l, r, vis[300300], mx, sum, now, ans;
int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> k;
    for(int i = 1; i<=n; ++i) cin >> arr[i];
    for(int i = 1; i<=k; ++i){
        mx = -1e9 - 7;
        int cnt = 0, now = 0, sum = 0;
        for(int j = 1; j<=n; ++j){
            //cout << vis[j] << ' ';
            if(vis[j]){
                sum = 0;
                continue;
            }
            sum+=arr[j];
            cnt++;
            if(sum < 0){
                sum = 0;
                cnt = 0;
            }
            if(mx < sum){
                mx = sum;
                now = cnt;
                r = j;
            }
        }
        for(int j = r - now + 1; j<=r; ++j) vis[j] = 1;
        ans+=mx;
    }
    cout << ans;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |