2015年11月_fxy流年无悔

原创 hdu 1151 Air Raid

A B C D E F G H ID - Air RaidTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionConsider a town where all the streets are o

2015-11-26 15:43:24 322

原创 HDU 1150 Machine Schedule 二分图最小覆盖点

A B C D E F G H IC - Machine ScheduleTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAs we all know, machine scheduling

2015-11-20 17:47:34 410

原创 hdu 2063过山车-二分图匈牙利算法

A B C D E F G H IB - 过山车Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有

2015-11-20 16:51:14 961

原创 POJ 3401 Asteroids 二分图最大匹配最小点覆盖

A - AsteroidsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionBessie wants to navigate her spaceship through a dangerous astero

2015-11-20 13:22:05 688

原创三星题 6.20八皇后问题

public class EightQueen { public static final int size=8; public static int[] rows = new int[size]; public static int[] cols = new int[size]; public static int[] cross1 = new in

2015-11-19 18:17:44 473

原创最小拦截系统Hdu1257 dp

最少拦截系统 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 47 Accepted Submission(s) : 19Font: Times New Roman | Verdana | GeorgiaFont Siz

2015-11-19 18:16:41 807

原创 Problem D: D-险恶逃生师创杯 dp

Problem D: D-险恶逃生 ITime Limit: 1 Sec Memory Limit: 128 MBSubmit: 129 Solved: 54[Submit][Status][Web Board]DescriptionKoha被邪恶的巫师困在一个m*n的矩阵当中，他被放在了矩阵的最左上角坐标(0,0)处，而唯一的出口在矩阵最右下角坐标(m-1

2015-11-13 20:07:46 365

原创师创杯1

Problem A: A--A Repeating CharactersTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 46 Solved: 27[Submit][Status][Web Board]DescriptionFor this problem,you will write a progra

2015-11-13 15:23:10 1054

原创字典树+AC自动机Hyper Prefix SetsＵＶＡ１１４８８YTACM第一周E

Pre x goodness of a set string is length of longest common pre x*number of strings in the set. Forexample the pre x goodness of the set f000,001,0011g is 6.You are given a set of binary strings.

2015-11-12 19:34:05 388

原创敌兵布阵之字典树

A BCDEFA - 敌兵布阵Crawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionC国的死对

2015-11-12 14:43:47 364

原创 po3437求出有序树转化为二叉树前后的高度 Tree Grafting

Tree GraftingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2049 Accepted: 901DescriptionTrees have many applications in computer science. Perhaps

2015-11-12 14:34:39 496

原创丑数humble number

Humble Numbers Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 30 Accepted Submission(s) : 13Font: Times New Roman | Verdana | Georgia Font

2015-11-06 20:24:13 393

原创 dp common setensences 最长公共子串

Common Subsequence Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 45 Accepted Submission(s) : 28Font: Times New Roman | Verdana | Georgia F

2015-11-06 18:39:01 909

原创 dp 数塔

数塔 Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 44 Accepted Submission(s) : 31Font: Times New Roman | Verdana | Georgia Font Size: ← →P

2015-11-06 18:12:18 371

原创 poj 2479 dp Maximum sum求两段连续不重叠子段的最大和

Maximum sumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36996 Accepted: 11535DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a fu

2015-11-05 21:45:41 927

原创 poj1163 dp the triangle

The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 41825 Accepted: 25295Description73 88 1 02 7 4 44 5 2 6 5(Figure

2015-11-05 20:27:27 354

原创 POJ1330最近的祖先

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22669 Accepted: 11830DescriptionA rooted tree is a well-known data structure in

2015-11-05 19:52:56 286

原创最小循环节len-next[len]

A B C D E F G H I J KA - The Minimum LengthTime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThere is a string A. The length of

2015-11-04 19:53:05 408

原创 Java 5.36课后题多边形的面积

//5.36import java.util.Scanner;//import java.text.Area;public class Area { public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.println("please

2015-11-04 19:48:56 562

a716121的专栏