pat 乙级 1110 区块反转

测试点6：存在不属于链内的结点

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

struct node{
    int id, val, next;
};

int main(){
    int st, n, k, g, m, nn;
    cin >> st >> n >> k;
    node list[100000], data, tmp[n];
    for(int i = 0; i < n; i++){
        cin >> data.id >> data.val >> data.next;
        list[data.id] = data;
    }
    g = st; nn = 0;
    while(g != -1){
        tmp[nn++] = list[g];
        g = list[g].next;
    }
    g = nn / k;
    m = nn % k;
    for(int i = 0; i < g; i++) reverse(tmp+i*k, tmp+(i+1)*k);
    reverse(tmp+g*k, tmp+g*k+m);
    reverse(tmp, tmp+nn);
    for(int i = 0; i < nn-1; i++) printf("%05d %d %05d\n", tmp[i].id, tmp[i].val, tmp[i+1].id);
    printf("%05d %d -1", tmp[nn-1].id, tmp[nn-1].val);
    
    return 0;
}