剑不飞

摘要： English GameTime Limit 1000msMemory Limit 65536Kdescription This English game is a simple English words connection game. The rules are as follows: there are N English words in a dictionary, and every word has its own weight v. There is a weight if the corresponding word is used. Now there is a ta... 阅读全文

摘要： HELPTime Limit 1000msMemory Limit 65536Kdescription You are a warrior, but your dear princess was caught by big devil. you want to save the princess. each round, you can go around (up ,down ,left, right) ,if the place you stand is a slime or snake you will dead, if the place you stand is a boat o... 阅读全文

摘要： data segment out db 'Input the password please:$' pass db 6 dup(?) data ends code segment assume ds:data,cs:code start:mov ax,data mov ds,ax; mov cx,6 lea dx,out mov ah,09h int 21h lea di,pass again:mov ah,07h;输入不显示字符 int 21h mov [di],al mov dl,'... 阅读全文

摘要： BalanceTime Limit:1000MSMemory Limit:30000KTotal Submissions:8334Accepted:5059DescriptionGigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance.It orders two arms of negligible weight and each arm's length is 15. Some h 阅读全文

摘要： 动态规划的特点及其应用目 录(点击进入)【关键词】【摘要】【正文】§1动态规划的本质§1.1多阶段决策问题§1.2阶段与状态§1.3决策和策略§1.4最优化原理与无后效性§1.5最优指标函数和规划方程§2动态规划的设计与实现§2.1动态规划的多样性§2.2动态规划的模式性§2.3动态规划的技巧性§3动态规划与一些算法的比较§3.1动态规划与递推§3.2动态规划与搜索§3.3动态规划与网络流§4结语【附录：部分试题与源程序】1.“花店橱窗布置问题” 阅读全文

摘要： RelocationTime Limit:1000MSMemory Limit:65536KTotal Submissions:1411Accepted:574DescriptionEmma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping them relocate. To move the furniture, they only have two compact cars, 阅读全文

摘要： 一：01背包poj 3624Charm Bracelet背包不需要装满，只能用一次#include #include #include #include using namespace std; const int mm=12889; int dp[mm]; int n,m; int main() { while(~scanf("%d%d",&n,&m)) { int a,b; memset(dp,0,sizeof(dp)); for(int i=0;i=0;--i) dp[i+a]=max(dp[i]+b,dp[i+a]); } pri... 阅读全文

摘要： UVa专题练习A-410003 经典dp，可用四边形不等式优化10029 基础dp，DAG最长路，需高效构图10032 经典问题。子集和数问题。01背包问题10036 能否在一个整数序列的每相邻两项之间添加一个加减号。使最终结果能被一个定整数K整除10051 简单dp。DAG最长路A-510154 dp中等10163 二分、dp10185 二叉树。dp、贪心A-610239 不错的dp，可优化，解决更大规模的问题10271 经典dp，需要证明一个结论10280 dp、最短路10296 中国油路问题，最短路，任意图最大匹配，用集合dp求解A-710304 经典问题（OBST），dp，可用四边形不 阅读全文

摘要： Reverse a RoadTime Limit 1000msMemory Limit 65536Kdescription Peter resides in the city of Nanuh, and goes to his working place in this city every weekday.He has been totally annoyed with the road traffic of this city. All the roads in this city are one-way, so he has to drive a longer way than he . 阅读全文

摘要： TripTime Limit 1000msMemory Limit 65536Kdescription Xiao wang has a new car, so he wants to have a trip from his home to hefei, however, there is no road from his house directly to Hefei, so he has to go through a number of cities to get to hefei, his car takes one unit of time driving a unit dista. 阅读全文