1025 反转链表 (25分)
AC代码
#include <iostream>
#include <cstdio>
using namespace std;
struct node{
int cur, value, nxt;
}nodes[100010], ret[100010];
int main(){
int ori, n, k, x, pos = 0;
scanf("%d%d%d", &ori, &n, &k);
for (int i = 0; i < n; i++){
scanf("%d", &x);
nodes[x].cur = x;
scanf("%d%d", &nodes[x].value, &nodes[x].nxt);
}
while (true){
ret[pos++] = nodes[ori];
if (nodes[ori].nxt == -1) break;
ori = nodes[ori].nxt;
}
int i;
for (i = k-1; i < pos; i+=k){
for (int j = i; j >= i-k+2; j--)
printf("%05d %d %05d\n", ret[j].cur, ret[j].value, ret[j-1].cur);
if (pos%k == 0){
if (i == pos-1) printf("%05d %d -1", ret[i-k+1].cur, ret[i-k+1].value);
else printf("%05d %d %05d\n", ret[i-k+1].cur, ret[i-k+1].value, ret[i+k].cur);
}
else {
if (i+k < pos) printf("%05d %d %05d\n", ret[i-k+1].cur, ret[i-k+1].value, ret[i+k].cur);
else printf("%05d %d %05d\n", ret[i-k+1].cur, ret[i-k+1].value, ret[i+1].cur);
}
}
if (pos%k){
for (int j = i-k+1; j < pos-1; j++)
printf("%05d %d %05d\n", ret[j].cur, ret[j].value, ret[j+1].cur);
printf("%05d %d -1", ret[pos-1].cur, ret[pos-1].value);
}
return 0;
}