风骨散人 - 博客园

摘要： Bob is an avid fan of the video game "League of Leesins", and today he celebrates as the League of Leesins... 阅读全文

posted @ 2019-11-20 21:41 风骨散人阅读(83) 评论(0) 推荐(0) 编辑

摘要： Hanh lives in a shared apartment. There are nn people (including Hanh) living there, each has a private fr... 阅读全文

posted @ 2019-11-20 21:37 风骨散人阅读(123) 评论(0) 推荐(0) 编辑

摘要： Bob watches TV every day. He always sets the volume of his TV to bb. However, today he is angry to find ou... 阅读全文

posted @ 2019-11-20 21:32 风骨散人阅读(81) 评论(0) 推荐(0) 编辑

摘要： #include#include#include#includeusing namespace std;const int maxn=100+10;int n,m;vector G[maxn];//G[i]表示i... 阅读全文

posted @ 2019-11-20 15:32 风骨散人阅读(148) 评论(0) 推荐(0) 编辑

摘要：拓扑排序的实现条件，以及结合应用场景，我们都能得到拓扑排序适用于DAG图（Directed Acyclic Graph简称DAG）有向无环图，根据关系我们能得到一个线性序列，实现的方式是DFS，具体的实现原理，... 阅读全文

posted @ 2019-11-20 15:31 风骨散人阅读(195) 评论(0) 推荐(0) 编辑

摘要： Ujan has been lazy lately, but now has decided to bring his yard to good shape. First, he decided to paint... 阅读全文

posted @ 2019-11-19 20:28 风骨散人阅读(110) 评论(0) 推荐(0) 编辑

摘要：题目引入：给定N个整数，那任意顺序排列连成一个数，得到的最大的数是多少？分析：贪心，字典序排序，都不对大小比较也不对，今天我跟别人想了很久绞尽脑汁，各种模拟都失败了。最后才发现对于俩个数a=313，b=3133。... 阅读全文

posted @ 2019-11-19 15:29 风骨散人阅读(235) 评论(0) 推荐(0) 编辑

摘要： Language:Default Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissi... 阅读全文

posted @ 2019-11-18 22:22 风骨散人阅读(130) 评论(0) 推荐(0) 编辑

摘要： DescriptionThe galaxy war between the Empire Draco and the Commonwealth of Zibu broke out 3 years ago. Dra... 阅读全文

posted @ 2019-11-18 22:15 风骨散人阅读(131) 评论(0) 推荐(0) 编辑

摘要： Problem DescriptionAli has taken the Computer Organization and Architecture course this term. He learned t... 阅读全文

posted @ 2019-11-18 22:14 风骨散人阅读(126) 评论(0) 推荐(0) 编辑

CM_Lunatic