Submission #997952

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <sstream>

#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <deque>
#include <string>

#include <algorithm>
#include <numeric>

#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>

#define pb push_back
#define pbk pop_back
#define mp make_pair
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define foreach(i, a) for (__typeof((a).begin()) i = (a).begin(); i != (a).end(); ++i)
#define len(a) ((int) (a).size())

#ifdef CUTEBMAING
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

#define rank hurank

using namespace std;

typedef long long int64;
typedef long double ld;
typedef unsigned long long lint;

const int inf = (1 << 30) - 1;
const int64 linf = (1ll << 62) - 1;
const int N = 1e6 + 100;

int n, m, k;
int a[N];

int64 dp[N];

int parent[N], rank[N];
int64 value[N];

inline int findSet(int v) {
    if (parent[v] != v) {
        return parent[v] = findSet(parent[v]);
    }
    return v;
}

inline void unite(int a, int b) {
    a = findSet(a);
    b = findSet(b);
    if (a == b) {
        return ;
    }
    if (rank[a] == rank[b]) {
        rank[a]++;
    }
    if (rank[a] > rank[b]) {
        swap(a, b);
    }
    parent[a] = b;
}

int main() {
#ifdef XCODE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }
    for (int i = 0; i < k; i++) {
        for (int j = n - 1; j >= 0; j--) {
            dp[j + 1] = dp[j];
        }
        dp[0] = 0;
        for (int j = 0; j < n; j++) {
            parent[j] = j;
            rank[j] = 0;
        }
        vector<pair<int64, int>> stack;
        for (int j = 0; j < n; j++) {
            pair<int64, int> curValue(dp[j] + 1ll * (i + 1) * a[j], j);
            while (len(stack) > 0 && stack.back().fs <= curValue.fs) {
                unite(stack.back().sc, curValue.sc);
                stack.pbk();
            }
            value[findSet(curValue.sc)] = curValue.fs;
            stack.pb(curValue);
            dp[j] = value[findSet(max(0, j - m))];
        }
    }
    cout << *max_element(dp, dp + n) << endl;
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:86:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
                           ^

Judge Result