codeforces 6C - Alice, Bob and Chocolate

从两端模拟向中间靠拢

#include <stdlib.h>

#include <string.h>

#include <stdio.h>

#include <ctype.h>

#include <math.h>

#include <stack>

#include <queue>

#include <map>

#include <set>

#include <vector>

#include <string>

#include <iostream>

#include <algorithm>

using namespace std;

#define ll long long

#define ls rt<<1

#define rs ls1

#define lson l,mid,ls

#define rson mid+1,r,rs

#define middle (l+r)>>1

#define eps (1e-9)

#define clr_all(x,c) memset(x,c,sizeof(x))

#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))

#define MOD 1000000007

#define inf 100000007

#define pi acos(-1.0)

#define M 100000+5

int r[M];

int main(){

int n,i,j,ca,cb;

while(~scanf("%d",&n)){

for(i=0;i<n;i++)scanf("%d",&r[i]);

i=0,j=n-1;ca=cb=0;

while(i<=j){

if(i==j&&ca==cb){

ca+=r[i++];

break;

}

if(ca<cb)ca+=r[i++];

else if(ca>cb)cb+=r[j--];

else ca+=r[i++],cb+=r[j--];

}

printf("%d %d\n",i,n-i);

}

return 0;

}