Submission #49824

#TimeUsernameProblemLanguageResultExecution timeMemory
49824mra2322001K blocks (IZhO14_blocks)C++14
0 / 100
40 ms36192 KiB
#include <bits/stdc++.h> #define f0(i, n) for(int i=(0); i<n; i++) #define f1(i, n) for(int i=(1); i<=n; i++) using namespace std; typedef long long ll; const int N = 100002; int n, a[N], k; ll f[N][102]; main(){ ios_base::sync_with_stdio(0); cin >> n >> k; stack <int> s; f1(i, n){ cin >> a[i]; while(s.size() && a[s.top()] <= a[i]) s.pop(); f1(j, k){ if(i >= j){ if(s.size()==0) f[i][j] = f[j - 1][j - 1] + a[i]; else{ if(s.top() >= j - 1) f[i][j] = f[s.top()][j - 1] + a[i]; else f[i][j] = f[j - 1][j - 1] + a[i]; } } } s.push(i); } ll res = f[n][k]; ll ma = a[n]; for(int j = n - 1; j >= k - 1; j--){ res = min(res, f[j][k - 1] + ma); ma = max(ma, ll(a[j])); } cout << res; }

Compilation message (stderr)

blocks.cpp:12:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...