Cleaning Tables- CLETAB

Problem Link

1. #include <iostream>
2. #include <cstring>
3. #include <algorithm>
4.  
5. using namespace std;
6.  
7. int main()
8. {
9. int t, n, m, res, victim;
10. int c[401];
11. int lastUse[401];
12. int seenBefore[401];
13. bool present[401];
14.  
15. cin >> t;
16. while(t--)
17. {
18. cin >> n >> m;
19. memset(present, false, sizeof present);
20. memset(seenBefore, 0, sizeof seenBefore);
21.  
22. for(int i = 0; i < m; i++)
23. {
24. cin >> c[i];
25. lastUse[c[i]] = i;
26. }
27.  
28. int order = 0;
29. res = 0;
30. while((res < n || present[c[order]]) && order < m)
31. {
32. if(!present[c[order]])
33. {
34. res++;
35. present[c[order]] = true;
36. }
37.  
38. order++;
39. }
40.  
41. while(order < m)
42. {
43. if(!present[c[order]])
44. {
45. victim = -1;
46.  
47. for(int i = order - 1; i >= 0; i--)
48. {
49. if(present[c[i]] && lastUse[c[i]] <= order)
50. {
51. victim = c[i];
52. break;
53. }
54. }
55.  
56. if(victim == -1)
57. {
58. for(int i = order + 1; i < m; i++)
59. {
60. if(present[c[i]] && seenBefore[c[i]] != order)
61. {
62. victim = c[i];
63. seenBefore[c[i]] = order;
64. }
65. }
66. }
67.  
68. present[victim] = false;
69. present[c[order]] = true;
70.  
71. res++;
72. }
73.  
74. order++;
75. }
76.  
77. cout << res << endl;
78.  
79. }
80. return 0;
81. }