POJ 2195 Going Home Home » 编程开发 » POJ 2195 Going Home Description On a grid map there are n little men and n … 阅读更多
Shoemaker’s problem(贪心) Home » 编程开发 » Shoemaker’s problem(贪心) Shoemaker has N jobs (orders from customers) which he m … 阅读更多
HDU 2444 The Accomodation of Students(二分图判定+最大匹配) Home » 编程开发 » HDU 2444 The Accomodation of Students(二分图判定+最大匹配) Problem Description There are a group of students. Some … 阅读更多
POJ 2312 Battle City(优先队列+BFS) Home » 编程开发 » POJ 2312 Battle City(优先队列+BFS) The input consists of several test cases. The first lin … 阅读更多
HDU1671 Phone List(字典树) Home » 编程开发 » HDU1671 Phone List(字典树) The first line of input gives a single integer, 1 <= … 阅读更多
[ExtJS5学习笔记]第十三节 Extjs5的Ext.each方法学习 Home » 编程开发 » [ExtJS5学习笔记]第十三节 Extjs5的Ext.each方法学习 本文地址: sencha官方API: 本文作者:sushengmiyan ——R … 阅读更多
Supermarket poj 1456 贪心+并查集优化 Home » 编程开发 » Supermarket poj 1456 贪心+并查集优化 Language: Supermarket Time Limit:2000MSMemory Limit:655 … 阅读更多
poj1222 EXTENDED LIGHTS OUT Home » 编程开发 » poj1222 EXTENDED LIGHTS OUT EXTENDED LIGHTS OUT Time Limit:1000MSMemory Limit:10000 … 阅读更多
hdu3534 树形dp(求树中两点之间的最大距离) Home » 编程开发 » hdu3534 树形dp(求树中两点之间的最大距离) There are several test cases. The first line of each ca … 阅读更多
Can you solve this equation? Home » 编程开发 » Can you solve this equation? For each test case, you should just output one real num … 阅读更多