<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[mitic的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/mitic</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mitic]]></copyright><item><title><![CDATA[Linux学习]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/50575789</link><guid>https://blog.youkuaiyun.com/mitic/article/details/50575789</guid><author>mitic</author><pubDate>Sun, 24 Jan 2016 22:41:09 +0800</pubDate><description><![CDATA[ubuntu 打开终端终端快捷键Ctrl+Alt+T初始超级用户，密码sudo passwd root然后输入密码命令：cd [目录] 进入目录ls 查看目录及文件clear 清屏（翻过所有显示内容）reset 更新终端（清除整屏内容）mkdir [文件夹名] 创建文件夹touch [文件名] 创建文件c语言编译命令：gcc text.c -o text (将text.c文件编译成可执行文件tex...]]></description><category></category></item><item><title><![CDATA[HDU 5459 Jesus Is Here]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48576931</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48576931</guid><author>mitic</author><pubDate>Sat, 19 Sep 2015 17:56:00 +0800</pubDate><description><![CDATA[HDU 5459 Jesus Is Here]]></description><category></category></item><item><title><![CDATA[HDU 5452 Minimum Cut]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48576925</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48576925</guid><author>mitic</author><pubDate>Sat, 19 Sep 2015 17:54:37 +0800</pubDate><description><![CDATA[HDU 5452 Minimum Cut
/**
HDU 5452 Minimum Cut
http://acm.hdu.edu.cn/showproblem.php?pid=5452
*/

#include
#include
#include
#include
#include
#include
using namespace std;
#define maxn 200005
int trd]]></description><category></category></item><item><title><![CDATA[HDU 5455 Fang Fang]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48576919</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48576919</guid><author>mitic</author><pubDate>Sat, 19 Sep 2015 17:53:34 +0800</pubDate><description><![CDATA[HDU 5455 Fang Fang
/**
http://acm.hdu.edu.cn/showproblem.php?pid=5455
HDU 5455 Fang Fang
*/

#include
#include
#include
#include
#include
#include

using namespace std;
char s[1000005];
int ok(string]]></description><category></category></item><item><title><![CDATA[HDU 5437 Alisha’s Party]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48438373</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48438373</guid><author>mitic</author><pubDate>Mon, 14 Sep 2015 14:00:32 +0800</pubDate><description><![CDATA[HDU 5437 Alisha’s Party
优先级队列
#include
#include
#include
#include
#include
#include
#define maxn 150005
#define INF 0xfffff
using namespace std;
int name[maxn][205];
struct node{
    int ord,val;
  ]]></description><category></category></item><item><title><![CDATA[HDU 5441 Travel]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48438285</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48438285</guid><author>mitic</author><pubDate>Mon, 14 Sep 2015 13:54:26 +0800</pubDate><description><![CDATA[HDU 5441 Travel
#include
#include
#include
#include
#include
#include
#include
#define maxn 100005
#define INF 0x3fffffff
#define ll __int64
#define mod 10000007
#define N 20005
#define M 100005
usin]]></description><category></category></item><item><title><![CDATA[HDU 5438 Ponds]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48438115</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48438115</guid><author>mitic</author><pubDate>Mon, 14 Sep 2015 13:42:22 +0800</pubDate><description><![CDATA[HDU 5438 Ponds
#include
#include
#include
#include
#include
#include
#define maxn 10005
#define INF 0x3fffffff
#define ll __int64
using namespace std;
int du[maxn];//存储每个点的入度
int s[maxn]; //并查集根的存储
l]]></description><category></category></item><item><title><![CDATA[POJ 2886 Who Gets the Most Candies?]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48260627</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48260627</guid><author>mitic</author><pubDate>Mon, 07 Sep 2015 07:26:43 +0800</pubDate><description><![CDATA[Who Gets the Most Candies?
题意：
一群小伙伴围成一圈按照1-n编号，给出一个k首先让k-th出圈，接下来给出1-n个人的名字和接下来这些人让从ta数第几个人出队，（正的顺时针，负的逆时针）
F（p）为p的因子个数，求第p个人使得F(p)最大，多个向同时选择p最小。
思路：
用素数筛的方式预处理f[]数组，得出500000以内的35个反素数p[]，（反素数满足条]]></description><category></category></item><item><title><![CDATA[HDU 5237 Base64]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48224701</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48224701</guid><author>mitic</author><pubDate>Sat, 05 Sep 2015 13:39:32 +0800</pubDate><description><![CDATA[HDU 5237 Base64
/**
HDU 5237 Base64
*/
#include
#include
#include
#include
#include
#include
#include
#define maxn 3005
#define INF 0x3fffffff
#define ll __int64
using namespace std;
ch]]></description><category></category></item><item><title><![CDATA[HDU 5245 Joyful]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48224339</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48224339</guid><author>mitic</author><pubDate>Sat, 05 Sep 2015 12:47:02 +0800</pubDate><description><![CDATA[HDU 5245 Joyful
/**
HDU 5245 Joyful
*/
#include
#include
#include
#include
#include
#include
#define maxn 3005
#define INF 0x3fffffff
#define ll __int64
using namespace std;
int main(){
    ll T,ii=1]]></description><category></category></item><item><title><![CDATA[HDU 5242 Game]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48211729</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48211729</guid><author>mitic</author><pubDate>Fri, 04 Sep 2015 18:58:56 +0800</pubDate><description><![CDATA[HDU 5242 Game#include
#include
#include
#include
#include
#define maxn 100005
#define ll __int64
#define INF 0x3fffffff
using namespace std;
ll b[maxn];
vector V[maxn];
ll val[maxn];
ll a[maxn];
ll c[]]></description><category></category></item><item><title><![CDATA[HDU 5241 Friends]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48211701</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48211701</guid><author>mitic</author><pubDate>Fri, 04 Sep 2015 18:56:07 +0800</pubDate><description><![CDATA[HDU 5241 Friends
#include
#include
#include
#include
#include
#define maxn 3005
#define INF 0x3fffffff
using namespace std;
int a[3005][5000];
int len[3005];
void Init(){
    len[0]=1;
    a[0][0]=1;]]></description><category></category></item><item><title><![CDATA[HDU 5240 Exam]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48211659</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48211659</guid><author>mitic</author><pubDate>Fri, 04 Sep 2015 18:51:51 +0800</pubDate><description><![CDATA[HDU 5240 Exam
#include
#include
#include
#include
#include
#include
#include
#define maxn 1001005
#define INF 0xfffffff
#define ll long long
using namespace std;
struct node{
    int r,s,cost;
}p[max]]></description><category></category></item><item><title><![CDATA[hihoCoder挑战赛14 B 赛车]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48196687</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48196687</guid><author>mitic</author><pubDate>Thu, 03 Sep 2015 18:56:15 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#define maxn 100005
#define INF 0x3fffffff
using namespace std;
vector h[maxn];
int son[maxn];
int n,ans;
int dfs(int u,int pre){
    int fir=0,sec=0;
    ]]></description><category></category></item><item><title><![CDATA[hihoCoder挑战赛14 A 不等式]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48196683</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48196683</guid><author>mitic</author><pubDate>Thu, 03 Sep 2015 18:54:27 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#define maxn 100005
#define INF 0xfffffff
using namespace std;
string fu,x;
int n;
int flag[100];
double c[100];
double co[200];
int fun(double num){
    i]]></description><category></category></item><item><title><![CDATA[HDU 5095 Linearization of the kernel functions in SVM]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48196655</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48196655</guid><author>mitic</author><pubDate>Thu, 03 Sep 2015 18:50:38 +0800</pubDate><description><![CDATA[HDU 5095 Linearization of the kernel functions in SVM
#include
#include
using namespace std;
char ch[]="pqruvwxyzj";
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int flag=0,a;
 ]]></description><category></category></item><item><title><![CDATA[HDU 5092 Seam Carving]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48196625</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48196625</guid><author>mitic</author><pubDate>Thu, 03 Sep 2015 18:44:20 +0800</pubDate><description><![CDATA[HDU 5092 Seam Carving


/**
动态规划（数塔问题）
*/
#include
#include
#include
#include
#include
#define maxn 1005
#define INF 0x3fffffff
using namespace std;
int mp[maxn][maxn];
int path[maxn][maxn];
int in]]></description><category></category></item><item><title><![CDATA[HDU 5090 Game with Pearls]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/48196603</link><guid>https://blog.youkuaiyun.com/mitic/article/details/48196603</guid><author>mitic</author><pubDate>Thu, 03 Sep 2015 18:39:50 +0800</pubDate><description><![CDATA[HDU 5090 Game with Pearls
#include
#include
#include
#include
#include
#define maxn 1005
#define INF 0x3fffffff
using namespace std;
int a[maxn];
bool b[maxn];
int main(){
    int T;]]></description><category></category></item><item><title><![CDATA[HDU 5402 Travelling Salesman Problem]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/47783033</link><guid>https://blog.youkuaiyun.com/mitic/article/details/47783033</guid><author>mitic</author><pubDate>Wed, 19 Aug 2015 16:46:16 +0800</pubDate><description><![CDATA[HDU 5402 Travelling Salesman Problem
/**
HDU 5402 Travelling Salesman Problem
如果行列有一个是奇数，一定可以通过蛇形路径走完全程
否则，将所有位置黑白染色，有一个白色位置的路径无法走到找出最小的
白色路径，构造方式是不走这个路径就可以了
*/

#include
#include
#include
#include
u]]></description><category></category></item><item><title><![CDATA[HDU 5400 Arithmetic Sequence]]></title><link>https://blog.youkuaiyun.com/mitic/article/details/47779101</link><guid>https://blog.youkuaiyun.com/mitic/article/details/47779101</guid><author>mitic</author><pubDate>Wed, 19 Aug 2015 13:09:59 +0800</pubDate><description><![CDATA[HDU 5400 Arithmetic Sequence
/**
HDU 5400 Arithmetic Sequence
直接预处理求解就好了
预处理找出以a[i]结尾最长的subArr长度（满足条件的）
*/

#include
#include
#include
#include
#define maxn 100005
#define ll __int64
using namespace ]]></description><category></category></item></channel></rss>