def solve(n,nums):
ans = 0
for i in range(n):
for j in range(i,n):
temp = 0
for k in range(n):
if k>=i and k<=j:
temp += 1-nums[k]
else:
temp += nums[k]
ans = max(ans,temp)
return ans
if __name__ == '__main__':
n = int(input())
nums = list(map(int,input().split()))
print(solve(n,nums))
#include <bits/stdc++.h>
using namespace std;
#define long long int ll
int main() {
// your code goes here
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
int ans=0;
vector<int>v(n+1,0),pre(n+1,0);
int cnt=0;
for(int i=n-1;i>=0;i--){
if(a[i]==1)cnt++;
v[i]=cnt;
}
for(int i=0;i<n;i++){
pre[i+1]=a[i]+pre[i];
cnt=0;
for(int j=i;j<n;j++){
if(a[j]==0)cnt++;
ans=max(ans,v[j+1]+cnt+pre[i]);
}
}
cout<<ans;
return 0;
}1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |