Cod sursa(job #3241084)
| Utilizator | Data | 26 august 2024 12:26:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n, s = 0, maxim = -2147483648, start, end;
in >> n;
int *t = new int[n];
for (int i = 0; i < n; i++)
{
in >> t[i];
}
for (int i = 0; i < n; i++)
{
// in >> t[i];
for (int j = i; j < n; j++)
{
for (int k = i; k <= j; k++)
{
s += t[k];
if (s > maxim)
{
maxim = s;
start = i + 1;
end = k + 1;
}
}
s = 0;
}
}
out << maxim << " " << start << " " << end;
return 0;
}