Cod sursa(job #2768014)
| Utilizator | Data | 8 august 2021 22:15:58 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, sum = 0, i, a, j, k, ii, best = -999, start;
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> a;
if(sum < 0)
sum = a, start = i;
else
sum += a;
if(sum > best)
{
best = sum;
ii = start;
j = i;
}
}
fout << best << ' ' << ii << ' ' << j;
return 0;
}