Cod sursa(job #1096533)
Utilizator | Data | 2 februarie 2014 11:57:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
int a[6000010],s[6000010],smi,poz,pozi,pozf,i,n,ma,dif;
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin>>n;
for (i=1;i<=n;i++) {fin>>a[i]; a[i]+=a[i-1]; s[i]=a[i];}
smi=0;
ma=a[1];
for (i=2;i<=n;i++)
{if (a[i-1]<smi) {smi=a[i-1];poz=i;}
dif=a[i]-smi;
if (dif>ma) {ma=dif;pozf=i;pozi=poz;}
}
fout<<ma<<" "<<pozi<<" "<<pozf;
return 0;
}