Submission #1913619
Source Code Expand
#include <iostream> #include <deque> #include <vector> #include <algorithm> using namespace std; class Slide_Max { public: vector<long long>dat; long long size_, L = 0, R = -1; deque<pair<long long, long long>>Q; void init(int size__) { size_ = size__; dat.resize(size_, 0); } void update(long long p, long long x) { dat[p] = x; } long long query(long long l, long long r) { while (R < r) { R++; while (!Q.empty()) { pair<long long, long long>A = Q.back(); if (A.first <= dat[R])Q.pop_back(); else break; } Q.push_back(make_pair(dat[R], R)); } while (L < l) { while (!Q.empty()) { pair<long long, long long>A = Q.front(); if (A.second == L)Q.pop_front(); else break; } L++; } return Q.front().first; } }; long long N, M, K, a[100009], dp[309][100009]; int main() { cin >> N >> M >> K; for (int i = 1; i <= N; i++)cin >> a[i]; for (int i = 0; i < 309; i++) { for (int j = 0; j < 100009; j++)dp[i][j] = (-1LL << 62); } dp[0][0] = 0; for (int i = 0; i < K; i++) { Slide_Max X; X.init(N + 3); for (int j = 0; j <= N; j++) X.update(j, dp[i][j]); for (int j = 1; j <= N; j++) { long long L = j - M, R = j - 1; if (L < 0)L = 0; dp[i + 1][j] = 1LL * (i + 1)*a[j] + X.query(L, R); } } long long maxn = 0; for (int i = 0; i <= N; i++)maxn = max(maxn, dp[K][i]); cout << maxn << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | E869120 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1441 Byte |
Status | WA |
Exec Time | 635 ms |
Memory | 243200 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | 0 / 200 | 0 / 300 | 0 / 100 | ||||||||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt |
subtask1 | sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt |
subtask3 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt |
All | sample_1.txt, sample_2.txt, sample_3.txt, sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | AC | 90 ms | 241920 KB |
sample_2.txt | AC | 106 ms | 241920 KB |
sample_3.txt | AC | 61 ms | 241920 KB |
subtask_1_1.txt | AC | 61 ms | 241920 KB |
subtask_1_2.txt | AC | 107 ms | 241920 KB |
subtask_1_3.txt | AC | 529 ms | 243200 KB |
subtask_1_4.txt | AC | 65 ms | 241920 KB |
subtask_1_5.txt | AC | 107 ms | 243200 KB |
subtask_1_6.txt | AC | 62 ms | 241920 KB |
subtask_1_7.txt | AC | 243 ms | 243200 KB |
subtask_1_8.txt | AC | 528 ms | 243200 KB |
subtask_1_9.txt | AC | 63 ms | 241920 KB |
subtask_2_1.txt | AC | 61 ms | 241920 KB |
subtask_2_2.txt | WA | 61 ms | 241920 KB |
subtask_2_3.txt | AC | 61 ms | 241920 KB |
subtask_2_4.txt | AC | 61 ms | 241920 KB |
subtask_2_5.txt | AC | 61 ms | 241920 KB |
subtask_2_6.txt | AC | 61 ms | 242048 KB |
subtask_2_7.txt | AC | 61 ms | 241920 KB |
subtask_2_8.txt | AC | 61 ms | 241920 KB |
subtask_2_9.txt | AC | 61 ms | 241920 KB |
subtask_3_1.txt | AC | 145 ms | 243200 KB |
subtask_3_2.txt | AC | 150 ms | 243200 KB |
subtask_3_3.txt | AC | 148 ms | 243200 KB |
subtask_3_4.txt | WA | 133 ms | 242956 KB |
subtask_3_5.txt | AC | 65 ms | 241920 KB |
subtask_3_6.txt | WA | 127 ms | 243200 KB |
subtask_3_7.txt | AC | 143 ms | 243200 KB |
subtask_3_8.txt | AC | 70 ms | 241920 KB |
subtask_3_9.txt | WA | 152 ms | 243200 KB |
subtask_4_1.txt | AC | 566 ms | 243200 KB |
subtask_4_10.txt | WA | 536 ms | 243200 KB |
subtask_4_11.txt | WA | 635 ms | 243200 KB |
subtask_4_12.txt | WA | 630 ms | 243200 KB |
subtask_4_13.txt | WA | 630 ms | 243200 KB |
subtask_4_2.txt | WA | 620 ms | 243200 KB |
subtask_4_3.txt | AC | 538 ms | 243200 KB |
subtask_4_4.txt | AC | 570 ms | 243200 KB |
subtask_4_5.txt | AC | 508 ms | 243200 KB |
subtask_4_6.txt | AC | 135 ms | 243200 KB |
subtask_4_7.txt | WA | 374 ms | 243200 KB |
subtask_4_8.txt | AC | 561 ms | 243200 KB |
subtask_4_9.txt | AC | 324 ms | 243200 KB |