1074 Reversing Linked List (25 分)

Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must output 4→3→2→1→5→6.

Input Specification:
Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (≤10
​5
​​ ) which is the total number of nodes, and a positive K (≤N) which is the length of the sublist to be reversed. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.

Then N lines follow, each describes a node in the format:

Address Data Next
where Address is the position of the node, Data is an integer, and Next is the position of the next node.

Output Specification:
For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:
00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218
Sample Output:
00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1

// 链表 
// 可能不在起点
// every K elements on L 每k个一组 
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
struct node{
	int now_sta;//当前节点位置 
	int val;
	int next; //保存当前结点值和下一节点的位置 
}p[100000];
int fir,n,k;
vector<node> res; //保存答案信息 
vector<node> fres;
int main()
{
	scanf("%d %d %d",&fir,&n,&k);
	int now_s,v,nex;
	for(int i = 0;i<n;i++)
	{
		scanf("%d %d %d",&now_s,&v,&nex);
		p[now_s].now_sta = now_s;
		p[now_s].val = v;
		p[now_s].next =nex;	
	}
	
	while(fir!=-1)
	{
		res.push_back(p[fir]);
		fir=p[fir].next; //链表传递 
	} 
	// reverse 函数
	int cnt = res.size()/k;

	for(int i = 0; i < cnt; i++) { //只用反转前面的一些元素 
		reverse(res.begin() + i*k, res.begin()+i*k+k );
	} 
	for (int i = 0; i < res.size(); i++) {
		if(i != 0)
			printf("%05d\n", res[i].now_sta);

		printf("%05d %d ", res[i].now_sta, res[i].val);

		if(i == res.size() - 1) printf("-1\n");
	}
	return 0;
}