Cod sursa(job #2117681)
Utilizator | Data | 29 ianuarie 2018 09:43:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n,sum,x,start,stop,best,st;
int main()
{
f>>n;
sum=0;
best=-2000000000;
for(i=1;i<=n;i++)
{
f>>x;
if(sum<0)
sum=0,st=i;
sum+=x;
if(sum>best)
{
best=sum;
start=st;
stop=i;
}
}
g<<best<<" "<<start<<" "<<stop<<'\n';
return 0;
}