This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n, l, r, k, a[107];
int main() 
{
    cin >> n >> l >> r >> k;
    for (int i = 1; i <= n; i++)
    {
      cin >> a[i];
    }
    int m = (r-l+1);
    int res=1e9;
    vector<vector<vector<int>>> dp(n+1, vector<vector<int>>(m+1, vector<int>(k+1, 1e9)));
    for (int i = 0; i <= n; i++)
    {
      for (int j = 0; j <= k; j++)
      {
        dp[i][0][j]=0;
      }
    }
    for (int i = 1; i <= n; i++)
    {
      for (int j = 1; j <= m; j++)
      {
        for (int p = 0; p <= k; p++)
        {
          dp[i][j][p]=dp[i-1][j][p];
          if(p-abs(i-(j+l-1)) >= 0)
          {
            dp[i][j][p]=min(dp[i][j][p], dp[i-1][j-1][p-abs(i-(j+l-1))] + a[i]);
          }
          if(j==m)
          {
            res=min(res, dp[i][m][p]);
          }
        }
      }
    }
    cout << res;
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |