Cod sursa(job #2393946)
Utilizator | Data | 1 aprilie 2019 11:09:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,s,mx=-1e9,sx,sy,k;
int32_t main() {
ifstream cin("ssm.in");
ofstream cout("ssm.out");
cin>>n;
for (int i=1; i<=n; ++i) {
int x; cin>>x;
if (s>0) {
s+=x;
++k;
} else {
s=x;
k=1;
}
if (s>mx) mx=s,sy=i,sx=i-k+1;
}
cout<<mx<<" "<<sx<<" "<<sy;
return 0;
}