Cod sursa(job #3344183)
| Utilizator | Data | 1 martie 2026 16:26:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include<iostream>
using namespace std;
#define NMAX 6000006
int n,a[NMAX],st=-1,fn=-1,maxsum=0xffffffff;
signed main(){
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#endif // LOCAL
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
cin>>n;
int sum=0xffffffff,str=-1;
for(int i=1;i<=n;++i){
int x;
cin>>x;
if(sum<0){
sum=0;
str=i;
}
sum+=x;
if(sum>maxsum){
maxsum=sum;
fn=i;
st=str;
}
}
cout<<maxsum<<" "<<st<<" "<<fn;
return 0;
}
