UVALive 7410 && POJ 5583 Kingdom of Black and White (枚举)

Kingdom of Black and White

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 869    Accepted Submission(s): 278

Problem Description

In the Kingdom of Black and White (KBW), there are two kinds of frogs: black frog and white frog.
Now N frogs are standing in a line, some of them are black, the others are white. The total strength of those frogs are calculated by dividing the line into minimum parts, each part should still be continuous, and can only contain one kind of frog. Then the strength is the sum of the squared length for each part.However, an old, evil witch comes, and tells the frogs that she will change the color ofat most one frog and thus the strength of those frogs might change.The frogs wonder the maximum possible strength after the witch finishes her job.

 

Input

First line contains an integer T , which indicates the number of test cases.
Every test case only contains a string with length N , including only 0 (representing
a black frog) and 1 (representing a white frog).

⋅ 1≤T≤50 .

⋅ for 60% data, 1≤N≤1000 .

⋅ for 100% data, 1≤N≤105 .

⋅ the string only contains 0 and 1.

 

Output

For every test case, you should output "Case #x: y",where x indicates the case number and counts from 1 and y is the answer.

 

Sample Input

  
  

   
   2
000011
0101
  
  

 

Sample Output

  
  

   
   Case #1: 26
Case #2: 10
  
  

 

Source

2015ACM/ICPC亚洲区上海站-重现赛（感谢华东理工）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5583

题目大意：给一个0/1串，可以改变其中一个(0改成1 或 1改成0)，求连续的0/1串长度平方和的最大值

题目分析：预处理一下原连续的情况，然后枚举改变的点，显然要变变端点才会更大，要注意一种情况就是连续0跟1个1和连续1跟1个0，特判一下即可

#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;
int const MAX = 1e5 + 10;
char s[MAX];
struct NUM
{
    ll num;
    char ch;
    int l, r;
}d[MAX];

ll f(ll x)
{
    return x * x;
}

int main()
{
    int T;
    scanf("%d", &T);
    for(int ca = 1; ca <= T; ca++)
    {
        printf("Case #%d: ", ca);
        scanf("%s", s);
        int len = strlen(s), cnt = 0;
        d[cnt].l = 0;
        d[cnt].num = 1;
        d[cnt].ch = s[0];
        int i;
        for(i = 1; i < len; i++)
        {
            if(s[i] == s[i - 1])
                d[cnt].num ++;
            else
            {
                d[cnt].r = i - 1;
                cnt ++;
                d[cnt].ch = s[i];
                d[cnt].l = i;
                d[cnt].num = 1;
            }
        }
        d[cnt ++].r = i - 1;    
        ll ans = 0;
        for(int i = 0; i < cnt; i++)
            ans += f(d[i].num);
        ll tmp = ans;
        for(int i = 0; i < cnt - 1; i++)
        {
            ll cur = f(d[i].num) + f(d[i + 1].num);
            if(d[i + 1].l == d[i + 1].r && i + 2 < cnt)
            {
                cur += f(d[i + 2].num);
                ans = max(ans, tmp - cur + f(d[i + 2].r - d[i].l + 1));
            }
            else
                ans = max(ans, tmp - cur + f(d[i + 1].l - d[i].l + 1) + f(d[i + 1].r - d[i + 1].l));
        }
        printf("%lld\n", ans);
    }
}