摘要: The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral p... 阅读全文
posted @ 2018-08-14 18:46 Fly_White 阅读(144) 评论(1) 推荐(0) 编辑
摘要: CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are o... 阅读全文
posted @ 2018-08-14 14:03 Fly_White 阅读(173) 评论(0) 推荐(0) 编辑
摘要: E - Blue Jeans POJ - 3080 The Genographic Project is a research partnership between IBM and The National Geographic Society that is an... 阅读全文
posted @ 2018-08-14 13:50 Fly_White 阅读(172) 评论(0) 推荐(0) 编辑
摘要: Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 #include#include#include#include#include#... 阅读全文
posted @ 2018-08-14 13:44 Fly_White 阅读(117) 评论(0) 推荐(0) 编辑
摘要: Prefixes and Suffixes CodeForces - 432D You have a string s = s1s2...s|s|, where |s| is the length of string s, and si its i-th charac... 阅读全文
posted @ 2018-08-14 13:40 Fly_White 阅读(213) 评论(0) 推荐(0) 编辑
摘要: 本题的题目选择的是病毒侵袭持续中 HDU - 3065 const int size=5e4+5;const int SIGMA_SIZE=26;int trie[size][26],val[size];char s_save[1005][60],s_fin[2000... 阅读全文
posted @ 2018-08-14 13:21 Fly_White 阅读(277) 评论(0) 推荐(0) 编辑
摘要: KiKi's K-Number HDU - 2852 For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki ... 阅读全文
posted @ 2018-08-14 13:18 Fly_White 阅读(267) 评论(0) 推荐(0) 编辑
摘要: In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swap... 阅读全文
posted @ 2018-08-14 13:12 Fly_White 阅读(212) 评论(0) 推荐(0) 编辑
摘要: 树状数组模板://Cnt为数组的界//cnt[i]为编号或者数值上小于id的数量void Update(LL Id){ while(Id0) { ans+=cnt[Id]; Id-=lowbit(Id); } return ans;}离散化//arr为保存原数据的... 阅读全文
posted @ 2018-08-14 12:58 Fly_White 阅读(230) 评论(0) 推荐(0) 编辑
摘要: 二维平面上N个点之间共有C(n,2)条连线。求这C(n,2)条线中斜率小于0的线的数量。二维平面上的一个点,根据对应的X Y坐标可以表示为(X,Y)。例如:(2,3) (3,4) (1,5) (4,6),其中(1,5)同(2,3)(3,4)的连线斜率 #include... 阅读全文
posted @ 2018-08-14 12:48 Fly_White 阅读(170) 评论(0) 推荐(0) 编辑