摘要: rope的部分简单操作 友情提示:cena不支持rope 传送门 阅读全文
posted @ 2018-04-03 16:36 Z-Y-Y-S 阅读(371) 评论(0) 推荐(2) 编辑
摘要: 初始化: 字符串处理: substr操作: 注意substr没有迭代器作为参数的操作 insert操作: erase操作: 用来执行删除操作 删除操作有三种 指定pos和len,其中pos为为起始位置,pos以及后面len-1个字符串都删除 迭代器,删除迭代器指向的字符 迭代器范围,删除这一范围的字 阅读全文
posted @ 2017-11-07 16:05 Z-Y-Y-S 阅读(243) 评论(0) 推荐(1) 编辑
摘要: 感谢http://blog.csdn.net/ac_hexin/article/details/52042562 set 如果需要集合中的元素允许重复那么可以使用multiset 1.创建set集合对象 创建set对象时,需要指定元素的类型,这一点和其他容器一样。 2.元素的插入与中序遍历 采用in 阅读全文
posted @ 2017-10-31 21:41 Z-Y-Y-S 阅读(414) 评论(1) 推荐(3) 编辑
摘要: 感谢http://www.cnblogs.com/fnlingnzb-learner/p/5833051.html 的详细说明 这里进行整理删减 map的构造函数 这里要说下的就是,我们通常用如下方法构造一个map: 数据的插入 在构造map容器后,我们就可以往里面插入数据了。这里讲种最常用插入数据 阅读全文
posted @ 2017-10-31 21:15 Z-Y-Y-S 阅读(238) 评论(1) 推荐(0) 编辑
摘要: 总计:681道 [CmdOI2019]任务分配问题 [IOI2000]邮局 [POI2011]Lightning Conductor [NOI2009]诗人小G 题 复读 [JSOI2018]战争 [JSOI2015]最大公约数 [SCOI2016]萌萌哒 [HAOI2018]苹果树 [CTSC20 阅读全文
posted @ 2017-10-07 14:51 Z-Y-Y-S 阅读(821) 评论(5) 推荐(2) 编辑
摘要: 此题是在某个的oj上看到的,题目标题和数据都不记得了,只能说个大概(标题瞎编的) 题目大意 给出$n$个点,可以任意选择生成树和$[1,m]$的边权。由这些点连成一棵树,树中每一条边的权重介于$[1,m]$给出两点$a,b$问有多少种树满足$a,b$之间的路径的权值乘积为$m$ 数据范围 $n<=1 阅读全文
posted @ 2022-07-26 15:48 Z-Y-Y-S 阅读(56) 评论(0) 推荐(1) 编辑
摘要: Problem Statement Given is a positive integer N. Consider a sequence of integers A=(A1,…,AK) that satisfies the conditions below: ∑Ki=1Ai=N; each Ai i 阅读全文
posted @ 2021-08-12 23:41 Z-Y-Y-S 阅读(72) 评论(0) 推荐(0) 编辑
摘要: Problem Statement Given is a sequence pp of length N+MN+M, which is a permutation of (1,2…,N+M)(1,2…,N+M). The ii-th term of pp is pipi. You can do th 阅读全文
posted @ 2021-08-12 23:27 Z-Y-Y-S 阅读(90) 评论(0) 推荐(0) 编辑
摘要: Problem Statement Given is a grid with H rows and W columns. Let (i,j)denote the square at the i-th row from the top and j-th column from the left. In 阅读全文
posted @ 2021-08-12 23:13 Z-Y-Y-S 阅读(57) 评论(0) 推荐(0) 编辑
摘要: Problem Statement Takahashi has many balls, on which nothing is written, and one bag. Initially, the bag is empty. Takahashi will do Q operations, eac 阅读全文
posted @ 2021-08-12 22:47 Z-Y-Y-S 阅读(41) 评论(0) 推荐(0) 编辑
摘要: Problem Statement The Republic of AtCoder has N cities, called City 1, City 2, ……, City N. Initially, there was a bidirectional road between every pai 阅读全文
posted @ 2021-08-12 22:36 Z-Y-Y-S 阅读(42) 评论(0) 推荐(0) 编辑
摘要: Problem Statement There are N cities numbered 1 through N, and MM buses that go between these cities. The i-th bus (1≤i≤M) departs from City Ai at tim 阅读全文
posted @ 2021-08-12 22:11 Z-Y-Y-S 阅读(37) 评论(0) 推荐(0) 编辑
摘要: Problem Statement Given is a prime number \(P\). How many pairs of integers $(x,y)$satisfy the following conditions? \(0≤x≤P−1\) \(0≤y≤P−1\) There exi 阅读全文
posted @ 2021-08-12 21:46 Z-Y-Y-S 阅读(66) 评论(0) 推荐(0) 编辑
摘要: Problem Statement \(N\) people called Person \(1,2,…,N\) are standing in a circle. For each \(1≤i≤N−1\), Person \(i\)'s neighbor to the right is Perso 阅读全文
posted @ 2021-08-12 20:33 Z-Y-Y-S 阅读(78) 评论(0) 推荐(0) 编辑
摘要: Problem Statement Given are positive integers \(N, K\), and a sequence of K integers \((A_1,A_2,…,A_K)\). Takahashi and Aoki will play a game with sto 阅读全文
posted @ 2021-08-12 17:10 Z-Y-Y-S 阅读(149) 评论(0) 推荐(0) 编辑