Cod sursa(job #702634)
Utilizator | Data | 2 martie 2012 01:35:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
using namespace std;
int poz,v[100],i,n,maxim=-500,minim=0,pozmin,pozmax;
int main(){
cin>>n;
v[0]=0;
for(i=1;i<=n;++i){
cin>>v[i];
v[i]+=v[i-1];
if(v[i]<minim){
minim=v[i];
poz=i;
}
if(v[i]-minim>maxim){
maxim=v[i]-minim;
pozmax=i;
pozmin=poz+1;
}
}
cout<<maxim<<" "<<pozmin<<" "<<pozmax;
return 0;
}