G - Alice, Bob and Chocolate

G - Alice, Bob and Chocolate

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Alice and Bob like games. And now they are ready to start a new game. They have placed n chocolate bars in a line. Alice starts to eat chocolate bars one by one from left to right, and Bob — from right to left. For each chocololate bar the time, needed for the player to consume it, is known (Alice and Bob eat them with equal speed). When the player consumes a chocolate bar, he immediately starts with another. It is not allowed to eat two chocolate bars at the same time, to leave the bar unfinished and to make pauses. If both players start to eat the same bar simultaneously, Bob leaves it to Alice as a true gentleman.

How many bars each of the players will consume?

Input

The first line contains one integer n (1 ≤ n ≤ 10⁵) — the amount of bars on the table. The second line contains a sequence t₁, t₂, ..., t_n(1 ≤ t_i ≤ 1000), where t_i is the time (in seconds) needed to consume the i-th bar (in the order from left to right).

Output

Print two numbers a and b, where a is the amount of bars consumed by Alice, and b is the amount of bars consumed by Bob.

Sample Input

Input

5
2 9 8 2 7

Output

2 3

#include<iostream>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <vector>
#include <bitset>
#include <cstdio>
#include <string>
#include <numeric>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
#define Exp 1e-8
#define inf 0x7fffffff
#define Read freopen("in.txt","r",stdin)
#define Write freopen("out.txt","w",stdout)
#define maxn 55
#define mod 1000000007

int main()
{
    int n,N;
    int j=1,k=1;
    int a[100050]= {0};
    long long sum1=0,sum2=0;
    cin>>n;
    N=n;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    if(n==1)
    {
        cout<<"1 0"<<endl;
        return 0;
    }
    sum1+=a[j];
    sum2+=a[N+1-k];
    n-=2;
    while(n>0)//模拟吃巧克力,一人一块,注意,还要有绅士风度~~
    {
        if(sum1>sum2)
        {
            k++;
            sum2+=a[N+1-k];
            n--;
        }
        else if(sum1==sum2)
        {
            if(n==1)
            {
                j++;
                n--;
                break;
            }
            j++;
            k++;
            sum1+=a[j];
            sum2+=a[N+1-k];
            n-=2;
        }
        else
        {
            j++;
            sum1+=a[j];
            n--;
        }
    }
    cout<<j<<" "<<k<<endl;
    return 0;
}