Mai intai trebuie sa te autentifici.
Cod sursa(job #2567540)
| Utilizator | Data | 3 martie 2020 17:46:17 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout ("ssm.out");
int n, i, s, maxim, ans, ans_i, ans_j;
int v[6000000];
int main()
{
fin >> n;
maxim = -1000000000;
for(i = 1; i <= n; i++)
fin >> v[i];
s = -1;
for(i = 1; i <= n; i++)
{
if(s < 0)
{
s = 0;
ans = i;
}
s = s + v[i];
if(s >= maxim)
{
maxim = s;
ans_i = ans;
ans_j = i;
}
}
fout << maxim << " " << ans_i << " " << ans_j;
return 0;
}
