Pagini recente » Cod sursa (job #141782) | Cod sursa (job #1676101) | Cod sursa (job #3146815) | Cod sursa (job #1926443) | Cod sursa (job #2550020)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("buline.in");
ofstream fout("buline.out");
long long n,i,x,b,maxim,S,k, p, u;
long long V[500001], D[500001];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>x>>b;
if(b==0)
x=-x;
V[i]=V[i-1]+x;
V[i+n]=x;
}
for(i=n+1;i<=2*n;i++)
V[i]=V[i]+V[i-1];
p=1;
D[++u]=0;
for(i=1;i<=n*2;i++)
{
while(p<=u&&V[i]<V[D[u]])
u--;
D[++u]=i;
if (i-D[p]-1==n)
p++;
if (V[i]-V[D[p]]>maxim)
{
maxim=V[i]-V[D[p]];
S=D[p];
k=i-S;
}
}
fout<<maxim<<" "<<S+1<<" "<<k;
return 0;
}