Pagini recente » Cod sursa (job #1089380) | Cod sursa (job #1243401) | Cod sursa (job #475697) | Cod sursa (job #1327454) | Cod sursa (job #2358709)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("buline.in");
ofstream out("buline.out");
int v[400005];
int main()
{
long long n,l=0,lmax=0,s=0,st=1,stm=0,smax=-10000;
in>>n;
for(int i=1; i<=n; i++)
{
int x,c;
in>>x>>c;
v[i]=v[n+i]=x;
if(c==0)
{
v[i]=-v[i];
v[n+i]=v[i];
}
if(v[i]>smax)
{
smax=v[i];
stm=i;
lmax=i;
}
}
for(int i=1; i<=2*n+1; i++)
{
if(s+v[i]>v[i] && l<n)
{
s+=v[i];
l++;
if(s>smax)
{
smax=s;
lmax=l;
stm=st;
}
}
else
{
st=i;
l=1;
s=v[i];
}
}
out<<smax<<" "<<stm<<" "<<lmax;
return 0;
}