当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
7017：Cute Tree
题目描述
Given the pseudo-code of a function $Build-Tree(A,id,L,R)$:
where $A$ is given in input, $id$ is the number of node, $L$ ,$R$ is the left position and the right position of $A$
Require the number of nodes created by $Build-Tree(A,root,1,n)$.
where $A$ is given in input, $id$ is the number of node, $L$ ,$R$ is the left position and the right position of $A$
Require the number of nodes created by $Build-Tree(A,root,1,n)$.
输入解释
The first line contains an integer $T$ $(1\leq T\leq 5)$ representing the number of test cases.
For each test case, the first contain one integer $n(1 \le n \le 2*10^5)$.
The second line contain n integers $A_i$$(1 \le A_i \le 10^9)$.
For each test case, the first contain one integer $n(1 \le n \le 2*10^5)$.
The second line contain n integers $A_i$$(1 \le A_i \le 10^9)$.
输出解释
For each test output one line, the number of nodes created by $Build-Tree(A,root,1,n)$.
输入样例
样例1: 1 7 4 3 5 2 6 7 1 样例2: 2 4 2 2 5 3 10 21 10 5 89 12 3 42 13 55 76
输出样例
样例1: 11 样例2: 6 15
最后修改于 2021-10-23T19:11:04+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 2000/1000MS(Java/Others) | 262144/262144K(Java/Others) |
登陆或注册以提交代码