正解——开荒

#pragma GCC optimize(1,"Ofast","inline")
#pragma GCC optimize(2,"Ofast","inline")
#pragma GCC optimize(3,"Ofast","inline")
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
struct node{
	int val, money = 1;
	node *next = nullptr, *pre = nullptr;
};
vector <int> v;
int main(){
	int n;
	cin >> n;
	node *head, *r;
	head = new node;
	r = head;
	for(int i = 1; i <= n; i++){
		node *p = new node;
		p -> val = i, p -> pre = r;
		r -> next = p;
		r = p;
	}r -> next = head -> next, head -> next -> pre = r;
	node *p = head;
	n--;
	while(n--){
		p = p -> next;
		p -> money++;
		node *dnode = p -> next;
		v.push_back(dnode -> val);
		dnode -> next -> pre = dnode -> pre, dnode -> pre -> next = dnode -> next;
		delete(dnode);
	}p = p -> next;
	cout << p -> val << ' ' << p -> money << "0万 ";
	for(auto i : v) cout << i << ' '; 

	return 0;
}