제출 #470836

#제출 시각아이디문제언어결과실행 시간메모리
470836jalsolStove (JOI18_stove)C++17
20 / 100
1099 ms98372 KiB
// looking to shine brighter in this world... #define TASK "stove" #ifdef LOCAL #include "local.h" #else #include <bits/stdc++.h> #define debug(...) #define DB(...) #endif using namespace std; using ll = long long; using ld = long double; #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define For(i, l, r) for (int i = (l); i <= (r); ++i) #define Ford(i, r, l) for (int i = (r); i >= (l); --i) #define Rep(i, n) For (i, 0, (n) - 1) #define Repd(i, n) Ford (i, (n) - 1, 0) #define Fe(...) for (auto __VA_ARGS__) template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); } template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; } template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; } const bool __initialization = []() { cin.tie(nullptr)->sync_with_stdio(false); if (fopen(TASK".inp", "r")) { (void)(!freopen(TASK".inp", "r", stdin)); (void)(!freopen(TASK".out", "w", stdout)); } cout << setprecision(12) << fixed; return true; }(); constexpr ld eps = 1e-9; constexpr int inf = 1e9; constexpr ll linf = 1e18; // ================================================================================ constexpr int maxn = 5000 + 5; int n, k; int a[maxn]; int dp[maxn][maxn]; int go(int i, int j) { if (i > n) return 0; if (j >= k) return inf; int& ret = dp[i][j]; if (ret != -1) return ret; ret = inf; For (p, i + 1, n + 1) { chmin(ret, go(p, j + 1) + a[p - 1] + 1 - a[i]); } return ret; } signed main() { cin >> n >> k; For (i, 1, n) cin >> a[i]; memset(dp, -1, sizeof(dp)); cout << go(1, 0) << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...