Cod sursa(job #1256276)
Utilizator | Data | 6 noiembrie 2014 00:07:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
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 n,j,im,jm,maxim,i;
int v[6000003];
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
v[i]=v[i-1]+v[i];
}
for(i=1;i<n;i++){
for(j=i+1;j<=n;j++){
if(maxim<v[j]-v[i-1]){
maxim=v[j]-v[i-1];
im=i;
jm=j;
}
}
}
fout<<maxim<<" "<<im<<" "<<jm;
return 0;
}