区间转换求最大值

Iahub got bored, so he invented a game to be played on paper.
He writes n integers a 1, a 2, …, a n. 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 a k 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.InputThe first line of the input contains an integer n (1 ≤ n ≤ 100). In the second line of the input there are n integers: a 1, a 2, …, a n. It is guaranteed that each of those n values is either 0 or 1.OutputPrint an integer — the maximal number of 1s that can be obtained after exactly one move. Examples

Input

5
1 0 0 1 0

Output

4

Input

4
1 0 0 1

Output

4

NoteIn 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.

题意； 在任意区间中将0改为1，将1改为0，求能取得得最大和。

题解；for循环依次判断找出转换后增加的最大数值并记录，最后相加。

#include<stdio.h>
#include<string.h>
int main()
{
    int n,t,i,j,s=0,maxx=-1,d=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
	scanf("%d",&t);
        if(t==0)
        {
            d++;
            if(d>maxx) 
	    maxx=d;
        }
        else
        {
            d--;
            if(d<0)
	    d=0;
        }
        if(d<maxx||d==0)
        s=s+t;
    }
    s=s+maxx;
    printf("%d\n",s);
    return 0;
}