Cod sursa(job #2345746)
| Utilizator | Data | 16 februarie 2019 17:35:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long sta,sminim,a,n,i,dr,st,maxim=-LONG_MAX,v[6000005];
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>a;
v[i]=v[i-1]+a;
if(v[i]-sminim>maxim)
{
st=sta+1;
dr=i;
maxim=v[i]-sminim;
}
if(v[i]<sminim)
{
sminim=v[i];
sta=i;
}
}
out<<maxim<<" "<<st<<" "<<dr;
return 0;
}
