Cod sursa(job #2113072)
Utilizator | Data | 24 ianuarie 2018 11:02:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000005],n;
int main()
{
int i,s,smax,st,dr,p;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
st=dr=p=1;
smax=s=a[i];
if(s<0) {s=0; p=2;}
for(i=2;i<=n;i++)
{
s+=a[i];
if(s>smax) {smax=s; st=p; dr=i;}
if(s<0) {s=0; p=i+1;}
}
fout<<smax<<" ";
fout<<st<<" "<<dr;
return 0;
}