Cod sursa(job #1083171)
Utilizator | Data | 15 ianuarie 2014 18:13:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int BestSum=-2000000,sum = 0,beg,end,p,n,S;
f >>n;
for(int i=1;i<=n;++i){
f >>S;
if (sum<0){
sum=S;
p=i;
}
else{
sum+=S;
}
if (BestSum<sum){
BestSum=sum;
beg=p;
end=i;
}
}
g <<BestSum<<" "<<beg<<" "<<end;
return 0;
}