Pagini recente » Cod sursa (job #111059) | Cod sursa (job #1739463) | Cod sursa (job #1639907) | Cod sursa (job #1167120) | Cod sursa (job #3169170)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("buline.in");
ofstream fout("buline.out");
int n,x,k;
int sm=INT_MIN,s,st=1,dr,stf,drf;
int v[200005];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>x>>k;
if(k==1)
v[i]=x;
else
v[i]=0-x;
}
int l=1;
int lm=0;
for(int i=1; i<=n; i++)
{
if(s+v[i]>=v[i])
s+=v[i], l++;
else
{
s=v[i];
st=i;
l=1;
}
if(s>sm)
{
sm=s;
stf=st;
drf=i;
lm=l;
}
}
int i=1;
while(s+v[i]>=v[i])
{
s+=v[i];
l++;
if(s>sm)
{
sm=s;
stf=st;
drf=i;
lm=l;
}
i++;
if(n<n-stf+i)
break;
}
fout<<sm<<" "<<stf<<" "<<lm;
}