Cod sursa(job #663979)
Utilizator | Endriu samsungmaster | Data | 19 ianuarie 2012 13:14:33 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
using namespace std;
int a[6000005],q=0,w=0, i, n, k, maxim_am_spus=0 ,pozisan=1, poz_je_insheput, poz_je_final;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]>q+a[i])
{
w=a[i];
pozisan=i;
}
else
w=q+a[i];
if(maxim_am_spus<w)
{
maxim_am_spus=w;
poz_je_insheput=pozisan;
poz_je_final=i;
}
q=w;
}
cout<<maxim_am_spus<<' '<<poz_je_insheput<<' '<<poz_je_final;
return 0;
}