CodeForces - 327A Flipping Game

Flipping Game

CodeForces - 327A

AYIT-2021 609暑假集训第一周上 搜索和贪心

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.

Examples
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次，且只能翻转一次
题型：贪心

#include<stdio.h>
int a[110];
int main()
{
	int i,j,k,sum,minx,n;
	scanf("%d",&n);
	for(sum=0,i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		sum+=a[i];
		if(!a[i])a[i]=-1;//为了方便判断后面翻转后1的变化量
	}
	for(i=1;i<=n;i++)
		a[i]=a[i-1]+a[i];//用了前缀和 a[i]表示前i个翻转后1的个数与翻转前1的个数的差的相反数
	minx=1;//注意 至少翻转一个，故不能为0或其数
	for(i=0;i<=n;i++)
		for(j=i+1;j<=n;j++)
			if((k=a[j]-a[i])<minx)//a[j]-a[i]表示从i到j能翻转后1的个数与翻转前1的个数的差的相反数
				minx=k;
	printf("%d\n",sum-minx);
	return 0;
}