Pagini recente » Cod sursa (job #2588390) | Cod sursa (job #2443439) | Cod sursa (job #2911718) | Cod sursa (job #3152293) | Cod sursa (job #3275860)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("buline.in");
ofstream fout("buline.out");
int n, x, sol=-1, l1, r1, l2, r2, pl1, pl2;
long long v[400005];
long long sum1=0, sum2=0, total=0, maxi=0, mini=0;
deque<int> a;
int main()
{
fin >> n;
for(int i=1; i<=n; i++) {
fin >> v[i] >> x;
if(x==0) {
v[i]=v[i]*(-1);
}
total+=v[i];
}
for(int i=1; i<=n; i++) {
sum1+=v[i];
if(sum1<0) {
sum1=0;
pl1=i+1;
}
if(sum1>maxi) {
maxi=sum1;
r1=i;
l1=pl1;
}
sum2+=v[i];
if(sum2>0) {
sum2=0;
pl2=i+1;
}
//cout << sum2 << " " << mini << " "
if(sum2<mini) {
mini=sum2;
r2=i;
l2=pl2;
}
}
if(total-mini>maxi) {
fout << total-mini << " " << r2+1 << " " << n-(r2-l2+1);
} else {
fout << maxi << " " << l1 << " " << r1-l1+1;
}
return 0;
}