Cod sursa(job #2907101)
| Utilizator | Data | 28 mai 2022 18:51:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-32 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int main()
{
fstream fin("ssm.in", ios::in);
fstream fout("ssm.out", ios::out);
unsigned N, max_i, max_j, i, start;
int max_sum = -2147483648, sum = 0, S;
fin >> N;
start = 0;
for (i = 1; i <= N; ++i)
{
fin >> S;
if (sum < 0) sum = S, start = i;
else sum += S;
if (sum > max_sum)
{
max_sum = sum;
max_i = start;
max_j = i;
}
}
fout << max_sum << " " << max_i << " " << max_j;
fin.close(); fout.close();
return 0;
}