MADNESS

PrerequisitesGraph Theory Shortest PathToolsThis module discusses several algorithms that calculate various geometric properties, mostly based on only two operations described below: cross product and arctangent.Cross ProductThe cross product of.

Eulerian Tour Sample Problem: Riding The FencesFarmer John owns a large number of fences, which he must periodically check for integrity. Farmer John keeps track of his fences by maintaining a list of their intersection points, along...

1.1 让CPU占用率曲线听你指挥GetTickCount(), Sleep(), QueryPerformanceCounter()1.3 一摞烙饼的顺序Search with pruning.Paper by Bill Gates: "Bounds for Sorting by Prefix Reversal", 19791.4 买书问题，1.6 饮料供货Greedy, Dynamic programming1.7 光影切割问题逆序对1.8 电梯调度算法O(N):

user-based collaborative filteringitem-based collaborative filtering: The general technique is to precompute the most similar items for each item. Then, when you wish to make recommendations to a us

Previous related blog: http://blog.youkuaiyun.com/lllcfr/article/details/7567045先判断是否重叠，然后切割．注意答案要求的是哪一部分．１． 二维矩形 USACO 5-3-window#include #include #include #include #include #include #i

http://nriverwang.blogspot.hk/2013/04/k-th-smallest-element-of-two-sorted.htmlProblem Description:Given two sorted arrays A and B of size m and n, respectively. Find the k-th (1 smalle

http://nriverwang.blogspot.hk/This problem is from codeeval.com.Problem Description:You are to find the longest repeated substring in a given text. Repeated substrings may not overla

编程之美 Beauty of Programming[Essentials]3.1 String Rotation ==> Concatenation3.2 Loop Recursive3.3 Levenshtein distance (Edit distance), computing: DP ***3.4 Singly linked list3.5 How t

Google CodeJam China Campus Test 2014Practice Round Problem A: https://code.google.com/codejam/contest/2933486/dashboard#s=p0Solution:References:http://blog.163.com/kevinlee_2010/b

大赛得分及排名规则详见：http://programming2014.cstnet.cn/rules.html

AuthorTitlelbackstromThe Importance of AlgorithmsantimatterHow To Dissect a TopCoder Problem StatementDumitruHow to Find a Solutionleadhyena_inranPl

Problem: http://community.topcoder.com/stat?c=problem_statement&pm=2226Analysis:

Problems: https://code.google.com/codejam/contest/2974486/dashboard

强连通分量缩点Problem: http://poj.org/problem?id=2186Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22027 Accepted: 8993Descriptio

http://codinggeeks.blogspot.hk/2010/04/young-tableau.html

Book: http://book.douban.com/subject/3564286/Authors: Calvin Lin, Lawrence Snyder

 Search TechniquesSample Problem: n Queens [Traditional]Place n queens on an n x n chess board so that no queen is attacked by another queen.Depth First Search (DFS) Th

http://codeforces.com/problemset/problem/332/BMaximum Absurditytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutput

Shuttle PuzzleTraditionalThe Shuttle Puzzle of size 3 consists of 3 white marbles, 3 black marbles, and a strip of wood with 7 holes. The marbles of the same color are placed in the holes at the o

Buy Low, Buy LowerThe advice to "buy low" is half the formula to success in the stock market. But to be considered a great investor you must also follow this problems' advice:"Buy low, buy lower

?D: incremental (not re-compute from scratch), Rabin-Karp rolling hash!

2013年3月23号竞赛题目一主办方： 百度公司开始时间：2013-03-23 20:00结束时间：2013-03-23 22:00已结束 平衡负载Du熊正在负责一个大型的项目，目前有K台服务器，有N个任务需要用这K台服务器来完成，所以要把这些任务分成K个部分来完成，在同上台服务

http://codeforces.com/contest/287B: 二分 求最大的小于某数之和http://en.wikipedia.org/wiki/Binary_search_algorithmhttp://community.topcoder.com/tc?module=Static&d1=tutorials&d2=binarySearch

2013年4月13日竞赛题目一du熊的机器人Descriptiondu熊正在玩一个别人刚送给它的机器人。这个机器人只能在一个棋盘中行走，棋盘的左上角格子为(0, 0)，右下角格子为(X, Y)。du熊控制这个机器人从棋盘的左上角，走到右下角，再从右下角回到左上角。当机器人从左上角走到右下角的过程中，如果它当前所在格子为(x, y)，则它只能走到(x+1, y)或(x

Excerpts from the Book: Python Programming in Contexthttp://en.wikipedia.org/wiki/Sobel_operatorIn order to find an edge, it is necessary to evaluate each pixel in relation to those that a

CryptcowgraphyBrian DeanThe cows of Farmer Brown and Farmer John are planning a coordinated escape from their respective farms and have devised a method of encryption to protect their written comm

Fence RailsBurch, Kolstad, and SchrijversFarmer John is trying to erect a fence around part of his field.He has decided on the shape of the fence and has even already installed the posts, but he's

http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=binarySearchBinary SearchWhat we can call the main theorem states that binary search can be used if and only if for all x in

to be done

http://acm.tju.edu.cn/toj/showp3914.htmlhttp://blog.youkuaiyun.com/wmn_wmn/article/details/7840539http://blog.ac521.org/?p=512http://en.wikipedia.org/wiki/Lucas'_theoremhttp://blog.youkuaiyun.com/wu

http://baike.baidu.com/view/288212.htmhttp://en.wikipedia.org/wiki/Topological_sorting

http://cerberus.delos.com:791/usacotext2?a=AbaQgb9KD6b&S=chtexthttp://en.wikipedia.org/wiki/Graham_scan

Pollutant ControlHal BurchIt's your first day in Quality Control at Merry Milk Makers, and already there's been a catastrophe: a shipment of bad milk has been sent out. Unfortunately, you didn't d

Musical ThemesBrian DeanA musical melody is represented as a sequence of N (1 <= N <= 5000) notes that are integers in the range 1..88, each representing a key on the piano. It is unfortunate but

Official Analysis: https://code.google.com/codejam/contest/2418487/dashboard#s=aC++ code for Problem A:#include #include using namespace std;const int MAXLEN = 10000;class BigInteger

Official analysis: https://code.google.com/codejam/contest/2437488/dashboard#s=aC++ codesProblem A (small)#include #include #include using namespace std;inline bool is_constant(cha

Use USACO [3_2_butter] as an exampleSPFA is an improvement of the Bellman-Ford algorithm, check the corresponding wikipedia page1. worst case: same complexity as Bellman-Ford O(VE)average perf