Cod sursa(job #516096)
Utilizator | Stefu Teodor Petre TeddyBoss | Data | 23 decembrie 2010 10:58:57 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000001];
int main (){
int i,j,n,k,s,imax,jmax,max;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
max=a[1];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++){
s=0;
for(k=i;k<=j;k++)
s+=a[k];
if(s>max){
jmax=j;
imax=i;
max=s;
}
}
fout<<max<<" "<<imax<<" "<<jmax;
return 0;
}