Cod sursa(job #2613447)
Utilizator | Data | 9 mai 2020 19:32:16 | |
---|---|---|---|
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 v[6000005],s[6000005];
int main(){
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int i,n,pi,u,p;
long long max=-1000000000;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=n;i++){
if(s[i-1]>=0)
s[i]=s[i-1]+v[i];
else{
s[i]=v[i];
pi=i;
}
if(s[i]>max){
max=s[i];
p=pi;
u=i;
}
}
cout<<max<<" "<<p<<" "<<u;
return 0;
}