上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 20 下一页
摘要: Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3882 Accepted Submission(s): 2309 Pro 阅读全文
posted @ 2018-09-26 22:41 StarHai 阅读(250) 评论(0) 推荐(0) 编辑
摘要: Black And White Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 5859 Accepted Submission(s): 16 阅读全文
posted @ 2018-09-26 22:39 StarHai 阅读(205) 评论(0) 推荐(0) 编辑
摘要: A Curious Matt Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 3369 Accepted Submission(s): 18 阅读全文
posted @ 2018-09-26 22:35 StarHai 阅读(349) 评论(0) 推荐(0) 编辑
摘要: 一棵树上有n个节点,编号分别为1到n,每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作: I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节点的最大权值 III. QSUM u v: 询问从点u到点v的路径上的节点的权 阅读全文
posted @ 2018-09-26 00:11 StarHai 阅读(227) 评论(0) 推荐(0) 编辑
摘要: 树链剖分就是将树分割成多条链,然后利用数据结构(线段树、树状数组等)来维护这些链。 首先就是一些必须知道的概念: 重结点:子树结点数目最多的结点; 轻节点:父亲节点中除了重结点以外的结点; 重边:父亲结点和重结点连成的边; 轻边:父亲节点和轻节点连成的边; 重链:由多条重边连接而成的路径; 轻链:由 阅读全文
posted @ 2018-09-25 22:00 StarHai 阅读(340) 评论(0) 推荐(0) 编辑
摘要: Jessie and Justin want to participate in e-sports. E-sports contain many games, but they don't know which one to choose, so they use a way to make dec 阅读全文
posted @ 2018-09-16 10:08 StarHai 阅读(433) 评论(0) 推荐(0) 编辑
摘要: There are NN different kinds of transport ships on the port. The i^{th}ith kind of ship can carry the weight of V[i]V[i] and the number of the i^{th}i 阅读全文
posted @ 2018-09-15 19:56 StarHai 阅读(554) 评论(0) 推荐(0) 编辑
摘要: Problem Description I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.The nation looks like a co 阅读全文
posted @ 2018-09-15 19:49 StarHai 阅读(212) 评论(0) 推荐(0) 编辑
摘要: After eating food from Chernobyl, DRD got a super power: he could clone himself right now! He used this power for several times. He found out that thi 阅读全文
posted @ 2018-09-15 19:38 StarHai 阅读(209) 评论(0) 推荐(0) 编辑
摘要: God Water likes to eat meat, fish and chocolate very much, but unfortunately, the doctor tells him that some sequence of eating will make them poisono 阅读全文
posted @ 2018-09-15 19:28 StarHai 阅读(606) 评论(0) 推荐(0) 编辑
摘要: Bob is a sorcerer. He lives in a cuboid room which has a length of AA, a width of BB and a height of CC, so we represent it as AA * BB * CC. One day, 阅读全文
posted @ 2018-09-15 19:24 StarHai 阅读(436) 评论(0) 推荐(0) 编辑
摘要: Now you have a string consists of uppercase letters, two integers AA and BB. We call a substring wonderful substring when the times it appears in that 阅读全文
posted @ 2018-09-15 19:22 StarHai 阅读(719) 评论(0) 推荐(0) 编辑
摘要: There are NN children in kindergarten. Miss Li bought them NN candies. To make the process more interesting, Miss Li comes up with the rule: All the c 阅读全文
posted @ 2018-09-15 19:18 StarHai 阅读(381) 评论(0) 推荐(0) 编辑
摘要: A prince of the Science Continent was imprisoned in a castle because of his contempt for mathematics when he was young, and was entangled in some math 阅读全文
posted @ 2018-09-15 19:13 StarHai 阅读(611) 评论(0) 推荐(0) 编辑
摘要: Jessie has a magic mirror. Every morning she will ask the mirror: 'Mirror mirror tell me, who is the most beautiful girl in the world?' If the mirror 阅读全文
posted @ 2018-09-15 19:10 StarHai 阅读(501) 评论(0) 推荐(0) 编辑
摘要: Cable TV NETWORK The interconnection of the relays in a cable TV network is bi-directional. The network is connected if there is at least one intercon 阅读全文
posted @ 2018-09-14 23:09 StarHai 阅读(303) 评论(0) 推荐(0) 编辑
摘要: 最大权闭合子图 所谓闭合子图就是给定一个有向图,从中选择一些点组成一个点集V。对于V中任意一个点,其后续节点都仍然在V中。比如: 在这个图中有8个闭合子图:∅, {3}, {4}, {2,4}, {3,4}, {1,3,4}, {2,3,4}, {1,2,3,4} 最大权闭合子图即为:在一个图中权值 阅读全文
posted @ 2018-09-13 20:12 StarHai 阅读(3255) 评论(0) 推荐(1) 编辑
摘要: 周末,小Hi和小Ho所在的班级决定举行一些班级建设活动。 根据周内的调查结果,小Hi和小Ho一共列出了N项不同的活动(编号1..N),第i项活动能够产生a[i]的活跃值。 班级一共有M名学生(编号1..M),邀请编号为i的同学来参加班级建设活动需要消耗b[i]的活跃值。 每项活动都需要某些学生在场才 阅读全文
posted @ 2018-09-13 19:57 StarHai 阅读(302) 评论(0) 推荐(0) 编辑
摘要: Given a directed graph G, con- sider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Cre- ate a directe 阅读全文
posted @ 2018-09-12 09:43 StarHai 阅读(215) 评论(0) 推荐(0) 编辑
摘要: Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) orde 阅读全文
posted @ 2018-09-12 09:35 StarHai 阅读(208) 评论(0) 推荐(0) 编辑
摘要: 题目:http://acm.hdu.edu.cn/showproblem.php?pid=5934 There are NN bombs needing exploding. Each bomb has three attributes: exploding radius riri, positio 阅读全文
posted @ 2018-09-10 17:00 StarHai 阅读(295) 评论(0) 推荐(0) 编辑
摘要: 链接:https://codeforc.es/contest/1038 A题: 1 #include<bits/stdc++.h> 2 using namespace std; 3 typedef long long LL; 4 #define PI acos(-1.0) 5 typedef pai 阅读全文
posted @ 2018-09-09 21:30 StarHai 阅读(318) 评论(0) 推荐(0) 编辑
摘要: 给定有向图G=(V,E)。设P 是G 的一个简单路(顶点不相交)的集合。如果V 中每个顶点恰好在P 的一条路上,则称P是G 的一个路径覆盖。P 中路径可以从V 的任何一个顶点开始,长度也是任意的,特别地,可以为0。G 的最小路径覆盖是G 的所含路径条数最少的路径覆盖。设计一个有效算法求一个有向无环图 阅读全文
posted @ 2018-08-23 21:40 StarHai 阅读(384) 评论(0) 推荐(0) 编辑
摘要: 度度熊参与了喵哈哈村的商业大会,但是这次商业大会遇到了一个难题: 喵哈哈村以及周围的村庄可以看做是一共由n个片区,m条公路组成的地区。 由于生产能力的区别,第i个片区能够花费a[i]元生产1个商品,但是最多生产b[i]个。 同样的,由于每个片区的购买能力的区别,第i个片区也能够以c[i]的价格出售最 阅读全文
posted @ 2018-08-23 20:44 StarHai 阅读(218) 评论(0) 推荐(0) 编辑
摘要: Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids 阅读全文
posted @ 2018-08-23 20:41 StarHai 阅读(242) 评论(0) 推荐(0) 编辑
上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 20 下一页