Pagini recente » Cod sursa (job #2465782) | Cod sursa (job #1631933) | Cod sursa (job #908668) | Cod sursa (job #2453301) | Cod sursa (job #2390888)
#include <fstream>
#include <climits>
using namespace std;
ifstream f("buline.in");
ofstream g ("buline.out");
int v[500005];
int i,j, maxi=INT_MIN,n,k,y,z,suma,o,nr;
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>v[i];
v[i+n]=v[i];
f>>o;
if(o==0)
{ v[n+i]=v[i]-2*v[i];
v[i]=v[i]-2*v[i];
}
}
for(k=1; k<=n; k++)
{
for(i=k; i<n+k-1; i++)
{
if(suma<0)
suma=v[i], j=i;
else
suma=suma+v[i];
if(suma>maxi)
maxi=suma, z=j, nr=i;
}
}
nr-=z-1;
if(z>n)z=-n;
g<<maxi<<' '<<z<<' '<<nr;
return 0;
}