Cod sursa(job #2628245)
| Utilizator | Data | 15 iunie 2020 09:44:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, a[6000001], sum, maxsum, st, dr, inc, nrm, sst, ddr;
bool ok;
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
fin >> a[i];
maxsum = -2000000001; st = -1;
for (int i = 1; i <= n; i++) {
if (sum < 0) {
sum = 0; inc = i;
}
sum += a[i];
if (sum > maxsum) {
maxsum = sum; st = inc; dr = i;
}
}
fout << maxsum << ' ' << st << ' ' << dr;
return 0;
}
