CF 237A Flipping Game 简单的统计就过了。。

本文链接：https://blog.csdn.net/hlyfalsy/article/details/9247703

Iahub got bored, so he invented a game to be played on paper.

He writes n integers a1, a2, ..., an. Each of those integers can be either 0 or 1. He's allowed to do exactly one move: he chooses two indices i and j (1 ≤ i ≤ j ≤ n) and flips all values ak for which their positions are in range [i, j] (that is i ≤ k ≤ j). Flip the value of x means to apply operation x = 1 - x.

The goal of the game is that after exactly one move to obtain the maximum number of ones. Write a program to solve the little game of Iahub.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 100). In the second line of the input there are n integers:a1, a2, ..., an. It is guaranteed that each of those n values is either 0 or 1.

Output

Print an integer — the maximal number of 1s that can be obtained after exactly one move.

   Sample test(s) 
 
     input 
   
5
1 0 0 1 0

     output 
   
4

     input 
   
4
1 0 0 1

     output 
   
4

Note

In the first case, flip the segment from 2 to 5 (i = 2, j = 5). That flip changes the sequence, it becomes: [1 1 1 0 1]. So, it contains four ones. There is no way to make the whole sequence equal to [1 1 1 1 1].

In the second case, flipping only the second and the third element (i = 2, j = 3) will turn all numbers into 1.

题目意思：

就是把区间(i,j) 中的0变成1，1变成0. 只变化一次情况下，输出变换后。全部1的数目。

题解:

区间in[i][j] 记录区间(i,j) 中1的个数，out[i][j] 记录区间(i,j) 中0的个数。。然后答案就是 max(ans, out[i][j]-in[i][j])+原先的1的数目。。

/*
 * @author ipqhjjybj
 * @date  20130704
 *
 */

#include <cstdio>
#include <cstring>
#include <iostream>
#define clr(x,k) memset((x),(k),sizeof(x))
#define MAX(a,b) ((a)>(b)?(a):(b))
using namespace std;
int fp[105][105];
int in[105][105],out[105][105];
int map[105],n;
int main(){
    int i,j,max,k,all;
    while(scanf("%d",&n)!=EOF){
        clr(fp,0);max=-100;
        for(i=1;i<=n;i++)
            scanf("%d",&map[i]);
        for(i=1;i<=n;i++)
            in[i][i]=map[i],out[i][i]=1-map[i];

        for(i=1;i<=n;i++)
            for(j=i+1;j<=n;j++){
                    in[i][j]=in[i][j-1]+map[j];
                    out[i][j]=out[i][j-1]+1-map[j];
            }
        //for(i=1;i<=n;i++)
        //    for(j=1;j<=n;j++)
         //       printf("out[%d][%d]=%d\n",i,j,out[i][j]);
        //for(i=1;i<=n;i++)
         //   for(j=1;j<=n;j++)
          //      printf("in[%d][%d]=%d\n",i,j,in[i][j]);
        all = in[1][n];
        for(i=1;i<=n;i++)
            for(j=i;j<=n;j++){
                max=MAX(out[i][j]-in[i][j],max);
            }
        printf("%d\n",max+all);
    }
    return 0;
}