Educational Codeforces Round 92 (Rated for Div. 2) B. Array Walk

链接：Problem - B - Codeforces

算法：贪心

思路：因为不能连续后退 所以我们后退一次就得再回去 z的数据范围最大为5 所以我们可以直接暴力 从1+1到1+k的每一个位置往前1~z次 找出最大的ans值 我们可以通过前缀和来记录走到当前位置的ans加上来回踱步的答案 注意判断越界和我往前n次之后能否走到那个位置

#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;using ll = long long;using PLL = pair<ll,ll>;
const ll MAX = 1e18;const ll MIN = -1e18;const ll INF=0x3f3f3f3f;
const ll Q = 3e5+9;const ll MOD = 1e9 + 7;
ll a[Q];
ll qzh[Q];
void solve(){
    ll n,k,z;cin>>n>>k>>z;
    for (ll i = 0; i <= n+2; i++)
    {
        qzh[i]=0;a[i]=0;
    }
    for (ll i = 1; i <= n; i++)
        cin>>a[i];
    for (ll i = 1; i <= n; i++)
        qzh[i]=qzh[i-1]+a[i];//前缀和
    ll ans=qzh[k+1];
    for (ll i = 2; i <= min(k+1,n); i++)//我往前走到哪
    {
        for (ll j = 1; j <= min(z,k-i+1); j++)//代表我往后走的次数
        {
            if(k+1-j-j>=0 and k+1-j-j>=i-1)//越界 and 我往后走j次之后剩余步数能否走到当前位置
            ans=max(ans,qzh[k+1-j-j]+(a[i]+a[i-1])*j);
        }
    }
    cout<<ans<<"\n";
    
    
}
int main(){
    ios;ll _=1;cin>>_;
    while (_--)solve();
    return 0;
}