Cod sursa(job #361218)
Utilizator | Data | 4 noiembrie 2009 10:51:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[1<<23];
int main(){
int n,sc=0,smax=1<<32,i,k=1,j=1;
in>>n;
for(i=1;i<=n;i++){
in>>v[i];
}
smax=-smax;
for(i=1;i<=n;++i){
sc+=v[i];
if(sc>smax){
smax=sc;
j=i;
}
if(sc<0){
sc=0;
k=i+1;
}
}
out<<smax<<" "<<k<<" "<<j;
in.close();
out.close();
return 0;
}