PAT Advanced 1074

题意：

给你任意长度的链表，再给你一个长度K，需要你对这个链表每一个长度为K的都进行反转。

思路：

模拟题，然而依旧卡了我很久，第一次错的原因在于没有没看清英文，只做了一次反转，第二次是因为front那里没有添加上“+”号，所以卡了我好久。

贡献几组我自己出的数据（不要问为什么不凑够5位）

1 8 2
1 1 2
2 2 3
3 3 4
4 4 5
5 5 6
6 6 7
7 7 8
8 8 -1




1 7 3
1 1 2
2 2 3
3 3 -1
4 4 -1
5 5 6
6 6 7
7 7 -1


1 4 1
1 1 2
2 2 3
3 3 4
4 4 -1




1 7 4
1 1 2
2 2 3
3 3 4
4 4 5
5 5 6
6 6 7
7 7 -1


1 4 4
1 1 2
2 2 3
3 3 -1
4 4 -1


1 4 4
1 1 2
2 2 3
3 3 4
4 4 -1


1 4 2
1 1 2
2 2 3
3 3 4
4 4 -1


1 6 2
1 1 2
2 2 3
3 3 4
4 4 5
5 5 6
6 6 -1

code：

#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<cstdio>
using namespace std;
#define maxn 100100
int N, K;
int first;
int pos;
struct node
{
	int data;
	int next;
	int address;
};
node t[maxn];
node ans[maxn];
int num = 0;
int main()
{
	cin >> first >> N >> K;
	int address,data,next;
	for (int i = 0; i < N; i++)
	{
		scanf("%d%d%d",&address,&data,&next);
		t[address].data = data;
		t[address].next = next;
		t[address].address = address;
	}
	int temp = 0;
	int p = first;
	if (first + N + K == 0)
		return 0;
	int count = 0;
	while (p != -1)
	{
		count++;
		p = t[p].next;
	}
	p = first;
	int times = count / K;
	int tempk = K;
	while (times--)
	{
		while (temp < tempk)
		{
			ans[temp] = t[p];
			temp++;
			p = t[p].next;
		}
		if (times+1==count/K)
		{
			node last = ans[temp - 1];
			for (int i = temp - 1; i >= 1; i--)
			{
				if (i != 0)
				{
					ans[i].next = ans[i - 1].address;
				}
			}
			ans[0].next = last.next;
		}
		else
		{
			node last = ans[temp - 1];
			for (int i = temp - 1; i >= (temp - K+1); i--)
			{
				if (i != (temp - K))
				{
					ans[i].next = ans[i - 1].address;
				}
			}
			ans[temp - K].next = last.next;
			ans[temp - 2*K].next = last.address;
		}
		tempk += K;
	}
	int front = 0, gap = K;
	bool ff = true;
	while (gap <= temp)
	{
		ff = true;
		for (int i = gap - 1; i >= front; i--)
		{
			printf("%05d %d ", ans[i].address, ans[i].data);
			if (ans[i].next == -1)
			{
				printf("%d\n", ans[i].next);
				ff = false;
				break;
			}
			else
				printf("%05d\n", ans[i].next);
		}
		if (!ff)
			break;
		gap += K;
		front += K;
	}
	while (p != -1)
	{
		printf("%05d %d ", t[p].address, t[p].data);
		if (t[p].next == -1)
		{
			printf("%d\n", t[p].next);
			break;
		}
		else
			printf("%05d\n", t[p].next);
		p = t[p].next;
	}
	return 0;
}