HDU - 1560----DNA sequence
The twenty-first century is a biology-technology developing century. We know that a gene is made of DNA. The nucleotide bases from which DNA is built...
POJ - 3126----Prime Path
The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit roo...
POJ - 3278----Catch That Cow
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a num...
POJ - 3279----Fliptile（枚举，遍历）
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which th...
POJ - 1426---Find The Multiple
Input The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the...
HDU - 2181---哈密顿绕行世界问题
一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input 前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m<=20,m>=1.m=0退出. Output 输出...
POJ - 2251---Dungeon Master
You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock...
POJ - 1321 棋盘问题
题目介绍: 在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input 输入含有多组测试数据。 每组数据的第一行是两个正整数，n k，用一...
时间复杂度-----最大区间和
题目大意:在一维数组的连续区间找出其总和最大的连续区间。题目不难，但是很有启迪的一道题目。一个了解时间复杂度题目，用几种不同的时间复杂度实现，直观的感受下几者的速度与效率。设计一个算法时要尽量做到高效。高效之处，就是智慧之处。先看看O(N³)的算法： //方法MaxSum1,MaxSum...