Cod sursa(job #2756754)
| Utilizator | Data | 2 iunie 2021 19:45:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#define nmax 6000005
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n, beg, en, pozmin, smin;
long long v[nmax], s[nmax], suma;
int main()
{
in>>n;
for(int i=1; i<=n; i++)
{
in>>v[i];
s[i] = s[i-1] + v[i];
}
for(int i=1; i<=n; i++)
{
if(suma < s[i] - smin)
{
suma = s[i]- smin;
en = i;
beg = pozmin +1;
}
if(s[i]<smin)
{
smin = s[i];
pozmin = i;
}
}
out<<suma<<" "<<beg<<" "<<en;
return 0;
}
