Pagini recente » Cod sursa (job #493303) | Cod sursa (job #1209415) | Cod sursa (job #2604557) | Cod sursa (job #3179866) | Cod sursa (job #2122983)
#include <iostream>
#include<fstream>
#include<climits>
using namespace std;
ifstream f ("buline.in");
ofstream g ("buline.out");
int i,n,v[200000],s ,poz,lgsecv,semn,maxim=INT_MIN,j,li,lf,p;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i]>>semn;
if(semn==0)
v[i]=v[i]*-1;
}
for(i=1;i<=n;i++)
{
s=v[i];
j=i;
li=i;
if(s>maxim)
maxim=s;
j++;
while(j!=i)
{
if(j>n)
j=0;
s+=v[j];
if(s>maxim)
maxim=s,p=li,lf=j;
j++;
}
s=0;
}
g<<maxim<<" "<<p<<" ";
if(lf>p)
g<<lf-p+1;
else
g<<n-p+lf+1;
return 0;
}