Cod sursa(job #2414967)
| Utilizator | Data | 25 aprilie 2019 13:06:14 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int N, v[6000000 + 5];
int smax = INT_MIN, st, dr;
int main()
{
fin >> N;
for(int i = 1; i <= N; i++)
fin >> v[i];
int s = 0, st2 = 1;
for(int i = 1; i <= N; i++)
{
s += v[i];
if(s < 0)
{
s = v[i];
st2 = i;
}
if(s > smax)
{
smax = s;
st = st2;
dr = i;
}
}
fout << smax << ' ' << st << ' ' << dr << '\n';
return 0;
}
