Cod sursa(job #1540339)
Utilizator | Nicu B. NicuCJ | Data | 2 decembrie 2015 17:39:14 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int a[6000001],v[6000001],beg,endd,maxim=-999999999,inceput,sfarsit,i,n;
int main ()
{
ifstream f ("ssm.in");
ofstream g ("ssm.out");
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=n;i++)
{
if (v[i-1]<0)
{
v[i]=a[i];
inceput=i;
sfarsit=i;
}
else
{
v[i]=v[i-1]+a[i];
sfarsit=i;
}
if (v[i]>maxim)
{
maxim=v[i];
beg=inceput;
endd=sfarsit;
}
}
g<<maxim<<" "<<beg<<" "<<endd;
}