Kingdom of Black and White
.
.
给定一个01串,相邻相同的数字为一块,串的权值定义为所有块长度的平方和。求最多改变一个值使得权值最大。
.
.
解法:首先对于一个连续串,不会改变中间的值,只会更改两头的值,所以先算好原来所有块的长度以及权值,然后一个个更改判断是否会变大就好了,注意一下只有长度为1的块就好了。
.
.
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
const int maxn = 200000;
long long a[maxn] = {0}, ans, sum, temp;
int n, m;
char c, be;
int main() {
int tt;
scanf("%d\n", &tt);
for (int cases = 1; cases <= tt; cases++) {
a[0] = 0;
c = getchar();
be = '2';
n = 0;
while (c == '0' || c == '1') {
if (c == be) a[n]++;
else {
a[++n] = 1;
be = c;
}
c = getchar();
}
a[n+1] = 0;
sum = 0;
for (int i = 1; i <= n; i++) sum = sum+a[i]*a[i];
ans = sum;
for (int i = 1; i <= n; i++) {
if (a[i] == 1) {
temp = sum-a[i]*a[i]-a[i-1]*a[i-1]-a[i+1]*a[i+1];
temp = temp+(a[i-1]+a[i]+a[i+1])*(a[i-1]+a[i]+a[i+1]);
if (temp > ans) ans = temp;
} else {
temp = sum-a[i]*a[i]-a[i-1]*a[i-1];
temp = temp+(a[i-1]+1)*(a[i-1]+1)+(a[i]-1)*(a[i]-1);
if (temp > ans) ans = temp;
temp = sum-a[i]*a[i]-a[i+1]*a[i+1];
temp = temp+(a[i+1]+1)*(a[i+1]+1)+(a[i]-1)*(a[i]-1);
if (temp > ans) ans = temp;
}
}
printf("Case #%d: %lld\n", cases, ans);
}
}