Pagini recente » Cod sursa (job #225680) | Cod sursa (job #2402064) | Cod sursa (job #2086159) | Cod sursa (job #1702142) | Cod sursa (job #2122866)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int v[400005];
int main()
{
int n,i,c,j,cont=0,contmax=0,li=0;
long long sumint=0,sumax=INT_MIN;
ifstream x("buline.in");
ofstream y("buline.out");
x>>n;
for(i=1;i<=n;i++)
{
x>>v[i];
x>>c;
if(c==0)
{
v[i]=v[i]-2*v[i];
}
}
j=n+1;
for(i=1;i<n;i++)
{
v[j++]=v[i];
}
for(i=1;i<2*n;i++)
{
sumint=sumint+v[i];
cont++;
if(sumint<=0)
{
cont=1;
sumint=v[i];
}
else
if(sumint>sumax && cont<n)
{
sumax=sumint;
li=i-cont+1;
contmax=cont;
}
}
y<<sumax<<" "<<li<<" "<<contmax;
x.close();
y.close();
return 0;
}