Cod sursa(job #2489959)
Utilizator | Data | 9 noiembrie 2019 14:27:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
int n,v[6000001],sm=INT_MIN,start,stop,ind,sum;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
if(sum<0){
sum = v[i];
ind = i;
}
else sum+=v[i];
if(sum>sm){
sm = sum;
start = ind;
stop = i;
}
}
fout<<sm<<" "<<start<<" "<<stop;
}