一，需要环境：You will need a handful of components to make this work: - Apache (webserver) #apache搭建web页面 - PHP 5 ...
分类：
数据库 时间：
2014-09-16 12:19:30
阅读次数：
466
Dungeon MasterTime Limit:1000MSMemory Limit:65536KTotal Submissions:16748Accepted:6522DescriptionYou are trapped in a 3D dungeon and need to find the ...
分类：
其他好文 时间：
2014-09-15 21:10:59
阅读次数：
210
/*to solve the problem ,i think we can use stack to maintain the numbers,and list to keep it sorted,which is very important to find the Median number....
分类：
其他好文 时间：
2014-09-15 19:07:19
阅读次数：
181
Problem Description
I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.
The nation looks like a connected bidirectional graph, and I am rando...
分类：
其他好文 时间：
2014-09-14 01:27:16
阅读次数：
274
Problem Description
I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.
The nation looks like a connected bidirectional graph, and I am randoml...
分类：
其他好文 时间：
2014-09-13 22:50:06
阅读次数：
202
哲学家进餐问题：(1) 在什么情况下5 个哲学家全部吃不上饭？考虑两种实现的方式，如下：A.算法描述： 1 void philosopher(int i) {/*i：哲学家编号，从0 到4*/ 2 while (TRUE) { 3 think( ); /*哲学家正在思考*/ ...
分类：
其他好文 时间：
2014-09-13 14:34:25
阅读次数：
268
Description
Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponenti...
分类：
其他好文 时间：
2014-09-13 09:23:34
阅读次数：
197
Reason 1:In your web.configbut your class is：namespace A.B{ ..... public class D : E {Those names need to match! Thename=attribute on thetag ...
分类：
其他好文 时间：
2014-09-12 19:04:23
阅读次数：
222
We Need Medicine
Time Limit: 10 Seconds
Memory Limit: 65536 KB Special Judge
A terrible disease broke out! The disease was caused by a new type of virus, which will lead to lethal l...
分类：
其他好文 时间：
2014-09-11 21:02:22
阅读次数：
204
这道题就题意来说其实就是一道简单的记录路径的0,1背包，告诉你n个物品，每种物品只能取一次，再有q个询问，问你是否能在满足选出物品的w之和为m的情况下，满足t之和为s的情况，若可以则任意输出一种方案。
因此我们可以设计状态，dp[i][j][k]为前i个物品选出部分，当t之和为j时，w之和为k的情况能否满足，若存在方案则为1，不存在则为0。而状态的转移方程也是很简单。
dp[i][j+t[i]...
分类：
其他好文 时间：
2014-09-11 19:23:52
阅读次数：
173
