Cod sursa(job #2371906)
| Utilizator | Data | 6 martie 2019 20:08:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
int main(){
ifstream f("ssm.in");
ofstream g("ssm.out");
int n;
f>>n;
int sp=0,Min=0,Min_poz=0;
int Max=-INT_MAX,st_Max=-1,dr_Max=-1;
for(int i=1;i<=n;++i){
int x;
f>>x;
sp+=x;
if(sp-Min>Max){
Max=sp-Min;
st_Max=Min_poz+1;
dr_Max=i;
}
if(sp<Min){
Min=sp;
Min_poz=i;
}
}
g<<Max<<" "<<st_Max<<" "<<dr_Max<<"\n";
return 0;
}
