Cod sursa(job #1096531)
| Utilizator | Data | 2 februarie 2014 11:53:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 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]; s[i]=s[i-1]+a[i];}
smi=0;
ma=a[1];//for (i=1;i<=n;i++) cout<<s[i]<<" ";
for (i=2;i<=n;i++)
{if (s[i-1]<smi) {smi=s[i-1];poz=i;}
dif=s[i]-smi;
//cout<<dif<<" ";
if (dif>ma) {ma=dif;pozf=i;pozi=poz;}
cout<<smi<<" ";
}
fout<<ma<<" "<<pozi<<" "<<pozf;
return 0;
}
