约瑟夫环问题

题目:Problem - 792B - Codeforces

大意:n个人围成一圈，每次leader点离他为a距离的人出局，出局人的下一个变为leader,然后输出出局顺序

题解:用数组模拟约瑟夫环

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
typedef long long ll;
//链表实现和数组实现
typedef struct node
{
	int data;
	struct node* next;
}Node;
void ysflb(int N, int M)
{
	Node* head = NULL, * p = NULL, * r = NULL;
	head = (Node*)malloc(sizeof(Node));
	if (NULL == head)
	{
		cout << "Memory Failed";
		return;
	}
	head->data = 1;//从1开始编号 创建一个 还需要N-1个节点
	head->next = NULL;
	p = head;
	for (int i = 2; i <= N; i++)
	{
		r = (Node*)malloc(sizeof(Node));//创建临时变量
		r->data = i;
		r->next = NULL;
		//插入节点
		p->next = r;
		p = r;
	}
	//创建循环链表
	p->next = head;
	p = head;//为后续方便，将p指向头节点
	while (p->next != p)//如果p的next=p 说明目前只有一个元素
	{
		for (int i = 1; i < M; i++)
		{
			r = p;//保留出局的前一个节点
			p = p->next;
		}
		cout << p->data << " ";
		r->next = p->next;
		p = p->next;//更新p重新计数
	}
	cout << p->data;
}
const int N = 111;;
ll pre[N], nnext[N];//用数组进行模拟
int main()
{
	//直接模拟约瑟夫环
	ll n, m, last, Next;
	ll num, first;
	scanf("%lld%lld", &n, &m);
	//用数组建环
	pre[1] = n;
	nnext[1] = 2;	
	pre[n] = n - 1;
	nnext[n] = 1;
	for (int i = 2; i <=n-1; i++)
	{
		pre[i] = i - 1;
		nnext[i] = i + 1;
	}
	first = 1;
	while (m--)
	{
		cin >> num;
		num %= n;
		while (num--)
		{
			first = nnext[first];//找到删除的那个点
		}
		last = pre[first];
		Next = nnext[first];
		//删除操作
		nnext[last] = Next;
		pre[Next] = last;
		printf("%lld ", first);
		first = nnext[first];
		n--;
	}

}