Cod sursa(job #2616261)
Utilizator | Data | 17 mai 2020 19:56:45 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
ios_base::sync_with_stdio(0);
fin.tie(NULL); fout.tie(NULL);
int n, i;
fin >> n; int v[n+1];
v[0] = 0;
for (i = 1; i <= n; ++i)
fin >> v[i];
int st, dr, S = -1, Smax = -20000000, start;
for (i = 1; i <= n; ++i)
{
if (S < 0)
S = 0, start = i;
S += v[i];
if (S > Smax)
Smax = S, st = start, dr = i;
}
fout << Smax << " " << st << " " << dr;
fin.close(); fout.close();
return 0;
}