nike0good |Oier&ACMer | 熟能生巧

Monkey KingTime Limit: 10 Seconds      Memory Limit: 32768 KB Once in a forest, there lived N aggressive monkeys. At the beginning, they each does things in its own way and none of them know

1367: [Baltic2004]sequenceTime Limit: 20 Sec  Memory Limit: 64 MBSubmit: 521  Solved: 159[Submit][Status]DescriptionInputOutput一个整数RSample Input794820141518

4003: [JLOI2015]城池攻占Time Limit: 10 Sec  Memory Limit: 128 MBSubmit: 490  Solved: 181[Submit][Status][Discuss]Description小铭铭最近获得了一副新的桌游，游戏中需要用 m 个骑士攻占 n 个城池。这 n 个城池用 1 到 n 的整数表示。除 1 号城池外，

模拟斜堆的操作，发现最后一个节点是从根往左一直走直到第一个没有右节点的节点（如果有左节点再向左走一步，那么倒推即可#include<bits/stdc++.h> using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define ForkD(i,k