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