PAT乙级1025 反转链表 (25 分)（过于繁琐，待以后重写）

https://pintia.cn/problem-sets/994805260223102976/problems/994805296180871168

写的太啰嗦了 等以后重写

#include <iostream>
#include <vector>
using namespace std;

struct node{
	int s_add, zhi, next, before;
};

node no[100010], no2[100010];

int main(){
	int s, n, k, ss, tmp_k = 1;
	vector<node> v;
	cin >> s >> n >> k;
	for(int i = 0; i < n; i++){
		int t_add;
		cin >> t_add;
		cin >> no[t_add].zhi >> no[t_add].next;
		if(no[t_add].next != -1)	no[no[t_add].next].before = t_add;
		no[t_add].s_add = t_add;
	}
	int sub = 0;
	while(tmp_k <= n){
		v.push_back(no[s]);
		s = no[s].next;
		if(s == -1)
			break;
		tmp_k++;
	}
	n = tmp_k;
	int i = 0, cnt = 1;
	while(k*cnt < n){
		int j;
		for(j = cnt*k-1; j > (cnt-1)*k; j--){
			if(v[j-1].s_add != -1)
				printf("%05d %d %05d\n", v[j].s_add, v[j].zhi, v[j-1].s_add);
			else
				printf("%05d %d -1\n", v[j].s_add, v[j].zhi);
		}
		printf("%05d %d ", v[j].s_add, v[j].zhi);
		cnt++;
		if(cnt*k <= n){
			j = cnt*k-1;
			printf("%05d\n", v[j].s_add);
		}
		else{
			j = (cnt-1)*k;
			printf("%05d\n", v[j].s_add);
		}
	}
	if(k*cnt == n){
		int j = cnt*k-1;
		for(;j > (cnt-1)*k; j--){
			if(v[j-1].s_add != -1)
				printf("%05d %d %05d\n", v[j].s_add, v[j].zhi, v[j-1].s_add);
			else
				printf("%05d %d -1\n", v[j].s_add, v[j].zhi);
		}
		printf("%05d %d", v[j].s_add, v[j].zhi);
		if(v[n-1].next == -1)	printf(" %d", v[n-1].next);
		else	printf(" %05d\n", v[n-1].next);
	}
	else{
		int j;
		for(j = (cnt-1)*k; j < n-1; j++){
			if(v[j].next != -1)
				printf("%05d %d %05d\n", v[j].s_add, v[j].zhi, v[j].next);
			else
				printf("%05d %d -1\n", v[j].s_add, v[j].zhi);
		}
		printf("%05d %d", v[j].s_add, v[j].zhi);
		if(v[n-1].next == -1)	printf(" %d", v[n-1].next);
		else	printf(" %05d\n", v[n-1].next);
	}
	return 0;
}