Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- КодПротокол
- #include <bits/stdc++.h>
- using namespace std;
- int a[2000];
- void tominus(int j, int k) {
- for (int i = j - k + 1; i <= j; ++i) {
- a[i] = -1;
- }
- }
- int main() {
- int n;
- cin >> n;
- for (int i = 0; i < n; ++i) {
- cin >> a[i];
- }
- int sum = 0;
- for (int i = 0; i < n; ++i) {
- int k = 0;
- for (int j = 0; j <= n - sum; ++j) {
- if (j != n - sum) {
- if (k == 0) {
- ++k;
- }else {
- if (a[j] == a[j - 1]) {
- ++k;
- }else {
- if (k <= 2) {
- k = 1;
- }else {
- sum += k;
- tominus(j - 1, k);
- k = 1;
- break;
- }
- }
- }
- }else {
- if (k > 2) {
- sum += k;
- tominus(j - 1, k);
- }
- }
- }
- int b[n];
- int g = 0;
- for (int j = 0; j < n; ++j) {
- if (a[j] != -1) {
- b[g] = a[j];
- a[g] = b[g];
- ++g;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement