Cod sursa(job #2853330)
| Utilizator | Data | 20 februarie 2022 10:38:13 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int sum[6000001] = {0};
int main()
{
int n, i, j, a, b, x, smin, smax;
in >> n;
for (i = 1; i <= n; i++)
{
in >> x;
sum[i] = sum[i-1] + x;
}
for (i = 2; i <= n; i++)
{
j = 2;
smin = sum[1];
while(j <= i)
{
if (sum[j-1] < smin)
{
smin = sum[j-1];
a = j;
}
j++;
}
smax = sum[i-1] - smin;
b = i-1;
}
out << smax << " " << a << " " << b;
return 0;
}
