codeforces 962 A. Equator

最新推荐文章于 2022-08-25 15:24:54 发布

Whowell

最新推荐文章于 2022-08-25 15:24:54 发布

阅读量176

点赞数

分类专栏：其他---------二分 codeforces

本文链接：https://blog.csdn.net/weixin_39792252/article/details/80086793

版权

codeforces 同时被 2 个专栏收录

36 篇文章 0 订阅

订阅专栏

其他---------二分

4 篇文章 0 订阅

订阅专栏

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

On the $i$ -th day Polycarp will necessarily solve $a_{i}$ 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 $n$ ( $1 \leq n \leq 200000$ ) — the number of days to prepare for the programming contests.

The second line contains a sequence $a_{1}, a_{2}, \dots, a_{n}$ ( $1 \leq a_{i} \leq 10000$ ), where $a_{i}$ equals to the number of problems, which Polycarp will solve on the $i$ -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 $4$ out of $7$ 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 $6$ out of $12$ scheduled problems on six days of the training.

找到前缀和刚好大于等于总和一半的那一天。。。。

二分查找，竟然也不会了。。。。。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;
const int maxn = 2e5+7;

ll a[maxn];


int main()
{
    int n;
    scanf("%d", &n);
    memset(a, 0, sizeof(a));
    for(int i = 1; i <= n; i++)
    {
        scanf("%lld", &a[i]);
        a[i] += a[i - 1];
    }
    int l = 1, r = n, mid;
    ll sum = (a[n]+1)/2;
    while(l <= r)
    {
         mid = (l+r)/2;
        if(a[mid] >= sum)
            r = mid - 1;
        else
            l = mid + 1;
    }
    printf("%d\n",l);
}