摘要:
03-树3 Tree Traversals Again (25分) An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that w 阅读全文
摘要:
Maximum Subsequence Sum 最大子序列和 在线处理法 稍加修改, 记录最大和的位置 1 #include<iostream> 2 using namespace std; 3 4 int K; 5 int d[100006]; 6 int main() 7 { 8 cin>>K; 阅读全文
摘要:
CREATE PROCEDURE prod(IN in_count INT) BEGIN DECLARE COUNT INT DEFAULT 0; WHILE COUNT < in_count DO insert demo select * from demo; SET COUNT = COUNT 阅读全文
摘要:
Kuchiguse (20) 时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小) 题目描述 The Japanese language is notorious for its sentence ending particle 阅读全文
摘要:
Consecutive Factors (20) 时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小) 题目描述 Among all the factors of a positive integer N, there may 阅读全文
摘要:
例题: Til the Cows Come Home https://vjudge.net/problem/POJ-2387 Bessie is out in the field and wants to get back to the barn to get as much sleep as po 阅读全文