LeetCode Weekly Contest 173 4問目 - Minimum Difficulty of a Job Schedule [1335]

Source

LeetCode Weekly Contest 173
問題文

問題概要

省略

解法

省略

cLay（version 20200119-1）のコード

C++に変換後のコードはこちら

#define main dummy_main
{}
#undef main

int dp[301], nx[301];

class Solution {
public:
  int minDifficulty(vector<int>& A, int D) {
    int mx, N = A.size();

    if(D > N) return -1;

    dp[0] = 0;
    rep(i,1,N+1) dp[i] = int_inf;

    rep(D){
      rep(i,N+1){
        nx[i] = int_inf;
        mx = -1;
        rep(j,1,i+1){
          mx >?= A[i-j];
          nx[i] <?= dp[i-j] + mx;
        }
      }
      rep(i,N+1) dp[i] = nx[i];
    }
    return dp[N];
  }
};

Current time: 2024年04月19日01時28分00秒
Last modified: 2020年02月02日00時58分49秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る

Logged in as: unknown user (not login)