DlPF_C的博客

Mr. Frog learned a basic data structure recently, which is called stack.There are some basic operations of stack：  ∙∙ PUSH x： put x on the top of the stack, x must be 0 or 1.  ∙∙ POP： throw the elemen...

原博地址：https://www.nowcoder.com/discuss/87249 题目描述  Given a sequence of integers a1, a2, ..., an and q pairs of integers (l1, r1), (l2, r2), ..., (lq, rq), find count(l1, r1), count(l2, r2), ..., coun...

Problem A. Ascending Rating Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 3701    Accepted Submission(s): 1225   Problem Description Be...

http://codeforces.com/contest/1009/problem/F 讲解：http://codeforces.com/blog/entry/44351 讲解中的问题是解决树上结点特性查询，而本题是查询相对于一个结点每一层根的个数。 #include<bits/stdc++.h> #define maxn 1000010 using namespace st...

题目地址：https://leetcode.com/problems/all-possible-full-binary-trees/description/ 对二叉树的递归构造。 对奇数枚举左右子树点的个数，偶数不符合条件直接返回 /** * Definition for a binary tree node. * struct TreeNode { * int val; ...

题目地址：https://leetcode.com/problems/maximum-frequency-stack/description/ 优先队列模拟栈 class FreqStack { public: struct Node { int x,y,p; bool operator < (const Node &N) con...