老程序员111 - 博客园

摘要： Problem Description Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is ai. He can perform the... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(39) 评论(0) 推荐(0)

摘要： Problem Description Takahashi has N balls. Initially, an integer Ai is written on the i-th ball. He would like to rewrite the ... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(24) 评论(0) 推荐(0)

摘要：【概述】在 STL 中，并没有将堆作为一种容器，其实现需要借助更低一层的容器组件作为其底层机制，比如：list、priority_queue 等，heap 的底层机制 vector 本身就是一个类模板，heap 基于 vector 便实现了对各种数据类型的操... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(78) 评论(0) 推荐(0)

摘要： Problem Description We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card ... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(61) 评论(0) 推荐(0)

摘要：【概述】二叉排序树的查找效率取决于二叉排序树的形态，而构造一棵形态均匀的二叉排序树与结点的插入次序有关，但结点的插入次序不是随人的意志决定的，这就要求我们找到一种动态平衡的方法，对于任意给定的关键码序列都能构造一科形态均匀、平衡的二叉排序树。平衡二叉树（B... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(195) 评论(0) 推荐(0)

摘要：【概述】二叉排序树（Binary Search Tree），又称二叉查找树，其本质是按一定的顺序进行构造的二叉树。其递归定义如下：若其左子树不空，则左子树上所有结点的值均小于根结点的值若其右子树不空，则右子树上所有结点的值均大于根节点的值其左右子树也是二... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(175) 评论(0) 推荐(0)

摘要： Problem Description Takahashi is now competing in a programming contest, but he received TLE in a problem where the answer is Y... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(22) 评论(0) 推荐(0)

摘要： Problem Description Find the smallest possible sum of the digits in the decimal notation of a positive multiple of K. Constrai... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(16) 评论(0) 推荐(0)

摘要： Problem Description The season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(24) 评论(0) 推荐(0)

摘要： Problem Description You are given a permutation p1,p2,…,pN consisting of 1,2,..,N. You can perform the following operation any ... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(30) 评论(0) 推荐(0)

bianchengmao