DKChan-CSDN博客

转载 [转]树链剖分资料

bin神的专题：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28982#overview入门资料：http://blog.sina.com.cn/s/blog_7a1746820100wp67.html （这个blog的剖分是用的两个dfs的，红书上面有bfs形式的剖分，不过那个链的标号是倒序的，如果需要正序，要另外写个循环）https

2015-08-04 21:01:41 231

原创 ZOJ3886 2015July月赛 F-Nico Number(线段树)

Kousaka Honoka and Minami Kotori are playing a game about a secret of Yazawa Nico.When the game starts, Kousaka Honoka will give Minami Kotori an array A of N non-negative integers. There is a special

2015-08-02 16:33:18 462

转载 [转]SplayTree学习资料

bin神题集：http://www.cnblogs.com/kuangbin/category/418137.html同上：http://www.cnblogs.com/kuangbin/archive/2013/04/21/3034081.html资料：http://www.cnblogs.com/kuangbin/archive/2012/10/07/2714068.html杨思雨-算法合集之《

2015-08-02 16:20:34 321

原创 ZOJ3885 2015July月赛 E 费用流

The Exchange of ItemsBob lives in an ancient village, where transactions are done by one item exchange with another. Bob is very clever and he knows what items will become more valuable later on. So, B

2015-07-28 21:41:17 574

原创舞蹈链 - Sudoku

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=65998#problem/Fhttp://acm.hust.edu.cn/vjudge/contest/view.action?cid=65998#problem/Gbin神专题里的两个数独问题, 后面还有一个变形的数独(不是普通的九宫格十六宫格)这里一个是九宫格, 一个是十六宫格的数独…

2015-07-28 21:28:37 397

原创舞蹈链..Exact cover&Treasure Map等 . DLX-精确覆盖

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=65998#problem/ADescription There is an N*M matrix with only 0s and 1s, (1 <= N,M <= 1000). An exact cover is a selection of rows such that every c

2015-07-28 21:11:04 359

原创 Codeforces Round #313 (Div. 2)D

D. Equivalent StringsToday on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:They are e

2015-07-23 20:27:47 478

原创 Codeforces - Round.313.Div2.C

C. Gerald’s HexagonGerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to . Then he measured the length of its sides, and found that each

2015-07-23 20:19:05 345

原创 Tricks Device (最大流 , 最短路)

Tricks DeviceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1516 Accepted Submission(s): 364Problem Description Innocent Wu follows Dumb Z

2015-07-23 20:12:03 455

原创 hdu 4578 Transformation (线段树)

http://acm.hdu.edu.cn/showproblem.php?pid=4578TransformationTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 65535/65536 K (Java/Others) Total Submission(s): 3384 Accepted Submission(s): 81

2015-07-22 21:39:54 585

原创 CodeChef.July.5th - Addition and Multiplication

Addition and Multiplicationhttps://www.codechef.com/problems/ADDMUL You are given a one dimensional integer array A of length N. You need to maintain the array under Q queries of the following four ty

2015-07-22 21:28:28 464

原创学期结束..

这个学期的课程设计以及考试总算是结束了, 在此期间之内的题目,应该会在暑期集训的初期整理然后push上来.OS课设的最后一个题目没有去完成,果然还是因为我自己的惰性太强了嘛？为了下半年的regional,暑假的时候还是要多努力啊, 不能把队友给坑了.感觉三个人里面最蠢的就是自己了, 思维学识记忆等等都及不上队友.

2015-07-17 02:26:30 296

原创 Codeforces Round #305 (Div. 2).D

547B.Mike and Feetlink:http://codeforces.com/contest/548/problem/D维护一个单调递增的栈, 来记录每个数最大的范围是多少(这样的话要用到map来离散化,但是这样其实是没什么必要的,直接换成i大的范围最大的是多少,这样更快一点)这代码写的比较挫, 还请见谅.我其实是故意不写注释的…(逃#include <cmath>#include <

2015-06-13 16:11:45 269

原创 Codeforces Round #305 (Div. 2) E

548C.Mike and Foamlink:http://codeforces.com/contest/548/problem/E给了n个数,有q次询问,每一次询问会有指定一个i, 如果i之前没选过,就把ai放到一个地方里(就是题目中的shelf), 如果ai已经在里面,就把ai拿出来(重新变成没选过). 然后找这一次操作之后,有多少对数满足以下条件:i<j i< jgcd(ai,aj)=1

2015-06-13 16:00:32 337

原创我觉得我不会怎么经常更新.

看到队友之前写blog..就有点小冲动..但是弱渣都快退役滚粗的感觉了,不知道还能写多少.　　尽量在滚粗之前,给自己留多一点icpc的回忆吧…　　毕竟爱过..

2015-06-13 15:33:08 280

原创 Codeforces Round #306 (Div. 2) C.Divisibility by Eight

Codeforces Round #306 (Div. 2) C.Divisibility by Eight(http://codeforces.com/contest/550/problem/C)　　给定一个数字(最多100位),可以任意去掉其中的数(每一位数的相对关系不变), 使得剩下的数能够被8整除.最后至少要有一位数.不能满足的话就没有存在的答案.　　根据能被8整除的数的特征:只要最低的三位

2015-06-13 15:26:45 393

u013823561的博客