Cod sursa(job #3003396)
| Utilizator | Data | 15 martie 2023 18:25:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int s, smax, st, fn;
int main()
{
int x, j;
fin >> n;
s = 0; smax = INT_MIN; j = 1;
for (int i = 1; i <= n; i++)
{
fin >> x;
s += x;
if (s > smax)
{
smax = s;
st = j; fn = i;
}
if (s < 0)
{
s = 0;
j = i + 1;
}
}
fout << smax << " " << st << " " << fn << "\n";
fin.close();
fout.close();
return 0;
}
