fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5.  
  6. vector<int> A={0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3};
  7.  
  8. int n=A.size(),last=0,count=0;
  9. for(int i=0;i<n-2;i++)
  10. {
  11. cout<<last<<" "<<i<<" "<<A[last]<<" "<<A[i]<<endl;
  12. A[last]=A[i];
  13. if(A[i]==A[i+1] && A[i]==A[i+2])
  14. {
  15. count++;
  16. }
  17. else
  18. last++;
  19. }
  20. for(int i=0;i<count;i++)
  21. A.pop_back();
  22. // your code goes here
  23. return 0;
  24. }
Success #stdin #stdout 0s 4344KB
stdin
Standard input is empty
stdout
0     0   0   0
0     1   0   0
0     2   0   0
0     3   0   0
0     4   0   0
0     5   0   0
0     6   0   0
0     7   0   0
0     8   0   0
0     9   0   0
0     10   0   0
0     11   0   0
0     12   0   0
0     13   0   0
0     14   0   0
0     15   0   0
0     16   0   0
1     17   0   0
2     18   0   1
2     19   1   1
2     20   1   1
2     21   1   1
2     22   1   1
2     23   1   1
2     24   1   1
2     25   1   1
2     26   1   1
2     27   1   1
2     28   1   1
2     29   1   1
2     30   1   1
2     31   1   1
2     32   1   1
2     33   1   1
3     34   0   1
4     35   0   2
4     36   2   2
4     37   2   2
4     38   2   2
4     39   2   2
4     40   2   2
4     41   2   2
4     42   2   2
4     43   2   2
4     44   2   2
4     45   2   2
4     46   2   2
4     47   2   2
4     48   2   2
4     49   2   2
4     50   2   2
5     51   0   2
6     52   0   3
6     53   3   3
6     54   3   3
6     55   3   3
6     56   3   3
6     57   3   3
6     58   3   3
6     59   3   3
6     60   3   3
6     61   3   3
6     62   3   3
6     63   3   3
6     64   3   3
6     65   3   3
6     66   3   3
6     67   3   3