<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[芒果街上的小屋（此博客暂时停用）]]></title><description><![CDATA[温故而知新，可以为师矣。]]></description><link>https://blog.csdn.net/cacyth</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; cacyth]]></copyright><item><title><![CDATA[linux 解决.../bin/ld: cannot find -lxxx 问题+Segmentation fault (core dumped)]]></title><link>https://blog.csdn.net/cacyth/article/details/102845155</link><guid>https://blog.csdn.net/cacyth/article/details/102845155</guid><author>cacyth</author><pubDate>Wed, 01 Apr 2020 20:23:18 +0800</pubDate><description><![CDATA[(注意！在jupyer内直接!export PATH是无效的，应该是%env PATH)

我的报错情况是这样的：


wangjiana@dcd137:~/2018-daguan-competition/biGruModel/glove$ make
mkdir -p build
gcc src/glove.c -o build/glove -lm -pthread -Ofast -march=n...]]></description><category></category></item><item><title><![CDATA[pycharm 配置setting 以及导入和保存]]></title><link>https://blog.csdn.net/cacyth/article/details/85038927</link><guid>https://blog.csdn.net/cacyth/article/details/85038927</guid><author>cacyth</author><pubDate>Wed, 01 Apr 2020 20:21:31 +0800</pubDate><description><![CDATA[【pycharm 去掉“自动保存功能”】

pycharm默认是自动保存的，习惯自己按 ctrl + s 的可以进行如下设置：

菜单File -&amp;gt; Settings... -&amp;gt; Appearance &amp;amp; Behavior -&amp;gt; System Settings

去掉以下2个选项的选中

Synchronize files on frame activation

S...]]></description><category></category></item><item><title><![CDATA[iterm2个性界面设置]]></title><link>https://blog.csdn.net/cacyth/article/details/82053321</link><guid>https://blog.csdn.net/cacyth/article/details/82053321</guid><author>cacyth</author><pubDate>Wed, 01 Apr 2020 20:16:25 +0800</pubDate><description><![CDATA[安装好之后：





调整transparency和style

item2光标形状设置：https://blog.csdn.net/diyxiaoshitou/article/details/51774820

自动填充：⌘ + ； 命令补全提示

如何在OS X iTerm2中愉快地使用“⌥ ←”及“⌥→ ”快捷键跳过单词？https://blog.csdn.net/Yaokai_Assu...]]></description><category></category></item><item><title><![CDATA[【codechef】每次将l-r修剪成一样高度，求最少修剪几次]]></title><link>https://blog.csdn.net/cacyth/article/details/79915304</link><guid>https://blog.csdn.net/cacyth/article/details/79915304</guid><author>cacyth</author><pubDate>Wed, 18 Apr 2018 14:38:05 +0800</pubDate><description><![CDATA[Example Input
4
3
3 1 3
2 1 2
7
1 3 4 5 1 2 3
1 2 1 2 1 1 1
3
2 3 9
2 3 9
2
1 2
2 1
Example Output
2
3
0
-1这题一看和涂色问题很像。但后来我发现两者是有区别的。涂色可以任意覆盖，而修剪只能越剪越短，不可能再变长。并且数据范围有10^5，肯定不是像涂色问题一样用区间dp。所以我后来用双端队列来维...]]></description><category></category></item><item><title><![CDATA[HUST - 1616 给出字符串，求[l,r]内最大的子序列的hash值]]></title><link>https://blog.csdn.net/cacyth/article/details/68953463</link><guid>https://blog.csdn.net/cacyth/article/details/68953463</guid><author>cacyth</author><pubDate>Sun, 02 Apr 2017 19:03:17 +0800</pubDate><description><![CDATA[You've got string S and m queries. Each query asks you to calculate the hash value for the lexicographically maximum subsequence of substring S[l….r]. 
We'll call a non-empty string S[ p1p2...  pk] =]]></description><category></category></item><item><title><![CDATA[HUST - 1608 求带权有向图上的最长路]]></title><link>https://blog.csdn.net/cacyth/article/details/68953444</link><guid>https://blog.csdn.net/cacyth/article/details/68953444</guid><author>cacyth</author><pubDate>Sun, 02 Apr 2017 18:59:37 +0800</pubDate><description><![CDATA[If you have a date with a pretty girl in a hurry, you can ignore what I will say next. 
  
Hellis is a little bad guy in Rural Small Technical College. And the most important fact is that he is espe]]></description><category></category></item><item><title><![CDATA[CF432D 求等于原串前缀的后缀子串，输出子串的长度和出现次数]]></title><link>https://blog.csdn.net/cacyth/article/details/64281693</link><guid>https://blog.csdn.net/cacyth/article/details/64281693</guid><author>cacyth</author><pubDate>Tue, 21 Mar 2017 01:57:35 +0800</pubDate><description><![CDATA[给一个字符串，求等于原串前缀的后缀子串，输出子串的长度和出现次数。

