Submission #998756

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
998756	2024-06-14 16:13:01	vjudge1	Holding (COCI20_holding)	C++17	110 / 110	214 ms	8948 KiB

holding

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> A;
vector<vector<int>> dp;
int main() {
  int N, L, R, K;
  cin >> N >> L >> R >> K;
  A = vector<int>(N + 1);
  dp = vector<vector<int>>(102, vector<int>(10205, 1e9));
  for (int i = 1; i <= N; i++)
    cin >> A[i];
  dp[0][0] = 0;
  int ans = 1e9;
  for (int i = 1; i <= N; i++) {
    vector<vector<int>> ndp(102, vector<int>(10205, 1e9));
    for (int cnt = 0; cnt <= i; cnt++) {
      int cost = abs(L + cnt - i);
      for (int last = 0; last <= K; last++) {
        ndp[cnt][last] = min(ndp[cnt][last], dp[cnt][last]);
        ndp[cnt + 1][cost + last] = min(ndp[cnt + 1][cost + last], dp[cnt][last] + A[i]);
        if (cnt+1 == R - L + 1 && cost + last <= K)
          ans = min(ans, ndp[cnt + 1][cost + last]);
      }
    }
    dp = ndp;
  }
  cout << ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 22 / 22
• Subtask 2: 33 / 33
• Subtask 3: 33 / 33
• Subtask 4: 22 / 22