<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[KickAC的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/KickAC</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; KickAC]]></copyright><item><title><![CDATA[web 拖动]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/78288079</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/78288079</guid><author>KickAC</author><pubDate>Thu, 19 Oct 2017 18:41:49 +0800</pubDate><description><![CDATA[<!--
This is a starter template page. Use this page to start your new project from
scratch. This page gets rid of all links and provides the needed markup only.
-->


    
    
    拖动
    
    
    
 ]]></description><category></category></item><item><title><![CDATA[bootstrap如何点击按钮出弹框]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/76085101</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/76085101</guid><author>KickAC</author><pubDate>Tue, 25 Jul 2017 17:02:04 +0800</pubDate><description><![CDATA[bootstrap弹窗]]></description><category></category></item><item><title><![CDATA[网页学习|AdminLTE第一天]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/75716067</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/75716067</guid><author>KickAC</author><pubDate>Sat, 22 Jul 2017 11:59:23 +0800</pubDate><description><![CDATA[adminLTE的布局问题]]></description><category></category></item><item><title><![CDATA[动态规划 最长公共子序列]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/52902668</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/52902668</guid><author>KickAC</author><pubDate>Sun, 23 Oct 2016 16:36:00 +0800</pubDate><description><![CDATA[设有字符串a[0...n]，b[0...m]，下面就是递推公式。字符串a对应的是二维数组num的行，字符串b对应的是二维数组num的列。




//代码实现比较简单，可能有问题
   #include 
   #include 
   using namespace std;
   int main(int argc, char **argv)
   {
   	string str1]]></description><category></category></item><item><title><![CDATA[python]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51979162</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51979162</guid><author>KickAC</author><pubDate>Thu, 21 Jul 2016 08:39:59 +0800</pubDate><description><![CDATA[学习python已经几天，来记录一下小得


python可似乎讲述了很多对于我来说储存数据的类型  元组 序列 字典 


字典给我的感觉像是java里面的map，利用键值对来储存	zidian={'1':0,'2':1,'3':0,'4':1,'5':2,'6':2}
	print zidian
	for i in zidian.keys():
		if zidian[i]==0:]]></description><category></category></item><item><title><![CDATA[八皇后]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51957318</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51957318</guid><author>KickAC</author><pubDate>Tue, 19 Jul 2016 17:02:34 +0800</pubDate><description><![CDATA[八皇后问题作为最经典的深搜问题，感觉比一些找路的问题还要难一点，还有回溯的问题


#include 
#include 
#include 
#include 
using namespace std;
int n,c[26],sum;
bool isTrue(int row,int col)
{
    for(int i = 1; i < row; i++)   //从第一列往已经添加]]></description><category></category></item><item><title><![CDATA[DFS 深搜  HDU 1312]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51957108</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51957108</guid><author>KickAC</author><pubDate>Tue, 19 Jul 2016 16:33:58 +0800</pubDate><description><![CDATA[Problem Description

There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adja]]></description><category></category></item><item><title><![CDATA[POJ 1789]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51942666</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51942666</guid><author>KickAC</author><pubDate>Mon, 18 Jul 2016 15:52:23 +0800</pubDate><description><![CDATA[这个题粗略读一遍题目，恩，没懂......
然后再看......
Kruskal算法之前都用的这个算法，但是这个题要用的是prim算法，这个算法用于稠密的图来计算最短路径
这个算法感觉用起来比Kruskal算法剪短一点没有用到之间的并查集的知识




Truck History




Time Limit: 2000MS
 
Memory Limit: 65536]]></description><category></category></item><item><title><![CDATA[最短生成树]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51942126</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51942126</guid><author>KickAC</author><pubDate>Mon, 18 Jul 2016 15:04:51 +0800</pubDate><description><![CDATA[最短生成树一
POJ 1251

Description



The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the ]]></description><category></category></item><item><title><![CDATA[并查集三]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51932511</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51932511</guid><author>KickAC</author><pubDate>Sun, 17 Jul 2016 15:23:26 +0800</pubDate><description><![CDATA[并查集还有很多要学啊，第一篇文章写的并查集的初始概念然后运用在了图最少还需要修几条路，第二个题是判断图里面这些点有没有形成一个环（里面有并查集的压缩），这个题是


Background 
Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they f]]></description><category></category></item><item><title><![CDATA[HDOJ -1272]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51930761</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51930761</guid><author>KickAC</author><pubDate>Sun, 17 Jul 2016 09:31:51 +0800</pubDate><description><![CDATA[并查集]]></description><category></category></item><item><title><![CDATA[并查集想法]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51925415</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51925415</guid><author>KickAC</author><pubDate>Sat, 16 Jul 2016 17:27:11 +0800</pubDate><description><![CDATA[并查集计算


杭电1232


数组 bin[]记录了每个点的前导点是什么,并查集的用法按照输入的点对寻找点的先导根节点，由是否拥有相同的根节点判断是否是在同一个集合里面，如果不是就加入到这个集合，最后根节点是自己的就是一个集合。
#include
int bin[1002];

int findx(int x)
{
    int r=x;
    while(bin[r]!=r]]></description><category></category></item><item><title><![CDATA[动态规划三]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51917577</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51917577</guid><author>KickAC</author><pubDate>Fri, 15 Jul 2016 14:35:59 +0800</pubDate><description><![CDATA[最佳加法表达式有一个由1..9组成的数字串.问如果将m个加号插入到这个数字串中,在各种可能形成的表达式中，值最小的那个表达式的值是多少]]></description><category></category></item><item><title><![CDATA[Help Jimmy (POJ 1661)]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51917302</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51917302</guid><author>KickAC</author><pubDate>Fri, 15 Jul 2016 14:11:16 +0800</pubDate><description><![CDATA[poj 1661]]></description><category></category></item><item><title><![CDATA[动态规划 递推三角形]]></title><link>https://blog.youkuaiyun.com/KickAC/article/details/51916814</link><guid>https://blog.youkuaiyun.com/KickAC/article/details/51916814</guid><author>KickAC</author><pubDate>Fri, 15 Jul 2016 13:07:18 +0800</pubDate><description><![CDATA[动态规划可以由递归做出来这个题目，但是时间复杂度太大，所以用从下而上分析二维数组做出这个题目。#include<iostream>
#include<string>
#include<stdio.h>
#include<algorithm>int a[101][101];
int maxsum[101][101];
using namespace std;
int main()
{
    int]]></description><category></category></item></channel></rss>