oj.uz

답안 #966850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966850 2024-04-20T13:25:06 Z jadai007 Feast (NOI19_feast) C++14
18 / 100
 1000 ms 6152 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;

int n,k, arr[300300], l, r, vis[300300], mx = -1e18, sum, now, ans;

signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> k;
    for(int i = 1; i<=n; ++i) cin >> arr[i];
    if(k == 1){
        for(int i = 1; i<=n; ++i){
            sum+=arr[i];
            if(sum < 0) sum = 0;
            ans = max(ans, sum);
        }
        cout << ans;
        return 0;
    }
    for(int i = 1; i<=k; ++i){
        mx = -1e9 - 7;
        int cnt = 0, now = 0, sum = 0;
        for(int j = 1; j<=n; ++j){
            if(vis[j]){
                sum = 0;
                continue;
            }
            sum+=arr[j];
            cnt++;
            if(mx < sum){
                mx = sum;
                now = cnt;
                r = j;
            }
            if(sum < 0){
                sum = 0;
                cnt = 0;
            }
        }
        if(mx > 0) for(int j = r - now + 1; j<=r; ++j) vis[j] = 1;
        ans+=max(0ll, mx);
    }
    cout << ans;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1018 ms 4944 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 2652 KB Output is correct
2 Correct 20 ms 2908 KB Output is correct
3 Correct 18 ms 2904 KB Output is correct
4 Execution timed out 1054 ms 4956 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2744 KB Output is correct
2 Correct 24 ms 5948 KB Output is correct
3 Correct 26 ms 5872 KB Output is correct
4 Correct 25 ms 5724 KB Output is correct
5 Correct 29 ms 5856 KB Output is correct
6 Correct 30 ms 5684 KB Output is correct
7 Correct 27 ms 5724 KB Output is correct
8 Correct 25 ms 6116 KB Output is correct
9 Correct 30 ms 5928 KB Output is correct
10 Correct 29 ms 6152 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1018 ms 4944 KB Time limit exceeded
2 Halted 0 ms 0 KB -