06 2015 档案
摘要:The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a co...
阅读全文
摘要:操作大全:http://wiki.ubuntu.org.cn/Ubuntu%E6%A1%8C%E9%9D%A2%E5%85%A5%E9%97%A8%E6%8C%87%E5%8D%97使用终端编译方法:alt + cirl + T 打开终端 输入vim 即可打开vim再打开一个终端 输入g++ -v编...
阅读全文
摘要:Problem DescriptionPog and Szh are playing games.There is a sequence with n numbers, Pog will choose a number A from the sequence. Szh will choose a...
阅读全文
摘要:DescriptionSuppose we have n ropes of equal length and we want to use them to lift some heavy object. A tear-off weight t is associated to each rope, ...
阅读全文
摘要:Description一条小溪尺寸不大,青蛙可以从左岸跳到右岸,在左岸有一石柱L,面积只容得下一只青蛙落脚,同样右岸也有一石柱R,面积也只容得下一只青蛙落脚。有一队青蛙从尺寸上一个比一个小。我们将青蛙从小到大,用1,2,…,n编号。规定初始时这队青蛙只能趴在左岸的石头L上,当然是一个落一个,小的落在...
阅读全文
摘要:You are given a non-negative integern, its decimal representation consists of at most100digits and doesn't contain leading zeroes.Your task is to dete...
阅读全文
摘要:You are given strings. Your task is to determine if the given stringscontains two non-overlapping substrings "AB" and "BA" (the substrings can go in a...
阅读全文
摘要:You havenproblems. You have estimated the difficulty of thei-th one as integerci. Now you want to prepare a problemset for a contest, using some of th...
阅读全文
摘要:Problem Description给定序列A={A1,A2,...,An}, 要求改变序列A中的某些元素,形成一个严格单调的序列B(严格单调的定义为:Bi= temp a[i]即使小到最小仍旧比后面一个数大,说明不可行3.其他情况为了保证严格递增 temp--二分左闭右开#include#inc...
阅读全文
摘要:Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一...
阅读全文
摘要:匈牙利算法(hungary)详解请看http://philoscience.iteye.com/blog/1754498匈牙利算法是用来计算最大匹配,用了增广路思想增广路径有如下特性:1. 有奇数条边2. 起点在二分图的X边,终点在二分图的Y边3. 路径上的点一定是一个在X边,一个在Y边,交错出现。...
阅读全文