LeetCode Weekly Contest 368
問題文
省略
省略
C++に変換後のコードはこちら
#define main dummy_main
{}
#undef main
class Solution {
public:
int minimumSum(VI &A) {
int i, N = A.size();
static ll x[1d6], y[1d6];
ll res = ll_inf;
x[0] = A[0]; y[N-1] = A[N-1];
rep(i,1,N) x[i] = min(x[i-1], A[i]);
rrep(i,N-1) y[i] = min(y[i+1], A[i]);
rep(i,1,N-1) if(x[i-1] < A[i] && A[i] > y[i+1]) res <?= x[i-1] + A[i] + y[i+1];
return if[res==ll_inf, -1, res];
}
};
Current time: 2024年05月06日02時02分18秒
Last modified: 2023年11月03日19時49分11秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る
Logged in as: unknown user (not login)