<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[I am KunKun]]></title><description><![CDATA[昆昆加油~]]></description><link>https://blog.youkuaiyun.com/llkpersonal</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; llkpersonal]]></copyright><item><title><![CDATA[【mysql】Windows下强制修改root密码]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/41017071</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/41017071</guid><author>llkpersonal</author><pubDate>Tue, 11 Nov 2014 20:36:02 +0800</pubDate><description><![CDATA[Mysql版本：5.1

 



1、 首先检查mysql服务是否启动，若已启动则先将其停止服务，可在开始菜单的运行，使用命令：

net stop mysql 



 



打开第一个cmd窗口，切换到mysql的bin目录，运行命令：
mysqld --defaults-file="C:\Program Files\MySQL\MySQL Server ]]></description><category></category></item><item><title><![CDATA[[POJ 2482]Stars in Your Window 扫描线]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/39580945</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/39580945</guid><author>llkpersonal</author><pubDate>Fri, 26 Sep 2014 15:44:14 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=2482


题目大意：平面上有n个星星，]]></description><category></category></item><item><title><![CDATA[[POJ 2104]K-th Number 主席树]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/39526329</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/39526329</guid><author>llkpersonal</author><pubDate>Wed, 24 Sep 2014 18:00:51 +0800</pubDate><description><![CDATA[K-th Number




Time Limit: 20000MS
 
Memory Limit: 65536K


Total Submissions: 37883
 
Accepted: 12273


Case Time Limit: 2000MS




Description

You are working for Macrohard c]]></description><category></category></item><item><title><![CDATA[[POJ 1823] Hotel 线段树区间合并]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/39485409</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/39485409</guid><author>llkpersonal</author><pubDate>Tue, 23 Sep 2014 00:29:31 +0800</pubDate><description><![CDATA[Hotel




Time Limit: 5000MS
 
Memory Limit: 30000K


Total Submissions: 2064
 
Accepted: 885




Description

The "Informatics" hotel is one of the most luxurious hotels from Galac]]></description><category></category></item><item><title><![CDATA[LightOJ 1097 - Lucky Number [线段树二分前缀和构造数列]]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/39186617</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/39186617</guid><author>llkpersonal</author><pubDate>Wed, 10 Sep 2014 21:13:06 +0800</pubDate><description><![CDATA[1097 - Lucky Number





PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 64 MB





Lucky numbers are defined by a variation of the well-known siev]]></description><category></category></item><item><title><![CDATA[LightOJ 1087 - Diablo[线段树二分前缀和]]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/39165397</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/39165397</guid><author>llkpersonal</author><pubDate>Wed, 10 Sep 2014 00:08:04 +0800</pubDate><description><![CDATA[1087 - Diablo





PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 64 MB





All of you must have played the game 'Diablo'. It's an exclusive game]]></description><category></category></item><item><title><![CDATA[1266 - Points in Rectangle[二维树状数组 + 容斥原理]]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/39015135</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/39015135</guid><author>llkpersonal</author><pubDate>Wed, 03 Sep 2014 00:07:24 +0800</pubDate><description><![CDATA[1266 - Points in Rectangle





PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 32 MB





As the name says, this problem is about finding the numb]]></description><category></category></item><item><title><![CDATA[1085 - All Possible Increasing Subsequences[树状数组]]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/38987161</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/38987161</guid><author>llkpersonal</author><pubDate>Mon, 01 Sep 2014 22:23:33 +0800</pubDate><description><![CDATA[1085 - All Possible Increasing Subsequences





PDF (English)
Statistics
Forum








Time Limit: 3 second(s)
Memory Limit: 64 MB





An increasing subsequence from a sequen]]></description><category></category></item><item><title><![CDATA[1080 - Binary Simulation[树状数组]]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/38986915</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/38986915</guid><author>llkpersonal</author><pubDate>Mon, 01 Sep 2014 22:12:07 +0800</pubDate><description><![CDATA[1080 - Binary Simulation





PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 64 MB





Given a binary number, we are about to do some operations ]]></description><category></category></item><item><title><![CDATA[今天不刷题]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/38949937</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/38949937</guid><author>llkpersonal</author><pubDate>Sat, 30 Aug 2014 23:30:10 +0800</pubDate><description><![CDATA[如题，今天不刷题。
今天感觉到有点累，早上从飞机]]></description><category></category></item><item><title><![CDATA[1011 - Marriage Ceremonies[状态压缩dp]]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/38931459</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/38931459</guid><author>llkpersonal</author><pubDate>Fri, 29 Aug 2014 22:15:39 +0800</pubDate><description><![CDATA[1011 - Marriage Ceremonies





PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 32 MB





You work in a company which organizes marriages. Marriag]]></description><category></category></item><item><title><![CDATA[USACO 2002 February]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/38929931</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/38929931</guid><author>llkpersonal</author><pubDate>Fri, 29 Aug 2014 20:32:14 +0800</pubDate><description><![CDATA[今天刷了刷USACO 2002 February，从年份上看题目已经很老了。。可是我还是刷不动。。。


只能说是自己太弱了   还是需要多加练习才是啊。


今天只做了三道题。。其中有一道题是刚才补得。。学习了一下树形dp。。实在是惭愧的很。。


POJ 1949 - Chores（这是我做的这套题里的第一道题目）
题目大意：给你N个任务，这些任务是可以并行开始的，但是部分]]></description><category></category></item><item><title><![CDATA[1005 - Rooks [组合数学]]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/38906407</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/38906407</guid><author>llkpersonal</author><pubDate>Thu, 28 Aug 2014 22:39:26 +0800</pubDate><description><![CDATA[1005 - Rooks





PDF (English)
Statistics
Forum








Time Limit: 1 second(s)
Memory Limit: 32 MB





A rook is a piece used in the game of chess which is played on a board]]></description><category></category></item><item><title><![CDATA[[ACM]5/28/2014 HDU-1203[dp]]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/27395853</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/27395853</guid><author>llkpersonal</author><pubDate>Wed, 28 May 2014 23:10:18 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1203


题目大意：给你]]></description><category></category></item><item><title><![CDATA[Codeforces Round #197]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/10441217</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/10441217</guid><author>llkpersonal</author><pubDate>Wed, 28 Aug 2013 13:32:21 +0800</pubDate><description><![CDATA[A题  数字排序
把输入的字符串里的数字挑出来,从小到大排序,每两个数字中间加一个加号就好
import java.util.*;

public class Main{
	public static void main(String[] args){
		String s;
		Scanner cin = new Scanner(System.in);
		List ls = new Arr]]></description><category></category></item><item><title><![CDATA[HDU 1005 Number Sequence 找循环位置]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/10305063</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/10305063</guid><author>llkpersonal</author><pubDate>Sun, 25 Aug 2013 17:18:50 +0800</pubDate><description><![CDATA[找个循环位置出来  然后取余就好


import java.io.*;
import java.util.*;

public class Main{
    public static void main(String[] args) throws IOException{
        StreamTokenizer cin = new StreamTokenizer( new Bu]]></description><category></category></item><item><title><![CDATA[HDU 1004 Let the Balloon Rise Map的应用]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/10305019</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/10305019</guid><author>llkpersonal</author><pubDate>Sun, 25 Aug 2013 17:17:22 +0800</pubDate><description><![CDATA[对于Map的应用  水题


import java.io.*;
import java.util.*;

public class Main{
    public static void main(String[] args) throws IOException{
        StreamTokenizer cin = new StreamTokenizer( new Buffer]]></description><category></category></item><item><title><![CDATA[HDU 1003 Max Sum 动态规划]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/10304909</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/10304909</guid><author>llkpersonal</author><pubDate>Sun, 25 Aug 2013 17:15:40 +0800</pubDate><description><![CDATA[动态规划也可以不记录结果到数组中import java.io.*;

public class Main{
    public static void main(String[] args) throws IOException{
        StreamTokenizer cin = new StreamTokenizer( new BufferedReader( new InputStr]]></description><category></category></item><item><title><![CDATA[HDU 1002 A+B Problem II 大数相加]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/10304799</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/10304799</guid><author>llkpersonal</author><pubDate>Sun, 25 Aug 2013 17:13:49 +0800</pubDate><description><![CDATA[java里的BigInteger。。还是很好用的


import java.io.*;
import java.util.*;
import java.math.*;

public class Main{
    public static void main(String[] args) throws IOException{
        BufferedReader cin = ]]></description><category></category></item><item><title><![CDATA[Codeforces 5C  Longest Regular Bracket Sequence dp+stack]]></title><link>https://blog.youkuaiyun.com/llkpersonal/article/details/10154521</link><guid>https://blog.youkuaiyun.com/llkpersonal/article/details/10154521</guid><author>llkpersonal</author><pubDate>Wed, 21 Aug 2013 17:05:39 +0800</pubDate><description><![CDATA[原来dp这个东西的前一个下标还可以用栈来记录啊。。我土了- -


#include 
#include 
#include 
#include 
using namespace std;

int dp[1001000];
string s;
stack st;

int main()
{
	cin >> s;
	int len=s.size();
	for(int i=0;i<len;i]]></description><category></category></item></channel></rss>