Pagini recente » Cod sursa (job #1463048) | Cod sursa (job #1818864) | Cod sursa (job #713271) | Cod sursa (job #2487740) | Cod sursa (job #2390930)
#include <fstream>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <bitset>
#include <string>
#include <climits>
using namespace std;
ifstream fin("buline.in");
ofstream fout("buline.out");
int x[500005];
int main()
{
int n,a,sint,smax=INT_MIN,ps,pd,pint=1,s,smax1=INT_MIN,ps1,pd1;
fin>>n>>x[1]>>a;if(a==0)x[1]-=2*x[1];
sint=x[1];x[1+n]=x[1];s=x[1];
for(int i=2;i<=n;i++)
{fin>>x[i]>>a;if(a==0)x[i]-=2*x[i];s+=x[i];}
for (int i=2;i<=n;i++)
{
if(sint<0)
sint=x[i],pint=i;
else sint+=x[i];
if(smax<sint)
smax=sint,ps=pint,pd=i;
}
pd-=ps-1;
for(int i=1;i<=n;i++)
x[i]-=2*x[i];
sint=x[1];
for (int i=2;i<=n;i++)
{
if(sint<0)
sint=x[i],pint=i;
else sint+=x[i];
if(smax1<sint)
smax1=sint,ps1=pint,pd1=i;
}
fout<<max(smax,s+smax1);
if(s+smax1>smax)fout<<' '<<ps1+1<<' '<<n-(ps1-pd1+1);
return 0;
}