Cod sursa(job #1635167)
Utilizator | Data | 6 martie 2016 15:12:33 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main(){
int sum=0,bestSum=-10000000,x,n,dr,st,bdr,bst;
in>>n;
for(int i=1;i<=n;i++){
in>>x;
if(sum>=0){
sum+=x;
dr++;
}
else{
sum=x;
st=i;
dr=i;
}
if(sum>bestSum){
bestSum=sum;
bst=st;
bdr=dr;
}
}
out<<bestSum<<" "<<bst<<" "<<bdr;
return 0;
}