HDU5583 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): 3735    Accepted Submission(s): 1122

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 of at 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亚洲区上海站-重现赛（感谢华东理工）

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:  6216 6215 6214 6213 6212 

 

Statistic | Submit | Discuss | Note

【题解】

水前缀和乱搞，注意细节吧

 #include <iostream>
 #include <cstdio>
 #include <cmath>
 #include <cstdlib>
 #include <cstring>
 #include <ctime>
 #define min(a, b) ((a) < (b) ? (a) : (b))
 #define max(a, b) ((a) > (b) ? (a) : (b))

 inline void swap(long long &x, long long &y)
 {
     long long tmp = x;x = y;y = tmp;
 }

 inline void read(long long &x)
 {
     x = ;char ch = getchar(), c = ch;
     while(ch < '' || ch > '')c = ch, ch = getchar();
     while(ch <= '' && ch >= '')x = x *  + ch - '', ch = getchar();
     if(c == '-')x = -x;
 }

 const long long INF = 0x3f3f3f3f;
 const long long MAXN =  + ;

 long long num[MAXN], tot, n, t, sum[MAXN], ans;

 int main()
 {
     read(t);
     for(register int tt = ;tt <= t;++ tt)
     {
         char tmp;tmp = getchar();
         while(tmp != '' && tmp != '')tmp = getchar();
         tot = ;memset(num, , sizeof(num));
         ans = -;
         char now = tmp;++ tot;
         ++ num[tot];
         for(register long long i = ;;++ i)
         {
             tmp = getchar();
             if(tmp != '' && tmp != '')break;
             if(tmp == now)++ num[tot];
             else ++ tot, ++num[tot], now = tmp;
         }
         for(register long long i = ;i <= tot;++ i)
             sum[i] = sum[i - ] + num[i] * num[i];
         ans = sum[tot];
         for(register long long i = ;i < tot;++ i)
         {
             if(i !=  && num[i] == )
                 ans = max(ans,
                           sum[tot] - (sum[i + ] - sum[i - ])
                            + (num[i - ] + num[i + ] + num[i])
                             * (num[i - ] + num[i + ] + num[i]));
             else
                 ans = max(ans,
                           sum[tot] - (sum[i + ] - sum[i - ]) +
                           max((num[i] - ) * (num[i] - ) + (num[i + ] + ) * (num[i + ] + ),
                                 (num[i] + ) * (num[i] + ) + (num[i + ] - ) * (num[i + ] - )));
         }
         printf("Case #%d: %lld\n", tt, ans);
     }
     return ;
 }

HDU5583