# codeforce 962A Equator

A. Equator
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Polycarp has created his own training plan to prepare for the programming contests. He will train for nn days, all days are numbered from 11to nn, beginning from the first.

On the ii-th day Polycarp will necessarily solve aiai problems. One evening Polycarp plans to celebrate the equator. He will celebrate it on the first evening of such a day that from the beginning of the training and to this day inclusive he will solve half or more of all the problems.

Determine the index of day when Polycarp will celebrate the equator.

Input

The first line contains a single integer nn (1n2000001≤n≤200000) — the number of days to prepare for the programming contests.

The second line contains a sequence a1,a2,,ana1,a2,…,an (1ai100001≤ai≤10000), where aiai equals to the number of problems, which Polycarp will solve on the ii-th day.

Output

Print the index of the day when Polycarp will celebrate the equator.

Examples
input
Copy
4
1 3 2 1

output
Copy
2

input
Copy
6
2 2 2 2 2 2

output
Copy
3

Note

In the first example Polycarp will celebrate the equator on the evening of the second day, because up to this day (inclusive) he will solve 44out of 77 scheduled problems on four days of the training.

In the second example Polycarp will celebrate the equator on the evening of the third day, because up to this day (inclusive) he will solve 66out of 1212 scheduled problems on six days of the training.

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 2e5 + 5;
int a[MAXN];
LL sum[MAXN];
int main()
{
int n;
LL sum1 = 0;
cin>>n;
for(int i = 1; i <= n; i++)
{
scanf("%d",&a[i]);
sum[i] = sum[i-1] + a[i];
sum1 += a[i];
}
int u = -1;
if(sum1 & 1)
sum1++;
for(int i = 1; i <= n; i++)
if(sum[i] >= sum1 / 2)
{
u = i;
break;
}
printf("%d\n",u);
return 0;
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120