Pagini recente » Istoria paginii runda/chei | Cod sursa (job #927022) | Cod sursa (job #2945915) | Cod sursa (job #1661405) | Cod sursa (job #60812)
Cod sursa(job #60812)
#include <cstdio>
#define MAX 200001
FILE *in = fopen("buline.in","r"), *out = fopen("buline.out","w");
int n;
int a[MAX];
int sum = 0;
void read()
{
fscanf(in, "%d", &n);
int b = 0;
for ( int i = 1; i <= n; ++i )
{
fscanf(in, "%d %d", &a[i], &b);
if ( b == 0 )
a[i] *= -1;
sum += a[i];
}
}
struct minim
{
int val, lng, inc;
};
int main()
{
read();
minim *b = new minim[MAX];
b[1].val = a[1];
b[1].lng = 1;
b[1].inc = 1;
minim sol;
sol = b[1];
for ( int i = 2; i <= n; ++i )
{
if ( b[i-1].val + a[i] < a[i] )
{
b[i].val = b[i-1].val + a[i];
b[i].lng = b[i-1].lng + 1;
b[i].inc = b[i-1].inc;
}
else
{
b[i].val = a[i];
b[i].lng = 1;
b[i].inc = i;
}
if ( b[i].val < sol.val )
sol = b[i];
}
//
// for ( int i = 1; i <= n; ++i )
// printf("%d ", a[i]);
//
// printf("\n%d", min);
fprintf(out, "%d %d %d\n", sum-sol.val, sol.inc+1, n-sol.lng);
return 0;
}