Pagini recente » Cod sursa (job #2977053) | Cod sursa (job #2228634) | Cod sursa (job #2770247) | Cod sursa (job #2561883) | Cod sursa (job #1065836)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int a[400010];
int main()
{
ifstream fin("buline.in");
ofstream fout("buline.out");
int n,i,x,y,s=0,p,l=0,smax=INT_MIN,pmax=0,lmax;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x>>y;
if(y==0)
a[i]=a[i+n]=-x;
else
a[i]=a[i+n]=x;
}
p=1;
for(i=1;i<=2*n;i++)
{
s+=a[i];
l++;
if(s>smax)
{
if(l+p-1>n+p-1)
break;
smax=s;
pmax=p;
lmax=l;
}
if(s<=0)
{
/*if(i>n)
break;*/
p=i+1;
l=0;
s=0;
}
}
fout<<smax<<" "<<pmax<<" "<<lmax;
return 0;
}