<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DrownFish19的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/DrownFish19</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DrownFish19]]></copyright><item><title><![CDATA[Edit Distance]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/53303775</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/53303775</guid><author>DrownFish19</author><pubDate>Wed, 23 Nov 2016 12:28:52 +0800</pubDate><description><![CDATA[Edit Distance



Time Limit: 1000 MS    Memory Limit: 65536 Kb


Total Submission: 677   Accepted: 105







Description

设A 和B 是2 个字符串。要用最少的字符操作将字符串A 转换为字符串B。这里所说的字符操作包括
(1)删除一个字符；]]></description><category></category></item><item><title><![CDATA[Multiplication Table]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/53303770</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/53303770</guid><author>DrownFish19</author><pubDate>Wed, 23 Nov 2016 12:27:59 +0800</pubDate><description><![CDATA[Multiplication Table



Time Limit: 1000 MS    Memory Limit: 65536 Kb


Total Submission: 374   Accepted: 163







Description

定义于字母表S={a,b,c}上的乘法表如下




 
a
b
c


a
b]]></description><category></category></item><item><title><![CDATA[Number Triangles]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/53303763</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/53303763</guid><author>DrownFish19</author><pubDate>Wed, 23 Nov 2016 12:27:00 +0800</pubDate><description><![CDATA[Number Triangles



Time Limit: 1000 MS    Memory Limit: 65536 Kb


Total Submission: 1232   Accepted: 536







Description

给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法，计算出从三角形的顶至底的一条路径，使该路径经过的数]]></description><category></category></item><item><title><![CDATA[Renting Boats]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/53303759</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/53303759</guid><author>DrownFish19</author><pubDate>Wed, 23 Nov 2016 12:25:57 +0800</pubDate><description><![CDATA[Renting Boats



Time Limit: 1000 MS    Memory Limit: 65536 Kb


Total Submission: 1032   Accepted: 438







Description

长江游艇俱乐部在长江上设置了n 个游艇出租站1，2，…，n。游客可在这些游艇出租站租用游艇，并在下游的任何一个游艇出租]]></description><category></category></item><item><title><![CDATA[集合划分问题 2]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/53303754</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/53303754</guid><author>DrownFish19</author><pubDate>Wed, 23 Nov 2016 12:25:10 +0800</pubDate><description><![CDATA[集合划分问题 2



Time Limit: 1000 MS    Memory Limit: 65536 Kb


Total Submission: 1390   Accepted: 606







Description

n个元素的集合{1,2,..., n }可以划分为若干个非空子集。例如，当n=4 时，集合{1，2，3，4}可以划分为15 个不]]></description><category></category></item><item><title><![CDATA[集合划分问题]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/53303746</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/53303746</guid><author>DrownFish19</author><pubDate>Wed, 23 Nov 2016 12:23:03 +0800</pubDate><description><![CDATA[集合划分问题



Time Limit: 1000 MS    Memory Limit: 65536 Kb


Total Submission: 2073   Accepted: 471







Description

n个元素的集合{1,2,..., n }可以划分为若干个非空子集。例如，当n=4 时，集合{1，2，3，4}可以划分为15 个不同的]]></description><category></category></item><item><title><![CDATA[邮局选址问题]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/53303737</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/53303737</guid><author>DrownFish19</author><pubDate>Wed, 23 Nov 2016 12:21:42 +0800</pubDate><description><![CDATA[邮局选址问题



Time Limit: 1000 MS    Memory Limit: 65536 Kb


Total Submission: 1416   Accepted: 491







Description

在一个按照东西和南北方向划分成规整街区的城市里，n个居民点散乱地分布在不同的街区中。用x 坐标表示东西向，用y坐标表示南北向。各居民]]></description><category></category></item><item><title><![CDATA[表达式求值]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/52987914</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/52987914</guid><author>DrownFish19</author><pubDate>Mon, 31 Oct 2016 22:27:48 +0800</pubDate><description><![CDATA[Description

求出在整型范围内的表达式的值，包含+，-，*，/，（，）和数字。

Input

一个合法的表达式。

Output

表达式的值(保留两位小数)。

Sample Input

((1+2)*3)+(3)
1+2*3
15/5+2

Sample Output

12.00
7.00

5.00
import java.u]]></description><category></category></item><item><title><![CDATA[直接插入排序]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/51504962</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/51504962</guid><author>DrownFish19</author><pubDate>Thu, 26 May 2016 10:25:57 +0800</pubDate><description><![CDATA[//直接插入排序
#include 
using namespace std;

void Insertsort(int num[],int n)
{
 int i,j;
 int temp;
 for(i=1;i<n;i++)
 {
  temp=num[i];
  j=i-1;  //从右向左寻找num[i]的插入位置
  while(j>=0 && temp<num[j])
  {
   n]]></description><category></category></item><item><title><![CDATA[冒泡排序]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/51504948</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/51504948</guid><author>DrownFish19</author><pubDate>Thu, 26 May 2016 10:25:05 +0800</pubDate><description><![CDATA[//冒泡排序算法

#include 
using namespace std;


void Bubblesort(int num[],int n)
{
 int i,j,temp;
 for(i=n;i>0;i--)
  for(j=0;j<i-1;j++)  //注意i和j的范围
  {
   if(num[j]>num[j+1])
   {
    temp=num[j];
    num]]></description><category></category></item><item><title><![CDATA[归并排序]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/51504894</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/51504894</guid><author>DrownFish19</author><pubDate>Thu, 26 May 2016 10:20:50 +0800</pubDate><description><![CDATA[//归并排序

#include 
using namespace std;

// 归并排序中的合并算法
void Merge(int a[], int left, int center, int len)
{
      int *t = (int *) malloc((len-left+1) * sizeof(int)); //申请空间，大小为两个已经排序序列之和，该空间用来存放合并后的序列]]></description><category></category></item><item><title><![CDATA[哈希表]]></title><link>https://blog.youkuaiyun.com/DrownFish19/article/details/51504851</link><guid>https://blog.youkuaiyun.com/DrownFish19/article/details/51504851</guid><author>DrownFish19</author><pubDate>Thu, 26 May 2016 10:17:27 +0800</pubDate><description><![CDATA[#include "stdio.h"
#include "stdlib.h"

#define SUCCESS 1
#define UNSUCCESS 0
#define DUPLICATE -1
#define OK 1
#define ERROR -1
#define EQ(a,b) ((a)==(b))
#define LT(a,b) ((a)< (b))
#define LQ(a,b) (]]></description><category></category></item></channel></rss>