Cod sursa(job #1287481)
| Utilizator | Data | 7 decembrie 2014 18:04:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include<fstream>
using namespace std;
const int Max = 6000006;
int x[Max];
int main()
{
long long n, sum, max, i, car=0, u = 0, sul;
ifstream f("ssm.in");
ofstream g("ssm.out");
f >> n;
for (i = 0; i < n; i++)
f >> x[i];
sum = x[0];
max = x[0];
for (i = 1; i < n; i++)
{
if (sum + x[i]>=max) {
max = sum + x[i]; u = i;
}
if (sum + x[i] >= x[i]) {
sum = x[i] + sum;
}
else {
car = i;
sum = x[i];
}
}
g << max << " " << car + 1 << " " << u + 1 << endl;
}