Array implementation of circular linked list

#include <iostream>
using namespace std;

const int N = 100010;

int m;
int e[N], l[N], r[N], idx;

// initialization ,0 yes head,1 yes tail,idx from 2 Start  
void init()
{
    
	//0 Represents the left endpoint ,1 Represents the right endpoint 
	r[0] = 1;
	l[1] = 0;
	idx = 2;
}

// In the k The value inserted after nodes is x The node of  
void add(int k, int x)
{
    
	// Change four edges , So there are four pointer operations  
	e[idx] = x;
	l[idx]=k;
	r[idx]=r[k];
	l[r[k]]=idx;
	r[k]=idx;
}

// Delete the first k Nodes  
void remove(int k)
{
    
	l[r[k]] = l[k];
	r[l[k]] = r[k];
}