Pagini recente » Cod sursa (job #1808818) | Cod sursa (job #1955974) | Cod sursa (job #1658337) | Cod sursa (job #325207) | Cod sursa (job #2551775)
#include <fstream>
using namespace std;
int n,i,y,L,st,solst,soldr,solL,sum,minim=500000,D[200010],v[200010];
int main () {
ifstream fin ("buline.in");
ofstream fout ("buline.out");
fin>>n;
for (i=1;i<=n;i++){
fin>>v[i]>>y;
if (!y){
v[i]=-v[i];
}
sum+=v[i];
}
D[1]=v[1];
st=1;
L=1;
i=2;
while (i<=n){
if (D[i-1]+v[i]<v[i]){
D[i]=D[i-1]+v[i];
L++;
}
else{
D[i]=v[i];
L=1;
st=i;
}
if (D[i]<minim){
minim=D[i];
solL=L;
solst=st;
soldr=i;
}
i++;
}
fout<<sum-minim<<" "<<soldr+1<<" "<<n-solL;
return 0;
}