Cod sursa(job #1921843)
Utilizator | Data | 10 martie 2017 14:55:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
int a[6000005];
int main()
{
int n,i,s,smax,st,dr,p;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
s=smax=a[1];
st=dr=1;p=1;
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;
}