Cod sursa(job #1379545)
Utilizator | Data | 6 martie 2015 18:20:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long n,i,j,im,jm;
long v[6000001],maxim;
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=2;i<=n;i++){
v[i]=v[i]+v[i-1];
}
for(i=1;i<n;i++){
for(j=i+1;j<=n;j++)
if(maxim<v[j]-v[i]){
maxim=v[j]-v[i];
im=i+1;
jm=j;
}
}
fout<<maxim<<" "<<im<<" "<<jm;
return 0;
}