Cod sursa(job #516126)
Utilizator | Data | 23 decembrie 2010 11:42:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<math.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000001],s[6000001];
int main(){
int i,j,imax,jmax,n,k,smaxj,smini,max;
fin>>n;
s[0]=0;
for(i=1;i<=n;i++){
fin>>a[i];
s[i]=s[i-1]+a[i];
}
smaxj=INT_MIN;
for(i=1;i<=n;i++){
if(s[i]>smaxj){jmax=i;
smaxj=s[i];
}
}
smini=INT_MAX;
for(i=0;i<jmax;i++){
if(s[i]<smini){
imax=i+1;
smini=s[i];
}
}
max=smaxj-smini;
fout<<max<<" "<<imax<<" "<<jmax;
return 0;
}