Cod sursa(job #1379822)
Utilizator | Data | 6 martie 2015 19:41:58 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <limits.h>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
const int NMAX = 6000001;
int a[NMAX], i, n, p, first, last, Smax=INT_MIN, minn;
int main()
{
cin>>n;
for(i=1;i<=n;++i)
cin>>a[i];
for(i=1;i<=n;++i)
{
a[i]+=a[i-1];
if(a[i]-minn>Smax) Smax=a[i]-minn, first=p+1, last=i;
if(a[i]<minn) minn=a[i], p=i;
}
cout<<Smax<<' '<<first<<' '<<last;
return 0;
}