数据结构 STL - 随笔分类 - meekyan

HDU 6040 Hints of sd0061 nth_element函数

摘要：Hints of sd0061 Problem Description sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no 阅读全文

posted @ 2017-08-05 09:51 meekyan 阅读(320) 评论(0) 推荐(0)

51NOD 1821 最优集合栈

摘要：1821 最优集合 1821 最优集合 1821 最优集合一个集合S的优美值定义为：最大的x，满足对于任意i∈[1,x]，都存在一个S的子集S'，使得S'中元素之和为i。给定n个集合，对于每一次询问，指定一个集合S1和一个集合S2，以及一个数k，要求选择一个S2的子集S3(|S3|<=k)，使得阅读全文

posted @ 2017-03-27 16:21 meekyan 阅读(162) 评论(0) 推荐(0)

Codeforces 755 F. PolandBall and Gifts 多重背包+贪心

摘要：F. PolandBall and Gifts It's Christmas time! PolandBall and his friends will be giving themselves gifts. There are n Balls overall. Each Ball has some 阅读全文

posted @ 2017-03-26 20:45 meekyan 阅读(419) 评论(0) 推荐(0)

2016年中国大学生程序设计竞赛（合肥）-重现赛（感谢安徽大学）(5/10)

摘要：1001: 传递要求 a->b->c && a->c 我的做法就是利用bitset预处理出x点可达点集，与可达到x点的点集那么如何检验这个图是否传递；枚举完b和，枚举可达b点集中的点x，那么点x可达点集要包含c点集，这个利用bieset可以快速判断整个做法就是(n^2) #include<cst 阅读全文

posted @ 2016-11-05 18:02 meekyan 阅读(543) 评论(0) 推荐(0)

codeforces 45C C. Dancing Lessons STL

摘要：C. Dancing Lessons There are n people taking dancing lessons. Every person is characterized by his/her dancing skill ai. At the beginning of the lesso 阅读全文

posted @ 2016-09-30 21:22 meekyan 阅读(316) 评论(0) 推荐(0)

Codeforces Round #227 (Div. 2) E. George and Cards set内二分+树状数组

摘要：E. George and Cards George is a cat, so he loves playing very much. Vitaly put n cards in a row in front of George. Each card has one integer written 阅读全文

posted @ 2016-09-29 16:28 meekyan 阅读(210) 评论(0) 推荐(0)

HDU 5876 Sparse Graph BFS 最短路

摘要：Sparse Graph Problem Description In graph theory, the complement of a graph G is a graph H on the same vertices such that two distinct vertices of H a 阅读全文

posted @ 2016-09-13 20:32 meekyan 阅读(329) 评论(0) 推荐(0)

Codeforces Round #349 (Div. 2) C. Reberland Linguistics DP+set

摘要：C. Reberland Linguistics First-rate specialists graduate from Berland State Institute of Peace and Friendship. You are one of the most talented studen 阅读全文

posted @ 2016-04-30 16:11 meekyan 阅读(420) 评论(0) 推荐(0)

HDU 5296 Annoying problem dfs序 lca set

摘要：题意：给出一棵树，每个边都有一个权值，现在有一个空的集合，两种操作， 1 x吧x节点放到集合中(如果还没放入) 2 x把x节点从集合中拿出来(已放入)。每次操作后输出最小的边权和，保证这些边可以将这些点连起来。题解：阅读全文

posted @ 2016-03-13 21:31 meekyan 阅读(250) 评论(0) 推荐(0)

Educational Codeforces Round 6 C. Pearls in a Row set

摘要：C. Pearls in a RowThere arenpearls in a row. Let's enumerate them with integers from1tonfrom the left to the right. The pearl numberihas the typeai.Le... 阅读全文

posted @ 2016-01-24 19:28 meekyan 阅读(207) 评论(0) 推荐(0)

BZOJ 3224: Tyvj 1728 普通平衡树 vector

摘要：3224: Tyvj 1728 普通平衡树Description您需要写一种数据结构（可参考题目标题），来维护一些数，其中需要提供以下操作：1. 插入x数2. 删除x数(若有多个相同的数，因只删除一个)3. 查询x数的排名(若有多个相同的数，因输出最小的排名)4. 查询排名为x的数5. 求x的前驱(... 阅读全文

posted @ 2015-12-21 16:40 meekyan 阅读(180) 评论(0) 推荐(0)

CDOJ 1259 昊昊爱运动 II 线段树+bitset

摘要：昊昊爱运动 II昊昊喜欢运动他N天内会参加M种运动(每种运动用一个[1,m]的整数表示)现在有Q个操作，操作描述如下昊昊把第l天到第r天的运动全部换成了x(x∈[1,m])问昊昊第l天到第r天参加了多少种不同的运动Input输入两个数N,M(1≤N≤105,1≤M≤100);输入N个数ai(ai∈[... 阅读全文

posted @ 2015-12-16 20:22 meekyan 阅读(272) 评论(1) 推荐(0)

HDU 5489 Difference of Clustering 图论

摘要：Difference of ClusteringProblem DescriptionGiven two clustering algorithms, the old and the new, you want to find the difference between their results... 阅读全文

posted @ 2015-10-25 15:25 meekyan 阅读(191) 评论(0) 推荐(0)

BestCoder Round #60.1003.GT and set/HDU5506 dfs

摘要：GT and setAccepts: 35Submissions: 194Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)问题描述有NN个集合，每个集合中有A_iAi个数。你要将这NN... 阅读全文

posted @ 2015-10-21 18:28 meekyan 阅读(343) 评论(0) 推荐(0)

Codeforces Round #324 (Div. 2)C. Marina and Vasya set

摘要：C. Marina and VasyaMarina loves strings of the same length and Vasya loves when there is a third string, different from the... 阅读全文

posted @ 2015-10-08 21:12 meekyan 阅读(196) 评论(0) 推荐(0)

HDU 5475An easy problem 离线set/线段树

摘要：An easy problemTime Limit: 8000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionOne day, a useless calculator was bei... 阅读全文

posted @ 2015-09-30 01:06 meekyan 阅读(234) 评论(0) 推荐(0)

Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] B. Finding Team Member 排序

摘要：B. Finding Team Member time limit per test ... 阅读全文

posted @ 2015-09-17 12:37 meekyan 阅读(232) 评论(0) 推荐(0)

BZOJ 1055 区间DP

摘要：1055: [HAOI2008]玩具取名Time Limit: 10 SecMemory Limit: 162 MBSubmit: 1144Solved: 668[Submit][Status][Discuss]Description某人有一套玩具，并想法给玩具命名。首先他选择WING四个字母中的任... 阅读全文

posted @ 2015-09-10 14:45 meekyan 阅读(270) 评论(0) 推荐(0)

Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) A. Bear and Elections 优先队列

摘要：A. Bear and Elections time limit per test1... 阅读全文

posted @ 2015-08-30 10:43 meekyan 阅读(271) 评论(0) 推荐(0)

K-集合（JXNU第二次周赛1006）set/平衡树

摘要：K-集合Time Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 1Font:Times New Roman... 阅读全文

posted @ 2015-08-14 21:03 meekyan 阅读(292) 评论(0) 推荐(0)

Meek

Time to sleep! again.

随笔分类 - 数据结构 STL

公告