老程序员111 - 博客园

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

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

摘要： Problem Description Snuke is making sugar water in a beaker. Initially, the beaker is empty. Snuke can perform the following fo... 阅读全文

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

摘要： Problem Description In Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidire... 阅读全文

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

摘要： Problem Description Snuke has N dogs and M monkeys. He wants them to line up in a row. As a Japanese saying goes, these dogs a... 阅读全文

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

摘要：【题目描述】小a有一个长度为n的排列。定义一段区间是"萌"的，当且仅当把区间中各个数排序后相邻元素的差为1现在他想知道包含数x,y的长度最小的"萌"区间的左右端点也就是说，我们需要找到长度最小的区间[l,r]，满足区间[l,r]是"萌"的，且同时包... 阅读全文

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

摘要：【题目描述】小a非常喜欢204这个数字，因为′a′+′k′=204。现在他有一个长度为n的序列，其中只含有2,0,4这三种数字设ai为序列中第i个数，你需要重新排列这个数列，使得最大 (公式的含义是：每个数与前一个数差的平方的和) 注意... 阅读全文

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

摘要： Problem Description AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0,... 阅读全文

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

摘要： Problem Description Scientists say a lot about the problems of global warming and cooling of the Earth. Indeed, such natural ph... 阅读全文

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

摘要： Problem Description Vasya is going to the Olympics in the city Ntown by train. The boy wants to read the textbook to prepare fo... 阅读全文

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

摘要： Problem Description One fine October day a mathematics teacher Vasily Petrov went to a class and saw there n pupils who sat at ... 阅读全文

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

bianchengmao