Cod sursa(job #2805792)
| Utilizator | Data | 21 noiembrie 2021 22:48:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
int n, v[6000001], incf, sf, maxi = -2147483648;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> v[i];
int s = 0;
int inc = 1;
for (int i = 1; i <= n; i++)
{
if (s < 0)
{
s = 0;
inc = i;
}
s += v[i];
if (s > maxi)
{
maxi = s;
incf = inc;
sf = i;
}
}
cout << maxi << " " << incf << " " << sf;
return 0;
}