<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Fungyow的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Fungyow</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Fungyow]]></copyright><item><title><![CDATA[八大排序总结]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/76600375</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/76600375</guid><author>Fungyow</author><pubDate>Thu, 03 Aug 2017 19:51:13 +0800</pubDate><description><![CDATA[1. 插入排序—直接插入排序(Straight Insertion Sort)
顾名思义，直接插入排序就是将一个记录插入一个已经排好序的数组中，使原本排好序的数组添加了一个记录并且继续保持排好序。如果在比较时两个记录相等，则把插入的记录放到原先记录的后面，所以插入排序是稳定的。
时间复杂度：O（n^2）。

void InsertSort(int a[], int n)  
{]]></description><category></category></item><item><title><![CDATA[单链表寻找环，寻找环的入口点]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/76557677</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/76557677</guid><author>Fungyow</author><pubDate>Wed, 02 Aug 2017 00:40:38 +0800</pubDate><description><![CDATA[1. 单链表找环（下边图片来自网上）
 
设置一快一慢的指针，从链表的起点（即 A 点）开始跑，快指针（fast）一次跑两步，慢指针（slow）一次跑一步。
① 当没有环时，快指针最终会到达 null （fast == null）。
② 但有环时，但慢指针到达环的入口点时（即 E 点），快指针已经进入了环并在循环中。因此，快指针一定会在慢指针到达环的入口点（即 E 点）前相遇。
代码如下]]></description><category></category></item><item><title><![CDATA[ubuntu 中文件编码转换]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/69488957</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/69488957</guid><author>Fungyow</author><pubDate>Fri, 07 Apr 2017 00:07:32 +0800</pubDate><description><![CDATA[在Ubuntu安装了eclipse并打开从GitHUb上下载了一些Java项目，居然全部都出现中文乱码，然后我检查了eclipse里边的编码设置，从workspace到具体项目中，编码设置全都为utf-8，但是我的代码依旧出现乱码，后来我发现了问题的根源在于项目里边的Java文件原来设置的编码不是utf-8，是什么我就不知道，于是我安装了一个叫enca的东西，把文件编码都改为utf-8，就解决了问]]></description><category></category></item><item><title><![CDATA[JavaScript this 的用法]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/62117621</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/62117621</guid><author>Fungyow</author><pubDate>Wed, 15 Mar 2017 00:35:43 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/pssp/p/5216085.html]]></description><category></category></item><item><title><![CDATA[DateTime用法大全]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/54691845</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/54691845</guid><author>Fungyow</author><pubDate>Mon, 23 Jan 2017 10:40:40 +0800</pubDate><description><![CDATA[本文较详细地介绍了C#的DateTime对象的使用方法.DateTime.Now.ToShortTimeString() DateTime dt = DateTime.Now; dt.ToString();//2005-11-5 13:21:25 dt.ToFileTime().ToString();//127756416859912816 dt.ToFileTimeUtc().ToString(]]></description><category></category></item><item><title><![CDATA[UVa 11997  K Smallest Sums  (优先队列)]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/51099356</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/51099356</guid><author>Fungyow</author><pubDate>Fri, 08 Apr 2016 20:54:36 +0800</pubDate><description><![CDATA[题意：有 k 个整数数组，各包含 k 个元素。在每个数组中取一个元素加起来，可以得到哦 k^k 个和。求这些和中最小的 k 个值（重复的值算多次）
思路：在《算法竞赛入门经典训练指南》中看到这道题，再自己写一写思路，加深理解。
           从 k 个数组中各取一个元素之和中前 k 个最小的值为 k 个组合，则这 k 个组合一定来自前 k - 1 个数组中各取一个元素之和中前 k 个最]]></description><category></category></item><item><title><![CDATA[map的详细用法]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/51092879</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/51092879</guid><author>Fungyow</author><pubDate>Fri, 08 Apr 2016 00:52:40 +0800</pubDate><description><![CDATA[原创网址：http://blog.youkuaiyun.com/sunshinewave/article/details/8067862]]></description><category></category></item><item><title><![CDATA[使用System.arraycopy()实现数组之间的复制]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/51052093</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/51052093</guid><author>Fungyow</author><pubDate>Sun, 03 Apr 2016 21:19:18 +0800</pubDate><description><![CDATA[System提供了一个静态方法arraycopy(),我们可以使用它来实现数组之间的复制。其函数原型是： public static void arraycopy(Object src, int srcPos,
 Object dest, int destPos, int length) src:源数组； srcPos:源数组要复制的起始位置； dest:目的数组； destPos:目的数组放置]]></description><category></category></item><item><title><![CDATA[对于String对象，可以使用"="赋值，也可以使用"new"关键字赋值，两种方式有什么区别？]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/51046215</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/51046215</guid><author>Fungyow</author><pubDate>Sat, 02 Apr 2016 23:44:31 +0800</pubDate><description><![CDATA[本文转自http://www.cnblogs.com/hongten/p/hongten_string_qubie.html

当你看见这个标题的时候，你可能会下意识的去想一下，这两种方式到底有什么样的区别呢？

且看下面的demo，自然便区分开了


 1 /**
 2  * 
 3  */
 4 package com.b510.test;
 5 
 6 /**
 7  * Pr]]></description><category></category></item><item><title><![CDATA[POJ 2001 Shortest Prefixes（字典树）]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/49446899</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/49446899</guid><author>Fungyow</author><pubDate>Tue, 27 Oct 2015 13:19:51 +0800</pubDate><description><![CDATA[Shortest Prefixes




Time Limit: 1000MS
 
Memory Limit: 30000KB
 
64bit IO Format: %I64d & %I64u








Description


A prefix of a string is a substring starting at the beginni]]></description><category></category></item><item><title><![CDATA[UVA 1401 Remember the Word (trie + dp)]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/49387215</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/49387215</guid><author>Fungyow</author><pubDate>Sat, 24 Oct 2015 19:05:34 +0800</pubDate><description><![CDATA[第一次写trie, 看别人的代码看懂的，顺便学了一下dp。
#include 
#include 
#include 
#include 
#define mod 20071027;
using namespace std;

char str[300010], s[110];
int dp[300010];
struct Trie
{
    int ch[400010][26];
    i]]></description><category></category></item><item><title><![CDATA[HDU 5416 CRB and Tree（dfs 异或逆运算）]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47849555</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47849555</guid><author>Fungyow</author><pubDate>Sat, 22 Aug 2015 00:45:45 +0800</pubDate><description><![CDATA[CRB and Tree
Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 760    Accepted Submission(s): 248



Problem Description

CRB has a tree,]]></description><category></category></item><item><title><![CDATA[ZOJ 3790 Consecutive Blocks（尺取法）]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47838247</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47838247</guid><author>Fungyow</author><pubDate>Fri, 21 Aug 2015 18:17:24 +0800</pubDate><description><![CDATA[Consecutive Blocks

Time Limit: 2 Seconds      Memory Limit: 65536 KB

There are N (1 ≤ N ≤ 105) colored blocks (numbered 1 to N from left to right) which are lined up in a row. And the i-th block]]></description><category></category></item><item><title><![CDATA[POJ 1961 （KMP）]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47709209</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47709209</guid><author>Fungyow</author><pubDate>Sun, 16 Aug 2015 23:25:26 +0800</pubDate><description><![CDATA[Period




Time Limit: 3000MS
 
Memory Limit: 30000K


Total Submissions: 14739
 
Accepted: 7015




Description

For each prefix of a given string S with N characters (each charact]]></description><category></category></item><item><title><![CDATA[Light OJ 1422 Halloween Costumes(区间DP）]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47358821</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47358821</guid><author>Fungyow</author><pubDate>Sat, 08 Aug 2015 16:01:37 +0800</pubDate><description><![CDATA[1422 - Halloween Costumes





PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 32 MB





Gappu has a very busy weekend ahead of him. Because, next]]></description><category></category></item><item><title><![CDATA[567D One-Dimensional Battle Ships（set）]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47357131</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47357131</guid><author>Fungyow</author><pubDate>Sat, 08 Aug 2015 11:57:58 +0800</pubDate><description><![CDATA[D. One-Dimensional Battle Ships


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Alice and Bob love playing o]]></description><category></category></item><item><title><![CDATA[codeforces 567C Geometric Progression]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47340647</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47340647</guid><author>Fungyow</author><pubDate>Fri, 07 Aug 2015 15:54:56 +0800</pubDate><description><![CDATA[C. Geometric Progression


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Polycarp loves geometric progressio]]></description><category></category></item><item><title><![CDATA[HDU 5353 Average(枚举)]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47324469</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47324469</guid><author>Fungyow</author><pubDate>Thu, 06 Aug 2015 23:00:19 +0800</pubDate><description><![CDATA[Average
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 678    Accepted Submission(s): 174
Special Judge


Problem Description

There]]></description><category></category></item><item><title><![CDATA[UVA 10765 (割点)]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47255161</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47255161</guid><author>Fungyow</author><pubDate>Mon, 03 Aug 2015 13:57:41 +0800</pubDate><description><![CDATA[题意：给出一个无向图，求出鸽子值，鸽子值即是每删除一个点后有多少个连通块。
思路：求割点，与割点相连的连通分量就是割点的鸽子值，非割点的点的鸽子值均为1。


#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

vec]]></description><category></category></item><item><title><![CDATA[POJ 1144（求割点数）]]></title><link>https://blog.youkuaiyun.com/Fungyow/article/details/47209887</link><guid>https://blog.youkuaiyun.com/Fungyow/article/details/47209887</guid><author>Fungyow</author><pubDate>Sun, 02 Aug 2015 19:18:31 +0800</pubDate><description><![CDATA[Network




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 10624
 
Accepted: 4915




Description

A Telephone Line Company (TLC) is establishing a new telephone cab]]></description><category></category></item></channel></rss>