Cod sursa(job #2434351)
Utilizator | Data | 1 iulie 2019 16:06:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[10000],n,suma_max=0,min_=0,min_i,start_i,end_i,i;
int main(){
fin>>n;
for(i=1;i<=n;++i)
{
fin>>v[i];
v[i]+=v[i-1];
if(suma_max<v[i]-min_)
{
suma_max=v[i]-min_;
start_i=min_i+1;
end_i=i;
}
if(min_>v[i])
{
min_=v[i];
min_i=i;
}
}
fout<<suma_max<<" "<<start_i<<" "<<end_i;
}