# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553497 | Tien_Noob | K blocks (IZhO14_blocks) | C++17 | 1 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e5, K = 1e2;
int dp[N + 1][K + 1], a[N + 1], n, k;
stack<int> St;
void read()
{
cin >> n >> k;
for (int i = 1, j = 0; i <= n; ++ i)
{
cin >> a[i];
j = max(j, a[i]);
dp[i][1] = j;
}
}
void solve()
{
for (int j = 2; j <= k; ++ j)
{
while(!St.empty())
{
St.pop();
}
for (int i = j; i <= n; ++ i)
{
dp[i][j] = dp[i - 1][j - 1] + a[i];
while(!St.empty() && a[i] >= a[St.top()])
{
dp[i][j] = min(dp[i][j], dp[St.top()][j - 1] + a[i]);
St.pop();
}
if (!St.empty())
{
dp[i][j] = min(dp[i][j], a[St.top()] + dp[St.top()][j - 1]);
}
if (St.empty())
{
dp[i][j] = min(dp[i][j], dp[j - 1][j - 1] + a[i]);
}
if (St.empty() || dp[i][j - 1] < dp[St.top()][j - 1])
{
St.push(i);
}
}
}
cout << dp[n][k];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (fopen(TASK".INP", "r"))
{
freopen(TASK".INP", "r", stdin);
//freopen(TASK".OUT", "w", stdout);
}
int t = 1;
bool typetest = false;
if (typetest)
{
cin >> t;
}
for (int __ = 1; __ <= t; ++ __)
{
//cout << "Case " << __ << ": ";
read();
solve();
}
}
Compilation message (stderr)
# | 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... |