Cod sursa(job #572040)
#include <cstdio>
using namespace std;
const int M=400000;
int n, a[M], p, l, s, x, smax, lmin, pmin;
void citire()
{
scanf ("%d ",&n);
for (int i=0; i<n; ++i)
{
scanf ("%d %d ",&a[i],&x);
if (x==0)
a[i]*=(-1);
}
for (int i=n; i<2*n; ++i)
a[i]=a[i-n];
}
void parcurge()
{
s=a[0];
for (int i=1; i<2*n; ++i)
{
if (s+a[i]>=a[i])
{
s+=a[i];
++l;
if (l>n)
break;
}
else
{
s=a[i];
l=0;
p=i;
}
if (s>smax)
{
smax=s;
lmin=i-l+1;
}
}
}
int main()
{
freopen ("buline.in","r",stdin);
freopen ("buline.out","w",stdout);
citire();
parcurge();
printf ("%d %d %d\n",smax,p+1,lmin+1);
return 0;
}