Pagini recente » Cod sursa (job #1763444) | Cod sursa (job #2189044) | Cod sursa (job #744099) | Cod sursa (job #531709) | Cod sursa (job #2132987)
#include <fstream>
using namespace std;
int s[200002],t[200002];
int main()
{
int n,i,j,q,w,ma,a,b;
ifstream in("buline.in");
ofstream out("buline.out");
in>>n;
for(i=1;i<=n;i++)
{
in>>a>>b;
if(b==0)
{
s[i]=-a;
}
else
{
s[i]=a;
}
s[i]+=s[i-1];
t[i]=max(t[i-1],s[i]);
}
ma=-9999999;
for(i=1;i<=n;i++)
{
if(t[i-1]+s[n]-s[i-1]>ma)
{
ma=t[i-1]+s[n]-s[i-1];
q=i;
}
}
out<<ma<<" "<<q<<" "<<w;
return 0;
}