fork download
copy 
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define ll long long
  6. #define ull unsigned ll
  7. #define ld long double
  8. typedef vector<int> vi;
  9. typedef multiset<int> mi;
  10. typedef multiset<ll> mll;
  11. typedef vector<ll> vll;
  12. typedef vector<bool> vb;
  13. typedef vector<string> vs;
  14. typedef set<ll> sll;
  15. typedef vector<vector<int>> _2vi;
  16. typedef vector<vector<ll>> _2vll;
  17. #define all(v) ((v).begin()), ((v).end())
  18. #define sz(v) ((ll)((v).size()))
  19.  
  20. #define vinp(v, n)                \
  21.     for (ull i = 0; i < (n); i++) \
  22.     cin >> (v)[i]
  23. #define printv(v)      \
  24.     for (auto i : (v)) \
  25.     cout << i << " "
  26. #define fr0(i, n) for (ull(i) = 0; (i) < (n); (i)++)
  27. #define fr1(i, n) for (ull(i) = 1; (i) < (n); (i)++)
  28. #define fr(i, x, n) for (ull(i) = (x); (i) < (n); (i)++)
  29. #define _CRT_SECURE_NO_WARNING
  30. const ll MOD = 1000000007;
  31.  
  32. void Bustany() {
  33.     ios_base::sync_with_stdio(false);
  34.     cin.tie(NULL);
  35.     cout.tie(NULL);
  36. #ifndef ONLINE_JUDGE
  37.     freopen("./in.txt", "r", stdin), freopen("./out.txt", "w", stdout);
  38. #endif
  39. }
  40.  
  41. const ll N = 3e2 + 5;
  42. vector<sll> adj(N);
  43. //_2vll adj(N,vll(N));
  44. vb vis;
  45. ll dp[N][N];
  46. vll v;
  47. ll cost[N][N];
  48.  
  49. ll n, k;
  50.  
  51.  
  52. void solve() {
  53.     cin >> n >> k;
  54.     v.assign(n, {});
  55.     memset(dp, 0x3f, sizeof(dp));
  56.     memset(cost, 0, sizeof(cost));
  57.     vinp(v, n);
  58.     sort(all(v));
  59.  
  60.  
  61.     fr0(i, n) {
  62.         for (ll j = i; j < n; j++) {
  63.             ll mid = (i + j) / 2;
  64.             cost[i][j] = 0;
  65.             for (ll h = i; h <= j; h++) {
  66.                 cost[i][j] += abs(v[h] - v[mid]);
  67.             }
  68.         }
  69.     }
  70.  
  71.  
  72.     fr0(i, n) {
  73.         dp[1][i] = cost[0][i];
  74.     }
  75.  
  76.     for (ll s = 2; s <= n; s++) {
  77.         for (ll i = 0; i < n; i++) {
  78.             for (ll j = 1; j <= i; j++) {
  79.                 dp[s][i] = min(dp[s][i], dp[s - 1][j - 1] + cost[j][i]);
  80.             }
  81.         }
  82.     }
  83.  
  84.     ll answer = n;
  85.     for (ll s = 1; s <= n; s++) {
  86.         if (dp[s][n - 1] <= k) {
  87.             answer = s;
  88.             break;
  89.         }
  90.     }
  91.     cout << answer << "\n";
  92. }
  93.  
  94.  
  95. int main() {
  96.     Bustany();
  97.     ll t = 1;
  98.     cin >> t;
  99.     while (t--) {
  100.         solve();
  101.     }
  102. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/9X1ETo
language:
C++ (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!