6.1：栈和队列；6.2：链表，看过跳过，不做记录。6.3：二叉树：6.3.1：小球下落679 - Dropping Balls具体解释不写了，反正书里有。//左边 k*2，右边 k*2+1#include #include int open[2id/2+1；偶数id->id/2#include #include int main(){int n, h, id, ans;while(scanf("%d", &n) != EOF){if(n == -1) break;for(int i = 0; i < n; i++){scanf("%d%d&q Read More
