Cod sursa(job #866009)
| Utilizator | Data | 27 ianuarie 2013 14:01:30 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long a[6000005], x[6000005];
int main()
{
long n,sum=0,pi=1,pf=1;
fin>>n;
for (int i=1;i<=n;i++) {
fin>>a[i];
x[i]=a[i];
if (x[i]<a[i]+x[i-1])
x[i]=a[i]+x[i-1];
else
pi=i;
if (sum<x[i]) {
sum=x[i];
pf=i;
}
}
fout<<sum<<" ";
fout<<pi<<" "<<pf;
return 0;
}
