Pagini recente » Cod sursa (job #509725) | Cod sursa (job #2613175) | Cod sursa (job #1183062) | Cod sursa (job #2393118) | Cod sursa (job #2229719)
#include <fstream>
using namespace std;
ifstream fin ("buline.in");
ofstream fout ("buline.out");
int v[400005], d[400005], n, i, j, b, i1, l, cnt;
long long sum, m;
int main()
{
fin >> n;
for (i=1; i<=n; i++){
fin >> v[i] >> b;
if (b == 0)
v[i] = -v[i];
v[i+n] = v[i];
}
d[1] = v[1];
for (i=2; i<2*n; i++)
d[i] = d[i-1] + v[i];
for (i=1; i<2*n-1; i++){
for (j=i+1; j<2*n; j++){
sum = d[j] - d[i-1];
if (sum > m && j - i + 1 <= n){
m = sum;
i1 = i;
l = j - i + 1;
}
}
}
fout << m << " " << i1 << " " << l;
return 0;
}
//sume partiale