Cod sursa(job #2035677)
Utilizator | Data | 9 octombrie 2017 19:08:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
long long n,s=0,c,i=1,j=1,posi,posj,mx=-60000000000;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>c;
s+=c;
if(s>mx)
{
mx=s;
posi=i;
posj=j;
}
if(s<0)
{
j=i+1;
s=0;
}
}
cout<<mx<<" "<<posj<<" "<<posi;
return 0;
}