Cod sursa(job #1218196)
Utilizator | Data | 9 august 2014 22:34:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
// DP
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,i,x,bestsum=-1<<31,sum=-1, beg, end, idx;
int main()
{
cin>>n;
for (i=1;i<=n;i++)
{
cin>>x;
if (sum<0)
sum=x, idx=i;
else sum+=x;
if (bestsum<sum) bestsum=sum, beg=idx, end=i;
}
cout<<bestsum<<" "<<beg<<" "<<end;
return 0;
}