Pagini recente » Cod sursa (job #1686672) | Cod sursa (job #1226337) | Cod sursa (job #103393) | Cod sursa (job #2598238) | Cod sursa (job #2390853)
#include <fstream>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <bitset>
#include <string>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int x[400005];
int main()
{
int n,a,sint,smax=INT_MIN,ps,pd,pint=1;
fin>>n>>x[1]>>a;if(a==0)x[1]-=2*x[1];
sint=x[1];x[1+n]=x[1];
for(int i=2;i<=n;i++)
{fin>>x[i]>>a;if(a==0)x[i]-=2*x[i];x[i+n]=x[i];}
for (int i=2;i<2*n;i++)
{
if(sint<0)
sint=x[i],pint=i;
else sint+=x[i];
if(smax<sint)
smax=sint,ps=pint,pd=i;
}
fout<<smax<<' ';
pd-=ps-1;
if(ps>n)ps-=n;
fout<<ps<<' '<<pd;
return 0;
}