Cod sursa(job #2534274)
Utilizator | Data | 30 ianuarie 2020 12:20:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k,S,l,maxim,st,dr;
int main ()
{
ifstream fin ("ssm.in");
ofstream fout("ssm.out");
fin>>n;
fin>>k;
S=k;
l=1;
maxim=S;
st=1;
dr=1;
for(int i=2;i<=n;i++)
{
fin>>k;
if(k+S>=k)
S=S+k;
else
{
S=k;
l=i;
}
if(S>maxim)
{
maxim=S;
st=l;
dr=i;
}
}
fout<<maxim<<" "<<st<<" "<<dr;
return 0;
}