Cod sursa(job #1637539)
| Utilizator | Data | 7 martie 2016 17:57:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
//ifstream fin("ssm.in");
//ofstream fout("ssm.out");
int main()
{
int n,i,s,sum=0,bestSum=INT_MIN,idx,beg,end;
cin>>n;
for(i=1;i<=n;++i)
{
cin>>s;
if(sum<0)
{
sum=s;
idx=i;
}
else sum+=s;
if(bestSum<sum)
{
bestSum=sum; beg=idx; end=i;
}
}
cout<<bestSum<<" "<<beg<<" "<<end<<'\n';
return 0;
}
