Advertisement
Guest User

Untitled

a guest
Sep 23rd, 2019
109
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.46 KB | None | 0 0
  1.  
  2. КодПротокол
  3. #include <bits/stdc++.h>
  4.  
  5. using namespace std;
  6. int a[2000];
  7. void tominus(int j, int k) {
  8. for (int i = j - k + 1; i <= j; ++i) {
  9. a[i] = -1;
  10. }
  11. }
  12. int main() {
  13. int n;
  14. cin >> n;
  15. for (int i = 0; i < n; ++i) {
  16. cin >> a[i];
  17. }
  18. int sum = 0;
  19. for (int i = 0; i < n; ++i) {
  20. int k = 0;
  21. for (int j = 0; j <= n - sum; ++j) {
  22. if (j != n - sum) {
  23. if (k == 0) {
  24. ++k;
  25. }else {
  26. if (a[j] == a[j - 1]) {
  27. ++k;
  28. }else {
  29. if (k <= 2) {
  30. k = 1;
  31. }else {
  32. sum += k;
  33. tominus(j - 1, k);
  34. k = 1;
  35. break;
  36. }
  37. }
  38. }
  39. }else {
  40. if (k > 2) {
  41. sum += k;
  42. tominus(j - 1, k);
  43. }
  44. }
  45. }
  46. int b[n];
  47. int g = 0;
  48. for (int j = 0; j < n; ++j) {
  49. if (a[j] != -1) {
  50. b[g] = a[j];
  51. a[g] = b[g];
  52. ++g;
  53. }
  54. }
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement