Cod sursa(job #1723562)
| Utilizator | Data | 30 iunie 2016 22:20:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, a[6000050];
int main()
{
int sum, bestSum, S, i, st, dr;
f >> n;
sum = bestSum = -4294967296;
for(i = 1; i <= n; i++)
{
f >> S;
if (sum < 0)
sum = S, st = i;
else
sum += S;
if (bestSum < sum)
bestSum = sum, dr = i;
}
f.close();
g << bestSum << " " << st << " " << dr << "\n";
g.close();
return 0;
}
