<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[2cm的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/miao_2cm</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; miao_2cm]]></copyright><item><title><![CDATA[在Mac下配置wxWidgets环境]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/79735675</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/79735675</guid><author>miao_2cm</author><pubDate>Wed, 28 Mar 2018 22:54:40 +0800</pubDate><description><![CDATA[下载源码

到官网下载相关源码



安装编译环境

为了编译wxWidgets，需要安装GTK（wxWidgets依赖）、cmake



安装GTK

1、安装Command Line Tool：xcode-select–install 
    （如果安装过Xcode，可以忽略这一步) 
2、安装Homebrew 
    使用Ruby脚本安装，Mac自带Ruby，因此直接执行指令：

ru...]]></description><category></category></item><item><title><![CDATA[HDU 4763 Theme Section（kmp）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52291660</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52291660</guid><author>miao_2cm</author><pubDate>Tue, 23 Aug 2016 15:54:10 +0800</pubDate><description><![CDATA[Time Limit:1000MS     Memory Limit:32768KBDescription 
It’s time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative s]]></description><category></category></item><item><title><![CDATA[Manacher算法]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52269533</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52269533</guid><author>miao_2cm</author><pubDate>Sun, 21 Aug 2016 21:17:10 +0800</pubDate><description><![CDATA[Manacher算法是专门用来处理回文的一种算法，其主要的作用是找出一个字符串里面最长的一个回文。要用到这个算法，首先要做的就是改变原来的字符串，就是在原有的字符串中，每两个字母之间都插入一个字符串里面没有的符号。比如：如果这个字符串是由26位字母组成的，那么就在第一个字母前和最后一个字母的后面以及每两个中间都插入一个#。举个栗子：s[]=”aaaaa”，那么这个字符串就改成：s[]=”#a#a#a]]></description><category></category></item><item><title><![CDATA[HDU 3068 最长回文（Manacher算法）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52269191</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52269191</guid><author>miao_2cm</author><pubDate>Sun, 21 Aug 2016 20:21:35 +0800</pubDate><description><![CDATA[Time Limit:2000MS     Memory Limit:32768KBDescription 
给出一个只由小写英文字符a,b,c…y,z组成的字符串S,求S中最长回文串的长度.  
回文就是正反读都是一样的字符串,如aba, abba等Input 
输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c…y,z组成的字符串S  
两组case之间由空行隔开(该空行不]]></description><category></category></item><item><title><![CDATA[HDU 5858 Hard problem（求角度的模板）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52261692</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52261692</guid><author>miao_2cm</author><pubDate>Sat, 20 Aug 2016 15:33:50 +0800</pubDate><description><![CDATA[Time Limit: 2000/1000 MS (Java/Others) 
Memory Limit: 65536/65536 K (Java/Others)Problem Description 
cjj is fun with math problem. One day he found a Olympic Mathematics problem for primary school stu]]></description><category></category></item><item><title><![CDATA[HDU 3374 String Problem（最大最小表示法+kmp）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52231922</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52231922</guid><author>miao_2cm</author><pubDate>Wed, 17 Aug 2016 16:11:11 +0800</pubDate><description><![CDATA[Time Limit:1000MS     Memory Limit:32768KBDescription 
Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven s]]></description><category></category></item><item><title><![CDATA[HDU 4300 Clairewd’s message（kmp）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52217843</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52217843</guid><author>miao_2cm</author><pubDate>Tue, 16 Aug 2016 10:38:23 +0800</pubDate><description><![CDATA[Time Limit:1000MS     Memory Limit:32768KBDescription 
Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing for sending it]]></description><category></category></item><item><title><![CDATA[HDU 2594 Simpsons’ Hidden Talents（kmp）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52214075</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52214075</guid><author>miao_2cm</author><pubDate>Mon, 15 Aug 2016 19:42:40 +0800</pubDate><description><![CDATA[Time Limit:1000MS     Memory Limit:32768KBDescription 
Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.  
Marge: Yeah, what is it?  
Homer: Take me for ex]]></description><category></category></item><item><title><![CDATA[POJ 3080 Blue Jeans（暴力枚举+kmp）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52210714</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52210714</guid><author>miao_2cm</author><pubDate>Mon, 15 Aug 2016 14:11:12 +0800</pubDate><description><![CDATA[Time Limit: 1000MS      Memory Limit: 65536KDescription 
The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousan]]></description><category></category></item><item><title><![CDATA[Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset（字典树模板）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52201693</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52201693</guid><author>miao_2cm</author><pubDate>Sat, 13 Aug 2016 21:17:07 +0800</pubDate><description><![CDATA[这里戳题目题意：首先给你一个集合，这个集合里面一开始只有零（一开始是有零的，别用个空的集合，并且这个集合允许有重复的值），然后有三种操作，如果输入时加号，就往这个集合新增一个数字，如果是减号，就把减号后的那个数字从集合里面去掉，如果是问号，就从集合里面找一个数，这个数字和问号后面的数字异或的结果是最大的。异或：意思是说有两个数字，如果不是二进制，就转化成二进制，然后两两比较，相同为零，不同为一，再转]]></description><category></category></item><item><title><![CDATA[Codeforces Round #367 (Div. 2) C. Hard problem（dp）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52194745</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52194745</guid><author>miao_2cm</author><pubDate>Fri, 12 Aug 2016 19:43:52 +0800</pubDate><description><![CDATA[time limit per test1 second 
memory limit per test256 megabytesVasiliy is fond of solving different tasks. Today he found one he wasn’t able to solve himself, so he asks you to help.Vasiliy is given n]]></description><category></category></item><item><title><![CDATA[Codeforces Round #339 (Div. 2) D. Skills（模拟+枚举）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52173406</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52173406</guid><author>miao_2cm</author><pubDate>Wed, 10 Aug 2016 16:22:27 +0800</pubDate><description><![CDATA[time limit per test2 seconds 
memory limit per test256 megabytesLesha plays the recently published new version of the legendary game hacknet. In this version character skill mechanism was introduced. N]]></description><category></category></item><item><title><![CDATA[HDU 5802 Windows 10（dfs）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52130523</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52130523</guid><author>miao_2cm</author><pubDate>Fri, 05 Aug 2016 16:39:27 +0800</pubDate><description><![CDATA[题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=5802题目意思是说，要调整音量，把音量从P调到Q。然后调整音量的规则是，如果是向上调整音量，每秒可以调整1dB，但是如果是向下调整音量，就可以从1开始，如果这次调整的音量是X，那下一次就可以调整2*XdB的音量，但是如果你停顿了，或者向上调整音量，再向下调整，那么就又要从1开始调整音量了。这道题按照题解]]></description><category></category></item><item><title><![CDATA[HDU 5793 A Boring Question（快速幂+求逆元）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52122041</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52122041</guid><author>miao_2cm</author><pubDate>Thu, 04 Aug 2016 19:08:57 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5793这道题就是给你一个公式，然后再给数据范围给你，然后求答案。这道题的公式推到最后就是一个等比数列的求和公式，也就是说，输入n和m，然后从m的0次方一直加到n次方的和就是答案。但是由于这道题的数据太大了，有1e9，所以我们不可能用for循环一直加到最后，所以根据公式，我们需要用到快速幂来求m^n。用快速]]></description><category></category></item><item><title><![CDATA[HDU 5792 World is Exploding（树状数组）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52117625</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52117625</guid><author>miao_2cm</author><pubDate>Thu, 04 Aug 2016 11:25:27 +0800</pubDate><description><![CDATA[Time Limit: 2000/1000 MS (Java/Others) 
 Memory Limit: 65536/65536 K (Java/Others)Problem Description 
Given a sequence A with length n,count how many quadruple (a,b,c,d) satisfies: a≠b≠c≠d,1≤a< b≤n, 1]]></description><category></category></item><item><title><![CDATA[HDU 5775 Bubble Sort（冒泡排序的位置变换）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52068601</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52068601</guid><author>miao_2cm</author><pubDate>Fri, 29 Jul 2016 21:01:02 +0800</pubDate><description><![CDATA[Time Limit: 2000/1000 MS (Java/Others) 
Memory Limit: 65536/65536 K (Java/Others)Problem Description 
P is a permutation of the integers from 1 to N(index starting from 1). 
Here is the code of Bubble]]></description><category></category></item><item><title><![CDATA[HDU 5773 The All-purpose Zero（最长上升子序列）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52068152</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52068152</guid><author>miao_2cm</author><pubDate>Fri, 29 Jul 2016 19:52:20 +0800</pubDate><description><![CDATA[Problem Description 
?? gets an sequence S with n intergers(0 < n <= 100000,0<= S[i] <= 1000000).?? has a magic so that he can change 0 to any interger(He does not need to change all 0 to the same inte]]></description><category></category></item><item><title><![CDATA[HDU 5256 序列变换（最长上升子序列）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52065674</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52065674</guid><author>miao_2cm</author><pubDate>Fri, 29 Jul 2016 15:46:57 +0800</pubDate><description><![CDATA[Problem Description 
我们有一个数列A1,A2…An，你现在要求修改数量最少的元素，使得这个数列严格递增。其中无论是修改前还是修改后，每个元素都必须是整数。 
请输出最少需要修改多少个元素。Input 
第一行输入一个T(1≤T≤10)，表示有多少组数据每一组数据：第一行输入一个N(1≤N≤105)，表示数列的长度第二行输入N个数A1,A2,…,An。每一个数列中的元素都是正整数]]></description><category></category></item><item><title><![CDATA[HDU 1527 取石子游戏（威佐夫博弈）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52049818</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52049818</guid><author>miao_2cm</author><pubDate>Wed, 27 Jul 2016 21:50:51 +0800</pubDate><description><![CDATA[Time Limit: 2000/1000 MS (Java/Others) 
 Memory Limit: 65536/32768 K (Java/Others)Problem Description 
有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜]]></description><category></category></item><item><title><![CDATA[HDU 2188 悼念512汶川大地震遇难同胞——选拔志愿者（巴什博奕）]]></title><link>https://blog.youkuaiyun.com/miao_2cm/article/details/52049236</link><guid>https://blog.youkuaiyun.com/miao_2cm/article/details/52049236</guid><author>miao_2cm</author><pubDate>Wed, 27 Jul 2016 20:38:07 +0800</pubDate><description><![CDATA[Time Limit: 1000/1000 MS (Java/Others) 
 Memory Limit: 32768/32768 K (Java/Others)Problem Description 
对于四川同胞遭受的灾难，全国人民纷纷伸出援助之手，几乎每个省市都派出了大量的救援人员，这其中包括抢险救灾的武警部队，治疗和防疫的医护人员，以及进行心理疏导的心理学专家。根据要求，我校也有一个奔赴灾]]></description><category></category></item></channel></rss>