Advertisement
berinkaq

Untitled

Apr 9th, 2021
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.80 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int f(int *a, int n, int k) {
  4. int l = 0, r = -1;
  5. int curr = 1;
  6. for (int i = 0; i < n; ++i) {
  7. if (a[i] == a[i + 1] && i != n - 1) {
  8. ++curr;
  9. continue;
  10. }
  11. if (curr > k) {
  12. for (int j = 0; j < curr; ++j)
  13. a[l++] = a[i];
  14. r = i;
  15. curr = 1;
  16. continue;
  17. }
  18. r = i;
  19. curr = 1;
  20. }
  21. //printf("%d %d\n", l, r);
  22. return r - l + 1;
  23. }
  24.  
  25. void print_arr(int *a, int n) {
  26. for (int i = 0; i < n; ++i)
  27. printf("%d ", a[i]);
  28. printf("\n");
  29. }
  30.  
  31. int main(void) {
  32. int n = 12;
  33. int k = 2;
  34. int a[] = {0,1,2,2,3,3,4,4,5,6,6,6};
  35. int ans = f(a, n, k);
  36. print_arr(a, n - ans);
  37. printf("%d\n", ans);
  38. return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement