Cod sursa(job #2369557)
| Utilizator | Data | 6 martie 2019 00:44:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n, x, s[6000001], Min, Max=-10000000000, poz, poz2, poz1;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin >> n;
for (int i=1;i<=n;i++) {
fin >> x;
s[i] = s[i-1]+x;
if (s[i]-Min>Max) Max = s[i]-Min, poz1 = poz+1, poz2 = i;
if (s[i]<Min) Min = s[i], poz = i;
}
fout << Max << " " << poz1 << " " << poz2;
return 0;
}
