Cod sursa(job #3166530)
Utilizator | Data | 8 noiembrie 2023 21:54:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int NMAX = 6e6+2;
int n,ans,sum,len,l,r,a[NMAX];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
signed main()
{
fin >> n;
for(int i = 1; i <= n; i++){
fin >> a[i];
if(sum+a[i] < 0){
sum = 0;
len = 0;
}else{
len++;
sum += a[i];
if(ans < sum){
ans = sum;
l = i-len+1;
r = i;
}
}
}
fout << ans << " " << l << " " << r;
return 0;
}