Cod sursa(job #625454)
| Utilizator | Data | 24 octombrie 2011 19:31:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000000],vctMax[6000000];
int main()
{
int sMax,i,n,s,d,x;
f>>n;
for (i=1; i<=n; i++)
f>>a[i];
sMax=a[1];
for (i=1; i<=n; i++)
{
vctMax[i]=a[i];
if (vctMax[i]<= vctMax[i-1]+ a[i])
vctMax[i]=vctMax[i-1] + a[i];
else
x=i;
if (sMax<vctMax[i])
{
sMax=vctMax[i];
d=i;
s=x;
}
}
g<<sMax<<" "<<s<<" "<<d;
f.close();
g.close();
return 0;
}
