Cod sursa(job #640026)
Utilizator | Data | 24 noiembrie 2011 17:01:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
#include<limits.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000001],s[6000001],n,smax=INT_MIN,st,end;
int main(){
int i,j;
in>>n;
for(i=1; i<=n; i++){
in>>v[i];
s[i]=s[i-1]+v[i];
}
for(i=1; i<=n; i++)
for(j=i; j<=n; j++){
int sij=s[j]-s[i-1];
if(sij>smax){
smax=sij;
st=i;
end=j;
}
}
out<<smax<<" "<<st<<" "<<end;
return 0;
}