STL <set> - 随笔分类 - 半根毛线

The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple - F 贪心+二分

摘要：Heap Partition A sequence S = {s1, s2, ..., sn} is called heapable if there exists a binary tree T with n nodes such that every node is labelled with 阅读全文

posted @ 2017-04-24 00:30 半根毛线阅读(564) 评论(0) 推荐(0)

Codeforces Round #408 (Div. 2) A B C 模拟模拟 set

摘要：A. Buying A House time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A. Buying A House time 阅读全文

posted @ 2017-04-11 20:24 半根毛线阅读(257) 评论(0) 推荐(0)

Codeforces Round #207 (Div. 2)A B C E 水思路 set 恶心分类

摘要：A. Group of Students time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Group of Students 阅读全文

posted @ 2017-04-01 22:06 半根毛线阅读(510) 评论(0) 推荐(0)

Codeforces Round #284 (Div. 2)A B C 模拟数学

摘要：A. Watching a movie time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Watching a movie t 阅读全文

posted @ 2016-11-17 21:24 半根毛线阅读(474) 评论(0) 推荐(0)

2016年中国大学生程序设计竞赛（合肥）-重现赛1001 HDU 5961

摘要：传递 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 42 Accepted Submission(s): 16 Problem Descrip 阅读全文

posted @ 2016-11-05 18:23 半根毛线阅读(305) 评论(0) 推荐(0)

Codeforces Round #285 (Div. 2) A B C 模拟 stl 拓扑排序

摘要：A. Contest time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Misha and Vasya participated i 阅读全文

posted @ 2016-09-22 19:56 半根毛线阅读(410) 评论(0) 推荐(0)

Codeforces Round #366 (Div. 2) C 模拟queue

摘要：C. Thor time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Thor time limit per test 2 se 阅读全文

posted @ 2016-08-08 01:44 半根毛线阅读(439) 评论(0) 推荐(0)

tyvj 1049 最长不下降子序列 n^2/nlogn

摘要：P1049 最长不下降子序列时间: 1000ms / 空间: 131072KiB / Java类名: Main 描述求最长不下降子序列的长度输入格式第一行为n，表示n个数第二行n个数输出格式最长不下降子序列的长度测试样例1 输入 3 1 2 3 输出 3 备注 N小于5000for e 阅读全文

posted @ 2016-07-29 23:57 半根毛线阅读(404) 评论(0) 推荐(0)

cdoj 1259 线段树+bitset 区间更新/查询

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

posted @ 2016-07-27 23:54 半根毛线阅读(464) 评论(0) 推荐(0)

Codeforces Round #281 (Div. 2) A 模拟

摘要：A. Vasya and Football time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vasya has started 阅读全文

posted @ 2016-07-25 13:43 半根毛线阅读(198) 评论(0) 推荐(0)

Codeforces Round #304 (Div. 2) A B C 水

摘要：A. Soldier and Bananas time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Soldier and Ban 阅读全文

posted @ 2016-07-22 15:21 半根毛线阅读(287) 评论(0) 推荐(0)

Codeforces Round #315 (Div. 2) B 水题强行set

摘要：B. Inventory time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Companies always have a lot 阅读全文

posted @ 2016-07-20 21:12 半根毛线阅读(352) 评论(0) 推荐(0)

UVA 11991 vector

摘要：Though Rujia Liu usually sets hard problems for contests (for example, regional contests likeXi’an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contes 阅读全文

posted @ 2016-07-13 16:47 半根毛线阅读(165) 评论(0) 推荐(0)

Codeforces Round #356 (Div. 2) B

摘要：B. Bear and Finding Criminals time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. Bear an 阅读全文

posted @ 2016-06-09 23:47 半根毛线阅读(199) 评论(0) 推荐(0)

Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition) C （用map 超时）

摘要：C. Bear and Colors time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Bear Limak has n colo 阅读全文

posted @ 2016-05-08 02:16 半根毛线阅读(248) 评论(0) 推荐(0)

The 13th Zhejiang Provincial Collegiate Programming Contest - I

摘要：In a BG (dinner gathering) for ZJU ICPC team, the coaches wanted to count the number of people present at the BG. They did that by having the waitress 阅读全文

posted @ 2016-04-23 16:59 半根毛线阅读(371) 评论(0) 推荐(0)

UVA 11995 STL 使用

摘要：There is a bag-like data structure, supporting two operations: Throw an element x into the bag. Take out an element from the bag. Given a sequence of 阅读全文

posted @ 2016-04-20 20:52 半根毛线阅读(243) 评论(0) 推荐(0)

HDU 3183 贪心

摘要：A Magic Lamp Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3019 Accepted Submission(s): 1172 Pr 阅读全文

posted @ 2016-04-15 23:54 半根毛线阅读(211) 评论(0) 推荐(0)

Codeforces Round #345 (Div. 2) C （multiset+pair ）

摘要：C. Watchmen time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Watchmen are in a danger and 阅读全文

posted @ 2016-03-08 18:58 半根毛线阅读(245) 评论(0) 推荐(0)

Educational Codeforces Round 6 C

摘要：C. Pearls in a Row time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are n pearls in 阅读全文

posted @ 2016-01-27 21:23 半根毛线阅读(265) 评论(0) 推荐(0)

导航

随笔分类 - STL <set>