Hello CODEFORCES.
I have a problem in my code A of last Div.2 contest.
Help!
Code
Those who don't Help.
By the way CP is Getting harder and harder by the minute.
I propose to have div 4 contests every week.
See this Blog.
Hello CODEFORCES.
I have a problem in my code A of last Div.2 contest.
Help!
for _ in range(int(input())):
n=int (input())
l=list(map(int,input().split()))
x=sum(l)
if (x)==n:
print(n-4)
else:
for i in range(n):
if i!=n-1:
if l[i]==-1 and l[i+1]==-1:
x+=4
break
else:
if l[-1]==-1 and l[0]==-1:
x+=4
break
print(x)
Are these. 
By the way CP is Getting harder and harder by the minute.
I propose to have div 4 contests every week.
See this Blog.
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
| Name |
|---|



kid.
You had written one more condition. You were thinking l[0] as the next index of l[-1].