제출 #224766

#제출 시각아이디문제언어결과실행 시간메모리
224766tictaccatFeast (NOI19_feast)C++14
59 / 100
1095 ms3668 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

int N,K;
int A[500000];
int dp[2][2500];
int best[2][2500];

main() {

    cin >> N >> K;
    for (int i = 0; i < N; i++) cin >> A[i];

    for (int i = 0; i < N; i++) {
        for (int k = 1; k <= K; k++) {
            dp[i%2][k] = A[i] + max(dp[(i+1)%2][k],best[(i+1)%2][k-1]);
            best[i%2][k] = max(best[(i+1)%2][k], dp[i%2][k]);
        }
    }

    cout << best[(N+1)%2][K] << "\n";

}

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

feast.cpp:10:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...