Cod sursa(job #2285647)
| Utilizator | Data | 18 noiembrie 2018 20:49:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000015],v[6000015],n,maxim=-1000000000,stt,drt,stm,drm;
int main(){
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<=n;i++){
if(s[i-1]<0){
s[i]=v[i];
stt=i;
drt=i;
}
else{
s[i]=s[i-1]+v[i];
drt=i;
}
if(s[i]>maxim){
maxim=s[i];
stm=stt;
drm=drt;
}
}
fout<<maxim<<" "<<stm<<" "<<drm;
}
