Submission #1867582

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
#include <string.h>
#include <set>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;

typedef double LD;
typedef long long LL;
typedef pair<int, int> PII;
#define MP make_pair
#define PB push_back
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); --i)
#define REP(i, t) FOR(i,0,t)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())

const LL MOD = 1000000007;
const int INF = 1e9;
const LL LINF = 1LL * INF * INF;
const int MAXN = 2007;
const LD EPS = 1e-7;

LL A[MAXN], S[MAXN];

int main()
{
	ios_base::sync_with_stdio(0);
	//freopen("In.txt", "r", stdin);
	int n;
	LL x, ans = 0, maxs = 0;
	cin >> n >> x;
	REP(i, n)
		cin >> A[i];
	REP(i, n)
	{
		int b = 0;
		FOR(j, 1, n)
		{
			if (A[(i - j + n) % n] + x * max(maxs, S[(i - j + n) % n] + j) <
				A[(i - b + n) % n] + x * max(maxs, S[(i - b + n) % n] + b))
				b = j;
		}
		maxs = max(maxs, S[(i - b + n) % n] + b);
		ans += A[(i - b + n) % n];
	}
	cout << ans + x * maxs;
	//cout << endl; system("pause");
	return 0;
}

Submission Info

Judge Result