Cod sursa(job #2154608)
Utilizator | Data | 7 martie 2018 09:33:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <climits>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[10000],n,i,s,smax,idx,start,stop;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
s=INT_MIN;
for(i=1;i<=n;i++)
{
s=s+a[i];
if(smax<s)
{
smax=s;
start=idx;
stop=i;
}
if(s<0)
{
s=0;
idx=i+1;
}
}
g<<smax<<" "<<start<<" "<<stop;
}