<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ling_bei的博客]]></title><description><![CDATA[freedom]]></description><link>https://blog.youkuaiyun.com/ling_bei</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ling_bei]]></copyright><item><title><![CDATA[基础练习  Huffuman树]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/79317182</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/79317182</guid><author>ling_bei</author><pubDate>Mon, 12 Feb 2018 15:46:08 +0800</pubDate><description><![CDATA[基础练习 Huffuman树  时间限制：1.0s   内存限制：512.0MB      问题描述　　Huffman树在编码中有着广泛的应用。在这里，我们只关心Huffman树的构造过程。　　给出一列数{pi}={p0, p1, …, pn-1}，用这列数构造Huffman树的过程如下：　　1. 找到{pi}中最小的两个数，设为pa和pb，将pa和pb从{pi}中删除掉，然后将它们的和加入到{p...]]></description><category></category></item><item><title><![CDATA[基础练习  高精度加法]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/79312182</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/79312182</guid><author>ling_bei</author><pubDate>Sun, 11 Feb 2018 17:27:10 +0800</pubDate><description><![CDATA[基础练习 高精度加法  时间限制：1.0s   内存限制：512.0MB      问题描述　　输入两个整数a和b，输出这两个整数的和。a和b都不超过100位。算法描述　　由于a和b都比较大，所以不能直接使用语言中的标准数据类型来存储。对于这种问题，一般使用数组来处理。　　定义一个数组A，A[0]用于存储a的个位，A[1]用于存储a的十位，依此类推。同样可以用一个数组B来存储b。　　计算c = a...]]></description><category></category></item><item><title><![CDATA[基础练习  阶乘计算]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/79305602</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/79305602</guid><author>ling_bei</author><pubDate>Sat, 10 Feb 2018 16:51:31 +0800</pubDate><description><![CDATA[  基础练习 阶乘计算  时间限制：1.0s   内存限制：512.0MB      问题描述　　输入一个正整数n，输出n!的值。　　其中n!=1*2*3*…*n。算法描述　　n!可能很大，而计算机能表示的整数范围有限，需要使用高精度计算的方法。使用一个数组A来表示一个大整数a，A[0]表示a的个位，A[1]表示a的十位，依次类推。　　将a乘以一个整数k变为将数组A的每一个元素都乘以k，请注意处理...]]></description><category></category></item><item><title><![CDATA[sort排序]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/79205991</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/79205991</guid><author>ling_bei</author><pubDate>Tue, 30 Jan 2018 15:27:16 +0800</pubDate><description><![CDATA[sort头文件：#include&amp;lt;algorithm&amp;gt;using namespace std;   一：sort进行全部排序  令a[10]={1,2,3,4,5,6,7,8,9,10};（1） 从小到大：sort（数组名+起始地址（第一个数的下标），数组名+末尾地址（最后一个数的下标+1））#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;algorithm&amp;g...]]></description><category></category></item><item><title><![CDATA[uva 10375 Choose and divide]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/78757047</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/78757047</guid><author>ling_bei</author><pubDate>Sat, 09 Dec 2017 09:23:29 +0800</pubDate><description><![CDATA[Choose and divide
 



