Cod sursa(job #1397455)
Utilizator | Data | 23 martie 2015 15:47:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int n,x,i,best,RS=-1,l;
int beg, end;
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
cin>>n;
l=1;
for(i=1;i<=n;i++)
{
cin>>x;
if (best<0)
{
best=0;
l=i;
}
best+=x;
if (best>RS)
RS=best,beg=l,end=i;
}
cout<<RS<<' '<<beg<<' '<<end;
return 0;
}