A. Flipping Game
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
—本题的核心思维是首先记录原数组中1的个数 cnt,由于 n的范围足够小,因此可以遍历多个 [i,j]区间。在每个 [i,j]区间中记录下 cnt2其中0的个数(即为反转后1的个数),用 cnt1记录下 [i,j]区间中1的个数(即为反转后0的个数)。再在不同的区间中用sum记录不同区间中1的个数,表达式为 cnt+cnt2-cnt1。取其中的最大值即为本题答案。
题解如下:
#include<bits/stdc++.h>
using namespace std;
int a[1990];
int cnt=0;
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
if(a[i]==1)cnt++; //记录原数组1的个数
}
int sum=0;
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
int cnt1=0,cnt2=0;
for(int z=i;z<=j;z++){
if(a[z]==1){
cnt1++; //翻转后0的个数
}
else cnt2++; //翻转后1的个数
}
sum=max(sum,cnt+cnt2-cnt1); //不同区间中不断更新1个数的最大值
}
}
printf("%d",sum);
}