Cod sursa(job #1934310)
| Utilizator | Data | 21 martie 2017 13:01:43 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,i,a[1001],s[1001],Max=0,pi,pf;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
s[0]=0;
for(i=1;i<=n;i++)
{
s[i] = max(0, s[i-1]+a[i]);
if(s[i]==0)pi=i+1,pf=i-1;
else pf=i-1;
}
for(i=1;i<=n;i++)
if(s[i]>Max) Max=s[i];
cout<<Max<<" "<<pi<<" "<<pf;
return 0;
}
