Submission #100805

#TimeUsernameProblemLanguageResultExecution timeMemory
1008051KhanK blocks (IZhO14_blocks)C++14
53 / 100
46 ms1440 KiB
// In the name of GOD #include <bits/stdc++.h> using namespace std; #define BeGood ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); #define nl '\n' #define ff first #define ss second #define pb push_back #define mp make_pair #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() typedef long long ll; typedef double db; const int N = 1e5 + 101; const ll M = 1e13 + 7; int n, k; int a[N]; map<pair<int, int>, int> m; int u[111][111]; int lol[111][111]; long long man(int id, int al){ if(al < 0){ return M; } if(id > n){ if(al == 0){ return 0; } return M; } if(u[id][al]){ return lol[id][al]; } u[id][al] = 1; long long ans = M; int mx = 0; for(int i = id; i <= n; ++i){ mx = max(mx, a[i]); ans = min(ans, man(i + 1, al - 1) + mx); lol[id][al] = ans; } return ans; } int main(){ BeGood cin >> n >> k; for(int i = 1; i <= n; ++i){ cin >> a[i]; } cout << man(1, k); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...