Cod sursa(job #824497)
Utilizator | Data | 26 noiembrie 2012 18:07:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int v[6000001],sum,ok,p,u,n,ii, i;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main(){
f>>n;
ok=-6000001;
for(i=1;i<=n;i++) f>>v[i];
p=u=1;
for(i=1;i<=n;i++){
if(sum<0){
sum=v[i];
ii=i;
}
else sum+=v[i];
if(ok<sum){
ok=sum;
p=ii;
u=i;
}
}
g<<ok<<' '<<p<<' '<<u<<'\n';
return 0;
}