Submission #1026991

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <fstream>
#include <cstring>

using namespace std;
typedef long long LL;

#define MAXN 100010
int n, m, k;
int a[MAXN];
LL dp[2][MAXN];
deque<LL> q;

int main() {
	//freopen("struck_out.in", "r", stdin);
	cin>>n>>m>>k;
	for (int i=0;i<n;i++) scanf("%d", &a[i]);
	memset(dp, 0, sizeof(dp));
	for (int i=0;i<n;i++) {
		dp[(k-1)&1][i] = 1LL*k*a[i];
		//cout<<k-1<<" "<<i<<" = "<<dp[k-1][i]<<endl;
	}
	for (int i=k-2;i>=0;i--) {
		while (q.size()>0) q.pop_back();
		for (int j=n-2;j>=0;j--) {
			// dp[k][n] = max(dp[k+1][n+x]+k*a[n+x]) x<=m
			LL val=dp[(i+1)&1][j+1];
			while (q.size()>0 && q.front()<val) q.pop_front();
			q.push_front(val);
			if ((int)q.size()>m) q.pop_back();
			dp[i&1][j]=max(dp[i&1][j], q.back()+(i+1)*a[j]);
			//cout<<i<<" "<<j<<" = "<<dp[i][j]<<endl;
		}
	}
	LL ret=0;
	for (int i=0;i<n;i++) ret=max(ret, dp[0][i]);
	cout<<ret<<endl;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:35:42: 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