Cod sursa(job #1267953)
Utilizator | Data | 20 noiembrie 2014 15:13:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int n,v[6000001],i,j,smax,poz1,poz2,s;
int main(){
ifstream in("ssm.in");
ofstream out("ssm.out");
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
for(i=1;i<=n;i++){
s=0;
for(j=i;j<=n;j++){
s+=v[j];
if(s>smax){
smax=s;
poz1=i;
poz2=j;
}
}
}
out<<smax<<" "<<poz1<<" "<<poz2;
in.close();
out.close();
return 0;
}