LeetCode Weekly Contest 243
問題文
省略
省略
C++に変換後のコードはこちら
#define main dummy_main
{}
#undef main
ll dp[1001][1001];
class Solution {
public:
int minSkips(vector<int>& dist, int speed, int hoursBefore) {
int N = dist.size();
rep(i,N+1) rep(j,N+1) dp[i][j] = ll_inf;
dp[0][0] = 0;
rep(i,N) rep(j,N+1) if(dp[i][j] < ll_inf){
dp[i+1][j] <?= RoundUp(dp[i][j], speed) + dist[i];
dp[i+1][j+1] <?= dp[i][j] + dist[i];
}
rep(i,N+1) if(dp[N][i] <= (ll)speed * hoursBefore) return i;
return -1;
}
};
Current time: 2024年05月06日10時26分13秒
Last modified: 2021年06月07日19時37分36秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る
Logged in as: unknown user (not login)