题意：求C(p,q)/C(r,s)的值

  由公式C(m, n) = m!/(m − n)! n!得 C(p,q) / C(r,s)== ( p! / q! (p - q)! )
  *  ( s! (r - s)! / (r!) )
 而p!/(p-q)!=p*(p-1)*...(p-q+1)         (r-s)!/r!=]]></description><category></category></item><item><title><![CDATA[特殊的排序 51Nod - 1241]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/78679911</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/78679911</guid><author>ling_bei</author><pubDate>Thu, 30 Nov 2017 19:54:01 +0800</pubDate><description><![CDATA[1241 特殊的排序

题目来源： 摩根斯坦利的比赛题

基准时间限制：1 秒 空间限制：131072 KB 分值: 80 难度：5级算法题






一个数组的元素为1至N的整数，现在要对这个数组进行排序，在排序时只能将元素放在数组的头部或尾部，问至少需要移动多少个数字，才能完成整个排序过程？

例如：
2 5 3 4 1 将1移到头部 => 
1 2 5 3 4]]></description><category></category></item><item><title><![CDATA[LightOJ - 1282 Leading and Trailing]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/77196655</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/77196655</guid><author>ling_bei</author><pubDate>Tue, 15 Aug 2017 16:33:14 +0800</pubDate><description><![CDATA[Leading and Trailing
 LightOJ - 1282 



题意： 

       求n^k的前三位数和后三位数
思路：
      后三位数可以想起来快速求幂模板，对n^k求余，后三位即为(n^k)%1000。
     前三位数为n^k=(10^a)^k=10^a*k=(10^x)*(10^y);其中x,y分别是a*k的整数部分和小数部分对于t=n^]]></description><category></category></item><item><title><![CDATA[HDU - 1159 Common Subsequence]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76666189</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76666189</guid><author>ling_bei</author><pubDate>Fri, 04 Aug 2017 10:29:54 +0800</pubDate><description><![CDATA[Common Subsequence
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40191    Accepted Submission(s): 18522



Problem Description

A sub]]></description><category></category></item><item><title><![CDATA[HDU - 1421 搬寝室]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76666061</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76666061</guid><author>ling_bei</author><pubDate>Fri, 04 Aug 2017 10:28:04 +0800</pubDate><description><![CDATA[搬寝室
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 29117    Accepted Submission(s): 9995



Problem Description

搬寝室是很累的,xhd深有体会.时间追述2]]></description><category></category></item><item><title><![CDATA[HDU - 1203 I NEED A OFFER!]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76665582</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76665582</guid><author>ling_bei</author><pubDate>Fri, 04 Aug 2017 10:26:27 +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): 29491    Accepted Submission(s): 12027



Problem Description

Speakles]]></description><category></category></item><item><title><![CDATA[HDU - 1864 最大报销额]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76665452</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76665452</guid><author>ling_bei</author><pubDate>Fri, 04 Aug 2017 10:25:06 +0800</pubDate><description><![CDATA[最大报销额
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 26235    Accepted Submission(s): 8070



Problem Description

现有一笔经费可以报销一定额度的发票。允]]></description><category></category></item><item><title><![CDATA[HDU - 2546 饭卡]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76665219</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76665219</guid><author>ling_bei</author><pubDate>Fri, 04 Aug 2017 10:23:13 +0800</pubDate><description><![CDATA[饭卡
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 31158    Accepted Submission(s): 10698



Problem Description

电子科大本部食堂的饭卡有一种很诡异的设计，]]></description><category></category></item><item><title><![CDATA[HDU - 1978  How many ways（动态规划或记忆化搜索）]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76649356</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76649356</guid><author>ling_bei</author><pubDate>Thu, 03 Aug 2017 20:36:35 +0800</pubDate><description><![CDATA[How many ways
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5695    Accepted Submission(s): 3365



Problem Description

这是一个简单的生存游戏，]]></description><category></category></item><item><title><![CDATA[01背包问题和完全背包问题]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76571957</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76571957</guid><author>ling_bei</author><pubDate>Wed, 02 Aug 2017 10:24:28 +0800</pubDate><description><![CDATA[代码精简，解释详细
http://blog.youkuaiyun.com/kangroger/article/details/38864689]]></description><category></category></item><item><title><![CDATA[HDU 3466  Proud Merchants （01背包排序问题）]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76538322</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76538322</guid><author>ling_bei</author><pubDate>Tue, 01 Aug 2017 16:05:19 +0800</pubDate><description><![CDATA[详细解释，受益匪浅
http://www.mamicode.com/info-detail-1009053.html




Proud Merchants
 HDU - 3466 




有关排序的01背包问题


该题要确保q-p小的先被”挑选“，差值越小使用它的价值越大(做出的牺牲越小).
把 5 10 5 看作p1,q1,v1，把 3 5  6 看作p2,]]></description><category></category></item><item><title><![CDATA[POJ - 1163 The Triangle（动态规划）]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76468001</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76468001</guid><author>ling_bei</author><pubDate>Mon, 31 Jul 2017 20:12:39 +0800</pubDate><description><![CDATA[这个便是这道题的详细解答
http://blog.youkuaiyun.com/baidu_28312631/article/details/47418773

借鉴一下大神之作






The Triangle




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 50275
 
]]></description><category></category></item><item><title><![CDATA[HDU - 1231 最大连续子序列(动态规划)]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76465975</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76465975</guid><author>ling_bei</author><pubDate>Mon, 31 Jul 2017 19:39:34 +0800</pubDate><description><![CDATA[最大连续子序列
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 33568    Accepted Submission(s): 15158



Problem Description

给定K个整数的序列{ N1, N]]></description><category></category></item><item><title><![CDATA[NYOJ   括号配对问题（栈）]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76263307</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76263307</guid><author>ling_bei</author><pubDate>Fri, 28 Jul 2017 15:41:06 +0800</pubDate><description><![CDATA[括号配对问题
时间限制：3000 ms  |  内存限制：65535 KB
难度：3





描述现在，有一行括号序列，请你检查这行括号是否配对。


输入第一行输入一个数N（0
输出每组输入数据的输出占一行，如果该字符串中所含的括号是配对的，则输出Yes,如果不配对则输出No
样例输入
3
[(])
(])
([[]()])

样例输出
No
No
Yes
]]></description><category></category></item><item><title><![CDATA[POJ - 3021  e-Coins （bfs）]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76202148</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76202148</guid><author>ling_bei</author><pubDate>Thu, 27 Jul 2017 15:48:59 +0800</pubDate><description><![CDATA[e-Coins




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 750
 
Accepted: 372




Description

At the Department for Bills and Coins, an extension of today's moneta]]></description><category></category></item><item><title><![CDATA[POJ - 2240    Arbitrage （Bellman-Ford ）]]></title><link>https://blog.youkuaiyun.com/ling_bei/article/details/76178033</link><guid>https://blog.youkuaiyun.com/ling_bei/article/details/76178033</guid><author>ling_bei</author><pubDate>Thu, 27 Jul 2017 11:31:51 +0800</pubDate><description><![CDATA[Arbitrage




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 23813
 
Accepted: 10087




Description

Arbitrage is the use of discrepancies in currency exchange rate]]></description><category></category></item></channel></rss>