Cod sursa(job #3267864)
Utilizator | Data | 12 ianuarie 2025 18:13:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
using namespace std;
int s[6000001],smax=-int(2e9),beg=0,endx=0,minx=0,pozmin;
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)cin>>s[i];
for(int i=1;i<=n;i++){
s[i]+=s[i-1];
if(smax<s[i]-minx){
beg=pozmin+1;
endx=i;
smax=s[i]-minx;
}
if(s[i]<minx){
pozmin=i;
minx=s[i];
}
}
cout<<smax<<' '<<beg<<' '<<endx;
return 0;
}