fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2026-03-08 09:29:56
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2026-03-08 10:38:37
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. // #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e9
  46. #define name "CHIADAY"
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = (int)1e5+10;
  54. int n,m,k,a[N];
  55.  
  56. namespace sub1 {
  57.  
  58. 	bool approved() {
  59. 		return !k;
  60. 	}
  61.  
  62. 	void solve(void)
  63. 	{
  64. 		mii mp;
  65. 		int ans = 0;
  66. 		FOR(i,1,n)
  67. 		{
  68. 			mp[a[i]]++;
  69. 			if (mp[a[i]] > m)
  70. 			{
  71. 				mp.clear();
  72. 				mp[a[i]]++;
  73. 				ans++;
  74. 			}
  75. 		}
  76. 		cout << ans+1;
  77. 	}
  78.  
  79. }
  80.  
  81. namespace sub2 {
  82.  
  83. 	const int M = (int)1e3+10, K = 21;
  84. 	int dp[M][K],del[M][M],cnt[N];
  85. 	//dp[i][d]: số đoạn nhỏ nhất để cover prefix a[1..i] với đã xóa d phần tử 
  86.  
  87. 	bool approved() {
  88. 		return n <= 1e3 and k <= 20;
  89. 	}
  90.  
  91. 	void solve(void)
  92. 	{
  93. 		vi comp;
  94. 		FOR(i,1,n) comp.pb(a[i]);
  95. 		sort(all(comp));
  96. 		comp.erase(unique(all(comp)),comp.end());
  97. 		int len = sz(comp);
  98. 		FOR(i,1,n) a[i] = lower_bound(all(comp),a[i])-comp.begin()+1;
  99. 		FOR(l,1,n)
  100. 		{
  101. 			FOR(i,1,len) cnt[i] = 0;
  102. 			int kept = 0;
  103. 			FOR(r,l,n)
  104. 			{
  105. 				cnt[a[r]]++;
  106. 				if (cnt[a[r]] <= m) kept++;
  107. 				int len = r-l+1;
  108. 				del[l][r] = len-kept;
  109. 			}
  110. 		}
  111. 		fill(dp,0x3f);
  112. 		int INF = dp[0][0];
  113. 		dp[0][0] = 0;
  114. 		FOR(i,0,n-1)
  115. 			FOR(d,0,k)
  116. 			{
  117. 				if (dp[i][d] == INF) continue;
  118. 				FOR(j,i+1,n)
  119. 				{
  120. 					int need = del[i+1][j];
  121. 					if (d+need > k) continue;
  122. 					minimize(dp[j][d+need],dp[i][d]+1);
  123. 				}
  124. 			}
  125. 		int ans = oo;
  126. 		FOR(d,0,k) minimize(ans,dp[n][d]);
  127. 		cout << ans;
  128. 	}
  129.  
  130. }
  131.  
  132. namespace sub4 {
  133.  
  134. 	const int K = 301;
  135. 	int pos[N][K],dp[N][K],cnt[N];
  136. 	/*
  137. 		pos[i][d]: vị trí p nhỏ nhất sao cho cost(p,i) <= d
  138. 		dp[i][j]: số đoạn con tối thiểu cho tiền tố i, dùng <= j thao tác xóa
  139. 	*/
  140.  
  141. 	void solve(void)
  142. 	{
  143. 		FOR(d,0,k)
  144. 		{
  145. 			int p = 1, cur = 0;
  146. 			FOR(i,1,n)
  147. 			{
  148. 				cnt[a[i]]++;
  149. 				if (cnt[a[i]] > m) cur++;
  150. 				while (cur > d)
  151. 				{
  152. 					if (cnt[a[p]] > m) cur--;
  153. 					cnt[a[p]]--;
  154. 					p++;
  155. 				}
  156. 				pos[i][d] = p;
  157. 			}
  158. 			FOR(i,p,n) cnt[a[i]]--;
  159. 		}
  160. 		FOR(i,1,n)
  161. 			FOR(j,0,k) dp[i][j] = oo;
  162. 		FOR(i,1,n)
  163. 		{
  164. 			FOR(rem,0,k)
  165. 				for (int j = rem, d = 0; j <= k; ++j, ++d)
  166. 				{
  167. 					int p = pos[i][d];
  168. 					if (p >= 1)
  169. 						minimize(dp[i][j],dp[p-1][rem]+1);
  170. 				}
  171. 			// xoa a[i]
  172. 			FOR(j,1,k) minimize(dp[i][j],dp[i-1][j-1]);
  173. 		}
  174. 		int ans = oo;
  175. 		FOR(d,0,k) minimize(ans,dp[n][d]);
  176. 		cout << ans;
  177. 	}
  178.  
  179. }
  180.  
  181. bool M2;
  182. signed main()
  183. {
  184.     fast;
  185.     if (fopen(name".inp","r"))
  186.     {
  187.     	freopen(name".inp","r",stdin);
  188.     	freopen(name".out","w",stdout);
  189.     }
  190.     cin >> n >> m >> k;
  191.     FOR(i,1,n) cin >> a[i];
  192.     if (sub1::approved()) return sub1::solve(), time(), memory(), 0;
  193.     if (sub2::approved()) return sub2::solve(), time(), memory(), 0;
  194.     sub4::solve();
  195.     time();
  196.     memory();
  197.     return 0;
  198. }
  199. // ██░ ██  █    ██  ███▄    █   ▄████
  200. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  201. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  202. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  203. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  204. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  205. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  206. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  207. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0s 5308KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1
stderr
copy 
-------------Time:4.748ms.
234.785 MB
https://ideone.com/lDvvxe
language:
C++14 (gcc 8.3)
created:
3 hours 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!