<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[十分残念的博客]]></title><description><![CDATA[EL PSY CONGROO]]></description><link>https://blog.youkuaiyun.com/qq_31759205</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_31759205]]></copyright><item><title><![CDATA[ubuntu（Linux 4.1.30）添加系统调用]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/103721227</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/103721227</guid><author>qq_31759205</author><pubDate>Sat, 04 Jan 2020 11:02:11 +0800</pubDate><description><![CDATA[1.编写代码
进入kernel文件夹，将代码放入文件夹中。
cd /usr/src/linux-4.1.30/kernel
mv /home/zhrt/my_syscall.c .

2.修改Makefile，将之前的代码文件加入编译中
3.添加系统调用声明
修改include/linux/下的syscalls.h
cd /usr/src/linux-4.1.30/include/linux
ge...]]></description><category></category></item><item><title><![CDATA[ubuntu更换linux内核]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/103515258</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/103515258</guid><author>qq_31759205</author><pubDate>Thu, 12 Dec 2019 19:51:19 +0800</pubDate><description><![CDATA[所有操作全在root下进行，因此要先su一下
1.下载linux 4.4.1内核
下载地址http://mirrors.edge.kernel.org/pub/linux/kernel/v4.x/linux-4.4.1.tar.gz
2.安装必备软件编译工具：
apt-get install libncurses5-dev build-essential kernel-package

3.解压下...]]></description><category></category></item><item><title><![CDATA[一个打了三年的ACMer总结]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/85147253</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/85147253</guid><author>qq_31759205</author><pubDate>Fri, 21 Dec 2018 00:51:43 +0800</pubDate><description><![CDATA[首先要感谢qwb和胡老师把我拉入坑，让我大学过得这么充实~

本人作为csust的ACMer，零基础入坑，大三拿了个金，大四划水退役。

大一上

刚入大学的我还沉迷于LOL，整天想着上王者，这时碰巧在ACM社团群中划了划水，就被qwb拉入了坑= =。由于起步比较晚，高中也没有搞过OI，进度特别慢，到了第一次周赛的时候，甚至连多组输入都不会写，被各位同级的吊打。品尝到大学首次失败后，我就立了个神奇...]]></description><category></category></item><item><title><![CDATA[2016-2017 ACM-ICPC, NEERC, Moscow Subregional Contest K Knights of the Old Republic（贪心+DP）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/84790413</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/84790413</guid><author>qq_31759205</author><pubDate>Tue, 04 Dec 2018 16:11:14 +0800</pubDate><description><![CDATA[传送门：戳这里

将边按从小到大排序，模拟Kruskal，设当前要合并的2个集合为x和y
设要占领当前这条边，需要花费w
①如果要占领这条边，则花费为min(b[v]) * max(w, max(a[u]))，其中u和v是集合x和y中的点
②如果不占领这条边，则花费为f[x] + f[y]


#include&amp;lt;bits/stdc++.h&amp;gt;
#define lson l,m,rt&amp;lt...]]></description><category></category></item><item><title><![CDATA[2016 North American Invitational Programming Contest-J Whiteboard（区间交）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/84262617</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/84262617</guid><author>qq_31759205</author><pubDate>Tue, 20 Nov 2018 00:37:38 +0800</pubDate><description><![CDATA[传送门：http://codeforces.com/gym/101002

题意：有一个n*m个画板，起始位置为(n,1)，有q条指令，每条指令表示向上下左右一个方向走cnt步，每走一步花费1秒，每走到一个格子就会将格子染黑，现在给出目标图形，并且可以选择一段区间[L,R]使得在这段时间内走过的格子会变白，问这段区间L最小为多少，R最大为多少？

题解：对于目标图形，假设某个格子坐标是(x,y)，...]]></description><category></category></item><item><title><![CDATA[Gym-101741C Cover the Paths（LCA+贪心）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/83064950</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/83064950</guid><author>qq_31759205</author><pubDate>Mon, 15 Oct 2018 21:21:10 +0800</pubDate><description><![CDATA[C. Cover the Paths

time limit per test

1 second

memory limit per test

256 mebibytes

input

standard input

output

standard output

You are given an undirected unweighted tree consisting of n ver...]]></description><category></category></item><item><title><![CDATA[CodeForces-1046D Interstellar battle（期望）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82843538</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82843538</guid><author>qq_31759205</author><pubDate>Tue, 25 Sep 2018 19:14:09 +0800</pubDate><description><![CDATA[D. Interstellar battle

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In the intergalactic empire Bubbledom there are NN planets,...]]></description><category></category></item><item><title><![CDATA[HDU-6184 Counting Stars（暴力找三元环）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82747736</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82747736</guid><author>qq_31759205</author><pubDate>Mon, 17 Sep 2018 19:37:13 +0800</pubDate><description><![CDATA[Counting Stars

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1812    Accepted Submission(s): 504

Problem Description

Little A is an astron...]]></description><category></category></item><item><title><![CDATA[HDU-6191 Query on A Tree（字典树+启发式合并）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82738271</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82738271</guid><author>qq_31759205</author><pubDate>Mon, 17 Sep 2018 14:54:08 +0800</pubDate><description><![CDATA[Query on A Tree

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)
Total Submission(s): 1732    Accepted Submission(s): 566

Problem Description

Monkey A lives o...]]></description><category></category></item><item><title><![CDATA[GYM-2014-2015 Andrew Stankevich Contest 47 (ASC 47) E  Elegant Square（构造）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82495253</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82495253</guid><author>qq_31759205</author><pubDate>Fri, 07 Sep 2018 13:35:46 +0800</pubDate><description><![CDATA[

题意：要求构造一个N*N的矩阵，使得所有数字都不相同且每一行每一列的乘积相同，且每个数字都不含平方因子


#include&amp;lt;bits/stdc++.h&amp;gt;
#define lson l,m,rt&amp;lt;&amp;lt;1
#define rson m+1,r,rt&amp;lt;&amp;lt;1|1
#define x first
#define y second
#define rep(i,a,b) ...]]></description><category></category></item><item><title><![CDATA[CodeForces-H Path Counting（DP）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82466162</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82466162</guid><author>qq_31759205</author><pubDate>Thu, 06 Sep 2018 18:56:07 +0800</pubDate><description><![CDATA[H. Path Counting

time limit per test

5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a rooted tree. Let's denote d(x) as depth of node ...]]></description><category></category></item><item><title><![CDATA[CodeForces-859D Third Month Insanity（期望DP）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82146090</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82146090</guid><author>qq_31759205</author><pubDate>Tue, 28 Aug 2018 12:53:49 +0800</pubDate><description><![CDATA[D. Third Month Insanity

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The annual college sports-ball tournament is approaching,...]]></description><category></category></item><item><title><![CDATA[CodeForces-803F Coprime Subsequences（莫比乌斯反演）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82120261</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82120261</guid><author>qq_31759205</author><pubDate>Mon, 27 Aug 2018 22:35:41 +0800</pubDate><description><![CDATA[F. Coprime Subsequences

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Let's call a non-empty sequence of positive integers a1, ...]]></description><category></category></item><item><title><![CDATA[51Nod-1385 凑数字（贪心）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82085584</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82085584</guid><author>qq_31759205</author><pubDate>Sun, 26 Aug 2018 22:37:06 +0800</pubDate><description><![CDATA[1385 凑数字 

基准时间限制：1 秒 空间限制：131072 KB 分值: 80 难度：5级算法题

 收藏

 关注

给定一个n,要求找出一个最短的字符串S，使得所有1到n的整数都是S的子序列。

比如n=10，那么S=”1234056789”的时候，是满足条件的。这个时候S的长度是10。

 

现在给出一个n，要求输出最短S的长度。

Input


第1行：给出一个整数n (1&amp;l...]]></description><category></category></item><item><title><![CDATA[51Nod-1476 括号序列的最小代价（贪心）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82056524</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82056524</guid><author>qq_31759205</author><pubDate>Sat, 25 Aug 2018 23:26:37 +0800</pubDate><description><![CDATA[1476 括号序列的最小代价 

题目来源： CodeForces

基准时间限制：1 秒 空间限制：131072 KB 分值: 80 难度：5级算法题

 收藏

 关注

这里有一个关于合法的括号序列的问题。

如果插入“+”和“1”到一个括号序列，我们能得到一个正确的数学表达式，我们就认为这个括号序列是合法的。例如，序列&quot;(())()&quot;, &quot;()&quot;和&quot;(()(()))&quot;是合法的，但是&quot;)(&quot;...]]></description><category></category></item><item><title><![CDATA[51Nod-1672 区间交 (贪心+线段树）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82056004</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82056004</guid><author>qq_31759205</author><pubDate>Sat, 25 Aug 2018 22:18:50 +0800</pubDate><description><![CDATA[1672 区间交 

基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题

 收藏

 关注

小A有一个含有n个非负整数的数列与m个区间，每个区间可以表示为li,ri。

它想选择其中k个区间， 使得这些区间的交的那些位置所对应的数的和最大。（是指k个区间共同的交，即每个区间都包含这一段，具体可以参照样例）

 

在样例中，5个位置对应的值分别为1,2,3,4,...]]></description><category></category></item><item><title><![CDATA[51Nod-1530 稳定方块（贪心）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/82055317</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/82055317</guid><author>qq_31759205</author><pubDate>Sat, 25 Aug 2018 21:09:05 +0800</pubDate><description><![CDATA[1530 稳定方块 

题目来源： CodeForces

基准时间限制：10 秒 空间限制：131072 KB 分值: 80 难度：5级算法题

 收藏

 关注

瓦西亚和皮台亚摆放了m个方块。方块被编号为0到m-1(每个号码出现恰好一次)。现在建立一个座标系OX表示地面，OY的方向是竖直向上的。每一方块的左下角有一个座标而且是整点座标。

摆放好的方块一定要是稳定的。稳定的含意是每一个不在地...]]></description><category></category></item><item><title><![CDATA[CodeForces-988E Divisibility by 25（贪心）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/81988942</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/81988942</guid><author>qq_31759205</author><pubDate>Thu, 23 Aug 2018 22:07:50 +0800</pubDate><description><![CDATA[ 

E. Divisibility by 25

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an integer nn from 11 to 10181018 without l...]]></description><category></category></item><item><title><![CDATA[CodeForces-1004E Sonya and Ice Cream（树型DP+RMQ）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/81986268</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/81986268</guid><author>qq_31759205</author><pubDate>Thu, 23 Aug 2018 19:20:29 +0800</pubDate><description><![CDATA[E. Sonya and Ice Cream

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Sonya likes ice cream very much. She eats it even during p...]]></description><category></category></item><item><title><![CDATA[HDU-5932 Backpack on Tree（DP+贪心）]]></title><link>https://blog.youkuaiyun.com/qq_31759205/article/details/81978857</link><guid>https://blog.youkuaiyun.com/qq_31759205/article/details/81978857</guid><author>qq_31759205</author><pubDate>Thu, 23 Aug 2018 12:41:08 +0800</pubDate><description><![CDATA[Backpack on Tree

Time Limit: 9000/4500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 193    Accepted Submission(s): 54
 

Problem Description

There is a rooted t...]]></description><category></category></item></channel></rss>