fork download
copy 
  1. // iostream is too mainstream
  2. #include <cstdio>
  3. // bitch please
  4. #include <iostream>
  5. #include <algorithm>
  6. #include <cstdlib>
  7. #include <vector>
  8. #include <set>
  9. #include <map>
  10. #include <queue>
  11. #include <stack>
  12. #include <list>
  13. #include <cmath>
  14. #include <iomanip>
  15. #define dibs reserve
  16. #define OVER9000 1234567890
  17. #define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
  18. #define tisic 47
  19. #define soclose 1e-8
  20. #define chocolate win
  21. // so much chocolate
  22. #define patkan 9
  23. #define ff first
  24. #define ss second
  25. #define abs(x) ((x < 0)?-(x):x)
  26. #define uint unsigned int
  27. #define dbl long double
  28. using namespace std;
  29. // mylittledoge
  30.  
  31. int main() {
  32. 	cin.sync_with_stdio(0);
  33. 	cin.tie(0);
  34. 	int N,K;
  35. 	cin >> N >> K;
  36. 	vector<int> A(N);
  37. 	map<int,int> M;
  38. 	for(int i =0; i < N; i++) {
  39. 		cin >> A[i];
  40. 		M[A[i]] =0;}
  41. 	int n =0;
  42. 	ALL_THE(M,it) it->ss =n++;
  43. 	for(int i =0; i < N; i++) A[i] =M[A[i]]/K;
  44.  
  45. 	int ansT =0;
  46. 	vector<int> ans(N,1);
  47. 	for(int i =0; i < N; i++) {
  48. 		for(int j =0; j < i; j++) 
  49. 			if(A[j] <= A[i]) ans[i] =max(ans[i],ans[j]+1);
  50. 		ansT =max(ansT,ans[i]);}
  51.  
  52. 	cout << N-ansT << "\n";
  53. 	return 0;}
  54.  
  55. // look at my code
  56. // my code is amazing
Success #stdin #stdout 0s 3436KB
comments (?)
stdin
copy 
6 3
7 9 8 3 6 5
stdout
copy 
3
https://ideone.com/OSJS7N
COCI STUDENTSKO
language:
C++14 (gcc 8.3)
created:
9 years ago
visibility:
secret

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!