Cod sursa(job #2146705)
Utilizator | Data | 28 februarie 2018 10:06:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,a[6000000],n,s,smax,start,stop,index;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
smax=s=a[1];
if(s<0)s=0;
for(i=2;i<=n;i++)
{
s=s+a[i];
if(smax<s)
{
smax=s;
start=index;
stop=i;
}
if(s<0)
{
index=i+1;
s=0;
}
}
g<<smax<<" "<<start<<" "<<stop;
}