Pagini recente » Rating Mihaela Diaconu (MihaelaDiaconu) | Cod sursa (job #95825) | Cod sursa (job #1171853) | Profil imbunatatire | Cod sursa (job #1533744)
#include <fstream>
const int NMAX=20000;
using namespace std;
int sp[NMAX+1];
int b[NMAX+1];
int p[NMAX+1];
int a[NMAX+1];
int nr[NMAX+1];
ifstream cin("bloc.in");
ofstream cout("bloc.out");
int main()
{
int n,max2=0,i,pmin=0,maxx=0,minn,pmax,smax;
cin>>n;
b[0]=0;
minn=0;
for(i=1;i<=n;i++)
{
cin>>a[i]>>nr[i];
if(nr[i]==0)
nr[i]=a[i]*-1;
else
nr[i]=a[i];
sp[i]=sp[i-1]+nr[i];
}
for(i=n+1;i<2*n;i++)
{
sp[i]=sp[i-1]+nr[i-n];
}
for(i=1;i<2*n;i++)
{
b[i]=sp[i]-minn;
p[i]=pmin+1;
if(sp[i]<minn)
{
minn=sp[i];
pmin=i;
}
if(b[i]>=maxx)
{
if(b[i]>maxx)
max2=i;
maxx=b[i];
}
}
cout<<b[max2]<<" "<<p[max2]<<" "<<max2-p[max2]+1;
return 0;
}