Cod sursa(job #2282164)
| Utilizator | Data | 13 noiembrie 2018 13:06:13 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000010],v[6000010],n,maxim=-1000000000,st,dr,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];
st=i;
dr=i;
}
else{
s[i]=s[i-1]+v[i];
dr=i;
}
if(s[i]>maxim){
maxim=s[i];
stm=st;
drm=dr;
}
}
fout<<maxim<<" "<<stm<<" "<<drm;
}
