<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dxx_111的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dxx_111</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dxx_111]]></copyright><item><title><![CDATA[力扣322.零钱兑换]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/105575108</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/105575108</guid><author>dxx_111</author><pubDate>Fri, 17 Apr 2020 11:30:32 +0800</pubDate><description><![CDATA[给定不同面额的硬币 coins 和一个总金额 amount。编写一个函数来计算可以凑成总金额所需的最少的硬币个数。如果没有任何一种硬币组合能组成总金额，返回-1。

示例1:

输入: coins = [1, 2, 5], amount = 11
输出: 3
解释: 11 = 5 + 5 + 1


示例 2:

输入: coins = [2], amount = 3
输出: -1

说明:...]]></description><category></category></item><item><title><![CDATA[php相关配置及相关基础知识点]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/52716953</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/52716953</guid><author>dxx_111</author><pubDate>Sat, 01 Oct 2016 11:13:38 +0800</pubDate><description><![CDATA[PHP知识点：
一．环境安装
1、 LAMP=linux+apache+mysql+php
Mysql与PHP之间的关系：
C/S架构
浏览器和apache之间的关系：
B/S架构
配置虚拟主机：
①   先在E:\phpenv\apache\conf\extra的httpd-vhosts.conf中输入：

DocumentRoot "E:/phpenv/homework"]]></description><category></category></item><item><title><![CDATA[hdoj 5665 Lucky 【水】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51253852</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51253852</guid><author>dxx_111</author><pubDate>Tue, 26 Apr 2016 20:40:50 +0800</pubDate><description><![CDATA[Lucky
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 554    Accepted Submission(s): 327



Problem Description

    Chaos
 August lik]]></description><category></category></item><item><title><![CDATA[zoj 3946 Highway Project【SPFA多个性质的最优化】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51245760</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51245760</guid><author>dxx_111</author><pubDate>Mon, 25 Apr 2016 21:53:29 +0800</pubDate><description><![CDATA[Highway Project

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 

Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from t]]></description><category></category></item><item><title><![CDATA[poj 3080 Blue Jeans 【kmp+暴力】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51244623</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51244623</guid><author>dxx_111</author><pubDate>Mon, 25 Apr 2016 19:18:05 +0800</pubDate><description><![CDATA[Blue Jeans




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 15694
 
Accepted: 6978




Description

The Genographic Project is a research partnership between IBM a]]></description><category></category></item><item><title><![CDATA[zzuli oj 1873: This offer 【dfs+数组标记技巧（set会超时）】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51192091</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51192091</guid><author>dxx_111</author><pubDate>Tue, 19 Apr 2016 16:59:07 +0800</pubDate><description><![CDATA[1873: This offer
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 210  Solved: 52

SubmitStatusWeb
 Board
Description

话说WX入职已经有一个多月了，公司boss突然扔给他了一个问题，如果解决不了的话就会被开除掉 - -#，情急之下他只能来请教你了，boss给了他N个]]></description><category></category></item><item><title><![CDATA[zzuli 1872: Which Offer？【水】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51192069</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51192069</guid><author>dxx_111</author><pubDate>Tue, 19 Apr 2016 16:57:31 +0800</pubDate><description><![CDATA[1872: Which Offer？
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 183  Solved: 129

SubmitStatusWeb
 Board
Description

经过不懈的努力，wx终于拿到了offer，果然搞ACM拿高薪呀~但是拿到offer的同时也犯了难，究竟该选择哪个offer呢，他决定用一个简单]]></description><category></category></item><item><title><![CDATA[zzuli oj 1871: NO offer <set容器的用法>]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51191480</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51191480</guid><author>dxx_111</author><pubDate>Tue, 19 Apr 2016 16:12:21 +0800</pubDate><description><![CDATA[1871: NO offer
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 393  Solved: 167

SubmitStatusWeb
 Board
Description

最近WX正在帝都苦逼的找工作，面对招聘网站上众多的公司，WX犯了难，不知道该投哪家公司了，最终他做了一个英（qi）明（pa）的决策，他决定从这些公司编]]></description><category></category></item><item><title><![CDATA[Problem 1606 - Funny Sheep]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51107973</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51107973</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 22:18:09 +0800</pubDate><description><![CDATA[Problem 1606 - Funny Sheep 
Time Limit: 1000MS   Memory Limit: 65536KB  

Total Submit: 612  Accepted: 169  Special Judge: No


Description

There are N+1 rows and M+1 columns fence with N*M g]]></description><category></category></item><item><title><![CDATA[nyoj 714 Card Trick]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51107731</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51107731</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 21:44:17 +0800</pubDate><description><![CDATA[Card Trick
时间限制：1000 ms  |  内存限制：65535 KB
难度：3

描述
The magician shuffles a small pack of cards, holds it face down and performs the following procedure:

The top card is moved to the bottom of ]]></description><category></category></item><item><title><![CDATA[Problem 1603 - Minimum Sum 【好题】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51106877</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51106877</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 19:29:07 +0800</pubDate><description><![CDATA[Problem 1603 - Minimum Sum 
Time Limit: 2000MS  
Memory Limit: 65536KB   
Total Submit: 540  Accepted: 146  Special Judge: No


Description

There are n numbers A[1] , A[2] .... A[n], you can ]]></description><category></category></item><item><title><![CDATA[0-1背包总结]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103491</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103491</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:59:48 +0800</pubDate><description><![CDATA[0-1背包总结： 

0-1背包就是往一个固定体积的包里面如物品，看看能装的最大价值的物品的价值是多少！但是有时候他会将这个进行变形，但是百变不离其宗，只要抓住关键点（就是在一个固定的容器（不管是什么性质都行）装东西，使另一个标准达到最大值），剩下的就好算了！
1. Hdoj 5501 The Highest Mark: 在固定时间内使分数达到最大值
2．Hdoj 1864 最大报销额：在]]></description><category></category></item><item><title><![CDATA[nyoj 325 zb的生日【0-1背包】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103282</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103282</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:21:44 +0800</pubDate><description><![CDATA[zb的生日
时间限制：3000 ms  |  内存限制：65535 KB
难度：2





描述今天是阴历七月初五，acm队员zb的生日。zb正在和C小加、never在武汉集训。他想给这两位兄弟买点什么庆祝生日，经过调查，zb发现C小加和never都很喜欢吃西瓜，而且一吃就是一堆的那种，zb立刻下定决心买了一堆西瓜。当他准备把西瓜送给C小加和never的时候，遇到了一个难题，ne]]></description><category></category></item><item><title><![CDATA[hdoj 1203 I NEED A OFFER!【0-1背包+逆向思维】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103267</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103267</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:20:02 +0800</pubDate><description><![CDATA[I NEED A OFFER!
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22750    Accepted Submission(s): 9104



Problem Description

Speakless]]></description><category></category></item><item><title><![CDATA[nyoj 890 又见01背包【0-1背包+逆向思维】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103263</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103263</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:18:33 +0800</pubDate><description><![CDATA[又见01背包
时间限制：1000 ms  |  内存限制：65535 KB
难度：3





描述
    有n个重量和价值分别为wi 和 vi 的 物品，从这些物品中选择总重量不超过 W 
的物品，求所有挑选方案中物品价值总和的最大值。
　　1 
　　1 
　　1 
　　1 


输入多组测试数据。
每组测试数据第一行输入，n 和 W ，接下来有n行，每行输]]></description><category></category></item><item><title><![CDATA[nyoj 289 苹果【裸0-1背包】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103260</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103260</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:16:05 +0800</pubDate><description><![CDATA[苹果
时间限制：3000 ms  |  内存限制：65535 KB
难度：3





描述

ctest有n个苹果，要将它放入容量为v的背包。给出第i个苹果的大小和价钱，求出能放入背包的苹果的总价钱最大值。





输入有多组测试数据，每组测试数据第一行为2个正整数，分别代表苹果的个数n和背包的容量v，n、v同时为0时结束测试，此时不输出。接下来的n行，每行2个]]></description><category></category></item><item><title><![CDATA[hdoj 2602 Bone Collector【裸0-1背包】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103246</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103246</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:13:03 +0800</pubDate><description><![CDATA[Bone Collector
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 46309    Accepted Submission(s): 19282



Problem Description

Many year]]></description><category></category></item><item><title><![CDATA[hdoj 2955 Robberies【对立事件+0-1背包】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103242</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103242</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:11:18 +0800</pubDate><description><![CDATA[Robberies
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18678    Accepted Submission(s): 6892



Problem Description

The aspiring Ro]]></description><category></category></item><item><title><![CDATA[hdoj 2546 饭卡 【转化思维+0-1背包】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103234</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103234</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:09:15 +0800</pubDate><description><![CDATA[饭卡
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 19642    Accepted Submission(s): 6851



Problem Description

电子科大本部食堂的饭卡有一种很诡异的设计，即]]></description><category></category></item><item><title><![CDATA[hdoj 1864 最大报销额【0-1背包变形】]]></title><link>https://blog.youkuaiyun.com/dxx_111/article/details/51103228</link><guid>https://blog.youkuaiyun.com/dxx_111/article/details/51103228</guid><author>dxx_111</author><pubDate>Sat, 09 Apr 2016 09:07:18 +0800</pubDate><description><![CDATA[最大报销额
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 21045    Accepted Submission(s): 6308



Problem Description

现有一笔经费可以报销一定额度的发票。允]]></description><category></category></item></channel></rss>