Cod sursa(job #2162431)
Utilizator | Data | 12 martie 2018 10:57:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N,v[6000001],idx,st,dr;
long long s,Max=-999999999999999999;
int main()
{
f>>N;
for(int i=1;i<=N;++i)f>>v[i];
for(int i=1;i<=N;++i){
if(s<0)s=v[i],idx=i;
else s+=v[i];
if(s>Max)Max=s,st=idx,dr=i;
}
g<<Max<<' '<<st<<' '<<dr;
return 0;
}