再普及一下后缀数组的height：http://www.mamicode.com/info-detail-1068381.html
#include
#define ll long long
#define inf 0x7fffffff
#define mod 1000000007
using namespace std;]]></description><category></category></item><item><title><![CDATA[CF176B 求经过K步使a串变成b串的方法]]></title><link>https://blog.csdn.net/cacyth/article/details/60880319</link><guid>https://blog.csdn.net/cacyth/article/details/60880319</guid><author>cacyth</author><pubDate>Wed, 08 Mar 2017 19:53:31 +0800</pubDate><description><![CDATA[http://codeforces.com/problemset/problem/176/B

这题比赛的时候角度完全想错了。。。当时我的想法是转化成：“n+p*len=m个(1到len-1)的数相加"的方法数，p是圈数，复杂度10^8。
真的想不到这个dp方法。搬运其他大佬的解法：


1.首先原串（即以0号字母开头的）个数为1，其他种类串为0。

2.第一次变化之后，原串个数即]]></description><category></category></item><item><title><![CDATA[【PAT】有细节坑点的题+输出技巧题]]></title><link>https://blog.csdn.net/cacyth/article/details/52099109</link><guid>https://blog.csdn.net/cacyth/article/details/52099109</guid><author>cacyth</author><pubDate>Tue, 02 Aug 2016 23:26:18 +0800</pubDate><description><![CDATA[https://www.patest.cn/contests/pat-a-practise/1053

#include 
using namespace std;  
int x[105];
vector v[105];
int n,m,k,g,h,a;
int path[105];
int root[105];
int leaf[105];
void dfs(int p,int s,int]]></description><category></category></item><item><title><![CDATA[【PAT】Dijkstra+最短路径种数（★）+输出路径+卡内存]]></title><link>https://blog.csdn.net/cacyth/article/details/52097208</link><guid>https://blog.csdn.net/cacyth/article/details/52097208</guid><author>cacyth</author><pubDate>Tue, 02 Aug 2016 21:52:27 +0800</pubDate><description><![CDATA[在求最短路径种数的时候，是这样写的：
#include 
using namespace std;  
int n,m,ed,a;
string st,z,y;
map r;
struct node{
	string a;
	int b;	
}x[205];
int w[205][205];
int path[205];
int num[205];
int happy[205];
int cos]]></description><category></category></item><item><title><![CDATA[【PAT】卡时专题]]></title><link>https://blog.csdn.net/cacyth/article/details/52080155</link><guid>https://blog.csdn.net/cacyth/article/details/52080155</guid><author>cacyth</author><pubDate>Sun, 31 Jul 2016 20:00:00 +0800</pubDate><description><![CDATA[https://www.patest.cn/contests/pat-a-practise/1055
N=10^5，询问有10^3个，肯定超。并且每个询问都要按序输出前100个值，排序策略不当（区间内的值全部sort再取前k个）更加超。想办法降复杂度。
方法①（由年龄最多200种的约束）：先对N个人按年龄划分，每个年龄的人各自排序。对于每个询问for(100次)，每次找前第i个值时都for一遍]]></description><category></category></item><item><title><![CDATA[【计算机网络】缩写汇总]]></title><link>https://blog.csdn.net/cacyth/article/details/52078473</link><guid>https://blog.csdn.net/cacyth/article/details/52078473</guid><author>cacyth</author><pubDate>Sun, 31 Jul 2016 14:33:58 +0800</pubDate><description><![CDATA[A
ACK (ACKnowledgement) 确认
ADSL (Asymmetric Digital Subscriber Line) 非对称数字用户线
AES (Advanced Encryption Standard) 先进的加密标准
AF PHB (Assured Forwarding PerHop Behavior) 确保转发每跳行为
AH (Authntication Hea]]></description><category></category></item><item><title><![CDATA[链表去重（强行用map水过）]]></title><link>https://blog.csdn.net/cacyth/article/details/51920743</link><guid>https://blog.csdn.net/cacyth/article/details/51920743</guid><author>cacyth</author><pubDate>Fri, 15 Jul 2016 20:23:29 +0800</pubDate><description><![CDATA[L2-002. 链表去重



时间限制

300 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

陈越




