Codeforces Round #809 DIV2 C問題 (1250pt)
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
REP(rd_int()){
int @N, @A[N], m = (N-1) / 2;
ll x[m+1] = {}, y[m+1] = {};
rep(i,m) x[i+1] = x[i] + max(0, max(A[2*i], A[2*i+2]) - A[2*i+1] + 1);
reverse(A,A+N);
rep(i,m) y[i+1] = y[i] + max(0, max(A[2*i], A[2*i+2]) - A[2*i+1] + 1);
wt(min[i,0,m+1](x[i]+y[m-i]));
}
Current time: 2024年05月06日05時02分00秒
Last modified: 2022年12月30日21時58分48秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF809 CF_DIV2_C
トップページに戻る
Logged in as: unknown user (not login)