Submission #998217

---

Source Code Expand

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>

using namespace std;

mt19937 mrand(random_device{} ()); 

int rnd(int x) {
  return mrand() % x;
}

typedef long double ld;
typedef long long ll;

#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif

#define pb push_back
#define mp make_pair
#define sz(x) ((int) (x).size())
#define TASK "text"

const int inf = (int) 1.01e9;
const ld eps = 1e-9;
const ld pi = acos((ld) -1.0);

void precalc() {
}

const int maxn = (int) 1e5 + 10;
int a[maxn];

int n, m, k;

int read() {
  if (scanf("%d%d%d", &n, &m, &k) < 3) {
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", a + i);
  }
  return 1;
}

long long infll = (long long) 1e18;

long long dp[maxn];

void solve() {
  for (int i = 0; i < n; ++i) {
    dp[i] = a[i];
  }
  vector<pair<long long, int> > st;
  for (int iter = 1; iter < k; ++iter) {
    st.clear();
    int left = 0;
    for (int i = 0; i < n; ++i) {
      long long d0 = dp[i];

      //eprintf("%lld%c", dp[i], " \n"[i == n - 1]);

      if (left < sz(st) && st[left].second < i - m) {
        ++left;
      }

      dp[i] = sz(st) == left ? -infll : (st[left].first + (long long) a[i] * (iter + 1));

      if (d0 > -infll) {
        while (sz(st) > left && st.back().first <= d0) {
          st.pop_back();
        }
        st.pb(mp(d0, i));
      }
    }
  }
  printf("%lld\n", *max_element(dp, dp + n));
}

int main() {
  precalc();
#ifdef LOCAL
  freopen(TASK ".out", "w", stdout);
  assert(freopen(TASK ".in", "r", stdin));
#endif

  while (1) {
    if (!read()) {
      break;
    }
    solve();
#ifdef DEBUG
    eprintf("Time %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
  }
  return 0;
}

Submission Info

Compile Error

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

Judge Result