
STL
acm_cxq
这个作者很懒,什么都没留下…
展开
-
hdu 5101 Select(思路,容器,二分)
Select Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1587 Accepted Submission(s): 443 Problem Description One day, Dudu, the m原创 2016-07-10 19:45:20 · 339 阅读 · 0 评论 -
STL-pair
Pair类型概述 pair是一种模板类型,其中包含两个数据值,两个数据的类型可以不同,基本的定义如下: pair a; 表示a中有两个类型,第一个元素是int型的,第二个元素是string类型的,如果创建pair的时候没有对其进行初始化,则调用默认构造函数对其初始化。 pair a("James", "Joy"); 也可以像上面一样在定义的时候直接转载 2016-07-07 00:30:33 · 258 阅读 · 0 评论 -
hdu 5020 Revenge of Collinearity(STL,组合,思路)
Revenge of Collinearity Time Limit: 8000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 605 Accepted Submission(s): 204 Problem Description In g原创 2016-07-07 01:12:50 · 466 阅读 · 0 评论 -
poj 3320 Jessica's Reading Problem(尺取法,map,set)
Jessica's Reading Problem Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10071 Accepted: 3352 Description Jessica's a very lovely girl wooed by lots of原创 2016-07-07 17:14:21 · 710 阅读 · 0 评论 -
hdu 1027 Ignatius and the Princess II(STL全排列)
Ignatius and the Princess II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7117 Accepted Submission(s): 4228 Problem Description原创 2016-10-15 16:08:49 · 319 阅读 · 0 评论 -
City Horizon(SET)
链接:https://ac.nowcoder.com/acm/contest/945/F 来源:牛客网 题目描述 Farmer John has taken his cows on a trip to the city! As the sun sets, the cows gaze at the city horizon and observe the beautiful silhouet...原创 2019-06-23 11:19:39 · 265 阅读 · 0 评论