Pagini recente » Cod sursa (job #1623207) | Cod sursa (job #1331343) | Cod sursa (job #356232) | Cod sursa (job #1184952) | Cod sursa (job #797964)
Cod sursa(job #797964)
#include <fstream>
using namespace std;
ifstream f("buline.in");
ofstream g("buline.out");
int k, n, a, i, ii, j, jj, minim, maxim, s1, s2, s, c, k1, k2;
int main(){
f>>n;
maxim=-10002;
minim=-maxim;
for(k=1; k<=n; k++)
{
f>>a>>c;
if(c==0)
a=-a;
s+=a;
if(s1+a>a)
{
s1+=a;
if(maxim<s1)
{
maxim=s1;
i=k1;
j=k;
}
}
else
{
s1=a;
k1=k;
if(maxim<s1)
{
maxim=s1;
i=k1;
j=k;
}
}
if(s2+a<a)
{
s2+=a;
if(minim>s2)
{
minim=s2;
ii=k2;
jj=k;
}
}
else
{
s2=a;
k2=k;
if(minim>s2)
{
minim=s2;
ii=k2;
jj=k;
}
}
}
if(maxim>s-minim)
g<<maxim<<' '<<i<<' '<<j-i+1;
else
if(jj==n)
g<<s-minim<<" 1 "<<n-jj+ii-1;
else
g<<s-minim<<' '<<jj+1<<' '<<n-jj+ii-1;
return 0;
}