Cod sursa(job #678052)
Utilizator | hiticasabel hiticas_abel | Data | 10 februarie 2012 22:45:44 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g ("ssm.out");
int i,k=0;
long n,a[6000011];
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
long bessuma=INT_MIN,suma=0,inceput,sfarsit,poz,max;
for(i=1;i<=n;i++)
{ if(suma>=0)
suma+=a[i];
else
{
suma=a[i];
poz=i;
}
if(suma>max)
{ max=suma;
inceput=poz;
sfarsit=i;
}
}
g<<max<<" "<<inceput<<" "<<sfarsit;
f.close();
g.close();
return 0;
}