Cod sursa(job #825006)
Utilizator | Data | 27 noiembrie 2012 11:39:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, pf, pi, s, smax, x, p, i;
int main(){
f>>n;
s=0;
p=1;
for(i=1;i<=n;i++){
f>>x;
if(s<0){
s=x,p=i;
}
else{
s+=x;
}
if(s>smax){
smax=s;
pi=p;
pf=i;
}
}
g<<smax<<" "<<pi<<" "<<pf<<'\n';
}