Cod sursa(job #516103)
Utilizator | Data | 23 decembrie 2010 11:09:34 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#define NM 6000001
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,v[NM];
int main(){
int i,j,smax,sc,first=0,last=0;
in>>n;
for(i=1;i<=n;++i)
in>>v[i];
smax=INT_MIN;
for(i=1;i<=n;++i){
sc=0;
for(j=i;j<=n;++j){
sc+=v[j];
if(sc>smax){
smax=sc;
first=i;
last=j;
}
}
}
out<<smax<<" "<<first<<" "<<last;
return 0;
}