Cod sursa(job #1869765)
Utilizator | Data | 6 februarie 2017 09:58:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
int n;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int i,s,smax,dr,st,p,x;
cin>>n;
cin>>x;
s=smax=x;st=dr=1;p=1;
if(s<0){s=0;p=2;}
for(i=2;i<=n;i++)
{
cin>>x;
s+=x;
if(smax<s){smax=s;st=p;dr=i;}
if(s<0){s=0;p=i+1;}
}
cout<<smax<<"\n";
cout<<st<<" "<<dr;
return 0;
}