题意:给定n种颜料以及每种颜料的数量。涂色原则1,相邻颜色不同;2,若第i块涂颜料x,那么i+1块涂颜料x+1(n的话涂1)。问你最多可以涂多少块。
思路:首先求整体循环数即所有颜料数量最小的Min,全减去后求最长连续的非0段len。结果就是Min * n + len。
AC代码:注意左右端点,还有数据会爆int
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (200000+10)
#define MAXM (500000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
int a[MAXN];
int main()
{
int n; Ri(n);
LL ans = 0;
int Min = INF;
for(int i = 0; i < n; i++)
{
Ri(a[i]);
Min = min(Min, a[i]);
}
ans = 1LL * Min * n;
int len = 0, temp = 0;
for(int i = 0; i < n; i++)
{
a[i] -= Min;
if(a[i] == 0)
{
if(len)
temp = max(temp, len);
len = 0;
}
else
len++;
}
if(len)
temp = max(temp, len);
int num = 0, i = 0;
while(a[i] && i < n) i++, num++;
i = n-1;
while(a[i] && i >= 0) i--, num++;
temp = max(temp, num);
Pl(ans + temp);
return 0;
}