Submission #998054


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using D = double;
using uint = unsigned int;

#ifdef WIN32
    #define LLD "%I64d"
#else
    #define LLD "%lld"
#endif

#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second

const int maxn = 100005;
const int maxk = 305;

deque<pair<ll, int>> curmax[maxk];

ll del[2 * maxn][maxk];
int a[maxn];
int n, m, k;

int main()
{
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 0; i < n; i++) scanf("%d", &a[i]);
    for (int i = 0; i < k; i++) curmax[i].push_back({-1e18 * (i > 0), -1});
    ll answer = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = k - 1; j >= 0; j--)
        {
//             cout << curmax[j].size() << endl;
            ll curans;
            if (j > 0) {
                while (curmax[j].front().se < i - m) curmax[j].pop_front();
                curans = curmax[j].front().fi + (ll)(j + 1) * a[i];
            } else curans = a[i];
            if (j + 1 == k) answer = max(answer, curans);
            while (!curmax[j + 1].empty() && curmax[j + 1].back().fi <= curans) curmax[j + 1].pop_back();
            curmax[j + 1].push_back({curans, i});
        }
    }
    cout << answer << endl;
    return 0;
}

Submission Info

Submission Time
Task A - Struck Out
User KAN
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1347 Byte
Status AC
Exec Time 390 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &k);
                                ^
./Main.cpp:34:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 0; i < n; i++) scanf("%d", &a[i]);
                                                   ^

Judge Result

Set Name Sample subtask1 subtask2 subtask3 All
Score / Max Score 0 / 0 100 / 100 200 / 200 300 / 300 100 / 100
Status
AC × 3
AC × 10
AC × 12
AC × 21
AC × 43
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, 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 3 ms 512 KB
sample_2.txt AC 3 ms 512 KB
sample_3.txt AC 3 ms 512 KB
subtask_1_1.txt AC 3 ms 512 KB
subtask_1_2.txt AC 35 ms 512 KB
subtask_1_3.txt AC 321 ms 896 KB
subtask_1_4.txt AC 5 ms 512 KB
subtask_1_5.txt AC 20 ms 896 KB
subtask_1_6.txt AC 3 ms 512 KB
subtask_1_7.txt AC 113 ms 896 KB
subtask_1_8.txt AC 322 ms 896 KB
subtask_1_9.txt AC 4 ms 512 KB
subtask_2_1.txt AC 3 ms 512 KB
subtask_2_2.txt AC 3 ms 512 KB
subtask_2_3.txt AC 3 ms 512 KB
subtask_2_4.txt AC 3 ms 512 KB
subtask_2_5.txt AC 3 ms 512 KB
subtask_2_6.txt AC 3 ms 512 KB
subtask_2_7.txt AC 3 ms 512 KB
subtask_2_8.txt AC 3 ms 512 KB
subtask_2_9.txt AC 3 ms 512 KB
subtask_3_1.txt AC 44 ms 896 KB
subtask_3_2.txt AC 45 ms 896 KB
subtask_3_3.txt AC 44 ms 896 KB
subtask_3_4.txt AC 37 ms 768 KB
subtask_3_5.txt AC 5 ms 512 KB
subtask_3_6.txt AC 33 ms 896 KB
subtask_3_7.txt AC 44 ms 896 KB
subtask_3_8.txt AC 7 ms 512 KB
subtask_3_9.txt AC 50 ms 896 KB
subtask_4_1.txt AC 324 ms 1024 KB
subtask_4_10.txt AC 365 ms 896 KB
subtask_4_11.txt AC 384 ms 896 KB
subtask_4_12.txt AC 387 ms 896 KB
subtask_4_13.txt AC 390 ms 896 KB
subtask_4_2.txt AC 386 ms 896 KB
subtask_4_3.txt AC 326 ms 896 KB
subtask_4_4.txt AC 322 ms 896 KB
subtask_4_5.txt AC 279 ms 896 KB
subtask_4_6.txt AC 38 ms 896 KB
subtask_4_7.txt AC 206 ms 896 KB
subtask_4_8.txt AC 317 ms 896 KB
subtask_4_9.txt AC 162 ms 896 KB