给定一个带整数键值的单链表L，本题要求你编写程序，删除那些键值的绝对值有重复的结点。即对任意键值K，只有键值或其绝对值等于K的第]]></description><category></category></item><item><title><![CDATA[【大数除法模板】判断能否整除+求整除后的商]]></title><link>https://blog.csdn.net/cacyth/article/details/51816167</link><guid>https://blog.csdn.net/cacyth/article/details/51816167</guid><author>cacyth</author><pubDate>Sun, 03 Jul 2016 17:57:51 +0800</pubDate><description><![CDATA[//数组是先存高位再往低位存的，如1011，a[0]=1,a[1]=0,a[2]=1,a[3]=1;
//a[]是被除数，n是除数
int divide(char a[],int l)
{
   int q,p=0;
   q=a[p++];
   while(p<l)                               // l是数的位数
   {
         while(q<n)]]></description><category></category></item><item><title><![CDATA[概率之放球]]></title><link>https://blog.csdn.net/cacyth/article/details/51736943</link><guid>https://blog.csdn.net/cacyth/article/details/51736943</guid><author>cacyth</author><pubDate>Wed, 22 Jun 2016 20:56:50 +0800</pubDate><description><![CDATA[【n个不同的球放入m个不同的盒子】

要求每个盒子至少放一个球，每个球都必须放进盒子
例：100个不同的球放进10个不同的盒子的放法数=
也就是容斥原理
【m个相同的球放入n个不同的盒子】

C(m+n-1,n).]]></description><category></category></item><item><title><![CDATA[CF116D 一开始往右扫，每换下一行要换方向扫，问扫完草至少经过的步数]]></title><link>https://blog.csdn.net/cacyth/article/details/51212712</link><guid>https://blog.csdn.net/cacyth/article/details/51212712</guid><author>cacyth</author><pubDate>Thu, 21 Apr 2016 20:36:58 +0800</pubDate><description><![CDATA[草是'W'。难点是很容易漏情况。



input
4 5
GWGGW
GGWGG
GWGGG
WGGGG




output
11



#include
#include
#include
#include//int dx[4]={0,0,-1,1};int dy[4]={-1,1,0,0};
#include//int gcd(int a,int b){retu]]></description><category></category></item><item><title><![CDATA[【欧拉函数】集合]]></title><link>https://blog.csdn.net/cacyth/article/details/51182867</link><guid>https://blog.csdn.net/cacyth/article/details/51182867</guid><author>cacyth</author><pubDate>Mon, 18 Apr 2016 22:11:47 +0800</pubDate><description><![CDATA[给一个正整数，其中，求使得为质数的的个数，。
其实挺难看出这题要用欧拉定理做的。
欧拉函数φ：φ(n)表示1
 … n中与n互质的整数个数。即：
for(int i=1;i
    if(gcd(i,n)==1)
        s++;


（先考虑x求使得=1的的个数，那么就可以枚举y，然后s+=φ(y)来得到结果了。当然也可以用前缀和来一步求。

那么怎么把原题和欧拉函]]></description><category></category></item><item><title><![CDATA[hdu4466 将长度为n线段瓜分成若干个相似三角形，有多少种分法（划分dp）]]></title><link>https://blog.csdn.net/cacyth/article/details/51176748</link><guid>https://blog.csdn.net/cacyth/article/details/51176748</guid><author>cacyth</author><pubDate>Mon, 18 Apr 2016 00:50:02 +0800</pubDate><description><![CDATA[三角形顺序不同视为不同方案。
题解：http://www.cnblogs.com/jianglangcaijin/p/3465526.html
#include
#define ll long long  
#define mod 1000000007
#define maxn 5000000
using namespace std;   
int dp[maxn+5];
int power[]]></description><category></category></item><item><title><![CDATA[hdu4467|zoj3742改变一个点影响到它周围的线路属性，询问整张图某属性的值（重点，轻点）]]></title><link>https://blog.csdn.net/cacyth/article/details/51174184</link><guid>https://blog.csdn.net/cacyth/article/details/51174184</guid><author>cacyth</author><pubDate>Sun, 17 Apr 2016 17:42:05 +0800</pubDate><description><![CDATA[杭电4467题意：给定N个点，M条边，每个点为0或者为1，每条边有一个权值。接下来有Q组操作，要么翻转某个点的标号，要么询问某组边的权值一共为多少，总共有三种类型的边：端点分别为(0,
 0), (0, 1), (1, 1)。
浙大3742题意：给定N个点，M条边，每条边有一个权值。接下来有Q组操作，要么使某个点连接的所有边取反，要么询问正边/负边的权值和为多少。
粗粗一看两道题很像，细细推]]></description><category></category></item><item><title><![CDATA[hdu4190 n个城市，m个投票箱。求票数最大的投票箱内票数最少时的数目]]></title><link>https://blog.csdn.net/cacyth/article/details/51173664</link><guid>https://blog.csdn.net/cacyth/article/details/51173664</guid><author>cacyth</author><pubDate>Sun, 17 Apr 2016 16:08:38 +0800</pubDate><description><![CDATA[样例输入:

2 7
200000
500000

4 6
120
2680
3400
200

-1 -1


样例输出:

100000
1700
有n个城市，m个投票箱。每个城市的人口分别是xi。求票数最大的投票箱内票数最少时的数目。

思路：尽量均分。
【二分版】
#include 
#include 
#include 
#include 
#include 
#]]></description><category></category></item></channel></rss>