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