Submission #671876

#TimeUsernameProblemLanguageResultExecution timeMemory
671876viwlesxqK blocks (IZhO14_blocks)C++17
0 / 100
82 ms82508 KiB
#include "bits/stdc++.h" #include "ext/pb_ds/assoc_container.hpp" #include "ext/pb_ds/tree_policy.hpp" using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef string str; #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front #define F first #define S second #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() #define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update> void freo(str x) {freopen((x + ".in").c_str(), "r", stdin);freopen((x + ".out").c_str(), "w", stdout);} const int MAXN = 1e5 + 1, MAXK = 1e2; const ll inf = 1e18 + 7; vector <vector <ll>> dp(MAXN, vector <ll> (MAXK, inf)); signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N, K; cin >> N >> K; int a[N + 1]; for (int i = 1; i <= N; i++) cin >> a[i]; int mx = a[1]; dp[1][0] = a[1]; for (int i = 2; i <= N; i++) { dp[i][0] = max(a[i], mx); mx = max(mx, a[i]); } int suff_max[N + 2]; suff_max[N + 1] = 0; for (int i = N; i >= 1; i--) suff_max[i] = max(suff_max[i + 1], a[i]); for (int i = 1; i <= N; i++) { for (int k = 1; k < K; k++) { dp[i][k] = min(dp[i - 1][k - 1] + suff_max[i], dp[i - 1][k]); } } cout << dp[N][K - 1]; }

Compilation message (stderr)

blocks.cpp: In function 'void freo(str)':
blocks.cpp:21:26: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 | void freo(str x) {freopen((x + ".in").c_str(), "r", stdin);freopen((x + ".out").c_str(), "w", stdout);}
      |                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:21:67: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 | void freo(str x) {freopen((x + ".in").c_str(), "r", stdin);freopen((x + ".out").c_str(), "w", stdout);}
      |                                                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...