Cod sursa(job #1869754)
Utilizator | Data | 6 februarie 2017 09:50:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 45 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main()
{
int n,i,S,Smax,p,st,dr;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
st=dr=1;p=1;
for(i=1;i<=n;i++)
fin>>a[i];
S=Smax=a[1];
if(S<0){S=0;p=2;}
for(i=2;i<=n;i++)
{
S+=a[i];
if(Smax<S){Smax=S;st=p;dr=i;}
if(S<0){S=0;p=i+1;}
}
fout<<Smax<<" "<<st<<" "<<dr;;
return 0;
}