-
Notifications
You must be signed in to change notification settings - Fork 1
/
327A.cpp
74 lines (67 loc) · 830 Bytes
/
327A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include<iostream>
#include<algorithm>
int ans=1;
int a,b;
using namespace std;
int f(int i,int j,int n,int arr[],int brr[])
{
int z,flag1=1,flag2=1;
while(flag1 && j>=i)
{
if(arr[i]==0)
{
flag1=0;
}
else
i++;
}
while(flag2 && j>=i)
{
if(arr[j]==0)
{
flag2=0;
}
else
j--;
}
if(flag1==0 && flag2==0)
{
int x=j-i+1-brr[j]+brr[i];
int y=brr[i-1]+brr[n]-brr[j];
z=x+y;
return z;
}
return 0;
}
int main()
{
int i,j,n;
int arr[1000],brr[1000];
cin>>n;
brr[0]=0;
for(i=1;i<=n;i++)
{
cin>>arr[i];
brr[i]=brr[i-1]+arr[i];
}
a=1;
b=n;
while(a<=n)
{
b=n;
while(b>=a)
{int x=f(a,b,n,arr,brr);
//int y=f(a,b,n,arr,brr);
//x=max(x,y);
if(x>ans)
ans=x;
b--;
}
a++;
}
if(brr[n]==n)
cout<<n-1;
else
cout<<ans;
return 0;
}