<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[max_kibble的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/max_kibble</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; max_kibble]]></copyright><item><title><![CDATA[C/C++二维数组传参]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/125137158</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/125137158</guid><author>max_kibble</author><pubDate>Sun, 05 Jun 2022 21:58:28 +0800</pubDate><description><![CDATA[C/C++二维数组传参]]></description><category></category></item><item><title><![CDATA[CF Round599 Div.2]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/103027481</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/103027481</guid><author>max_kibble</author><pubDate>Tue, 12 Nov 2019 15:24:11 +0800</pubDate><description><![CDATA[B1. Character Swap (Easy Version)
B2. Character Swap (Hard Version)
题意：给你两个长度为n的字符串s,t，字符串只包含26个小写字母。你的操作是每次从两个字符串中分别挑一个字母出来交换，问能不能使得两个串相等。

第一问中你只能操作1次（且必须操作1次），n≤10000n\leq 10000n≤10000
第二问中你最多可以操作 ...]]></description><category></category></item><item><title><![CDATA[CF Round598 Div.3]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/102951742</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/102951742</guid><author>max_kibble</author><pubDate>Thu, 07 Nov 2019 12:17:40 +0800</pubDate><description><![CDATA[A. Payment Without Change
题意：你有a个面值为n的硬币和b个一元硬币，问能不能整好凑出S
分析：尽可能的用n，剩下的用1去补
B. Minimize the Permutation
题意：给你1-n的置换，n≤100n\leq 100n≤100，每个位置i只允许与i+1发生一次交换。问若干次交换后能得到的字典序最小的置换。
分析：贪心。先把1移到最前面，假设1最初在下标x...]]></description><category></category></item><item><title><![CDATA[CF Round597 Div.2]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/102949924</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/102949924</guid><author>max_kibble</author><pubDate>Thu, 07 Nov 2019 11:31:09 +0800</pubDate><description><![CDATA[C. Constanze’s Machine
题意：有一个键盘，你敲w的时候就弹出uu，你敲m的时候就弹出nn，其他正常。现在给你一个用该键盘敲出的字符串，问你原字符串有多少种可能。
思路：首先字符串中不可能出现w和m。对于连续的u和n，用dp求出这一段可能对应的原字符串个数。然后乘起来就好了。
D. Shichikuji and Power Grid
题意：有n个城市，n≤200n\leq 20...]]></description><category></category></item><item><title><![CDATA[cf 739B Alyona and a tree]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/82908649</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/82908649</guid><author>max_kibble</author><pubDate>Sun, 30 Sep 2018 13:58:15 +0800</pubDate><description><![CDATA[一 原题

http://codeforces.com/contest/739/problem/B

二 分析

题意：给你一棵树，每个顶点和每条边都有一个权值。我们称点u控制点v，如果它们之间满足如下两个条件：1）v在以u为根节点的子树中，2）从u到v的简单路径上边的权重和dist(u, v)不超过v点的权重。顶点范围2e5，权值大小1-1e9

一个顶点s到它的各个祖先的距离是有序的，很容易想...]]></description><category></category></item><item><title><![CDATA[cf 1051F The Shortest Statement]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/82896490</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/82896490</guid><author>max_kibble</author><pubDate>Sat, 29 Sep 2018 14:06:43 +0800</pubDate><description><![CDATA[一 原题

F. The Shortest Statement

time limit per test: 4 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

You are given a weighed undirected connected grap...]]></description><category></category></item><item><title><![CDATA[cf 1027f Session in BSU]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/81945299</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/81945299</guid><author>max_kibble</author><pubDate>Wed, 22 Aug 2018 15:41:59 +0800</pubDate><description><![CDATA[一 原题

F. Session in BSU

time limit per test: 4 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

Polycarp studies in Berland State University. Soon he wil...]]></description><category></category></item><item><title><![CDATA[cf 1027D Mouse Hunt]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/81909664</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/81909664</guid><author>max_kibble</author><pubDate>Tue, 21 Aug 2018 16:17:50 +0800</pubDate><description><![CDATA[原题

D. Mouse Hunt

time limit per test: 2 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

Medicine faculty of Berland State University has just finished ...]]></description><category></category></item><item><title><![CDATA[cf 1012B Chemical table]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/81294766</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/81294766</guid><author>max_kibble</author><pubDate>Tue, 31 Jul 2018 00:44:38 +0800</pubDate><description><![CDATA[一 原题

D. Chemical table

time limit per test: 1 second

memory limit per test: 512 megabytes

input: standard input

output: standard output

Innopolis University scientists continue to investigate th...]]></description><category></category></item><item><title><![CDATA[cf 1006F Xor-Paths]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/81137757</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/81137757</guid><author>max_kibble</author><pubDate>Fri, 20 Jul 2018 19:58:48 +0800</pubDate><description><![CDATA[一 原题

F. Xor-Paths

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There is a rectangular grid of size n×mn×m. Each cell has a nu...]]></description><category></category></item><item><title><![CDATA[poj 1183 食物链]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/81099591</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/81099591</guid><author>max_kibble</author><pubDate>Wed, 18 Jul 2018 15:54:49 +0800</pubDate><description><![CDATA[一 原题

食物链

Time Limit: 1000MS
			 
			Memory Limit: 10000K
		Total Submissions: 88372
			 
			Accepted: 26490
		Description

动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 
现有N个动物，以1－N编号。每个动物都是A,B,C中...]]></description><category></category></item><item><title><![CDATA[poj 2823 Sliding Window]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/81014088</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/81014088</guid><author>max_kibble</author><pubDate>Thu, 12 Jul 2018 13:22:40 +0800</pubDate><description><![CDATA[一 原题Sliding WindowTime Limit: 12000MS Memory Limit: 65536KTotal Submissions: 68479 Accepted: 19426Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106 is given to you. There is a sliding window ...]]></description><category></category></item><item><title><![CDATA[cf 1004E Sonya and Ice Cream]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/81008676</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/81008676</guid><author>max_kibble</author><pubDate>Wed, 11 Jul 2018 23:55:01 +0800</pubDate><description><![CDATA[一 原题E. Sonya and Ice Creamtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSonya likes ice cream very much. She eats it even during programming com...]]></description><category></category></item><item><title><![CDATA[cf 1004D Sonya and Matrix]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/80991241</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/80991241</guid><author>max_kibble</author><pubDate>Tue, 10 Jul 2018 20:02:01 +0800</pubDate><description><![CDATA[一 原题D. Sonya and Matrixtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSince Sonya has just learned the basics of matrices, she decided to play wi...]]></description><category></category></item><item><title><![CDATA[cf 1000E We Need More Bosses]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/80973100</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/80973100</guid><author>max_kibble</author><pubDate>Mon, 09 Jul 2018 16:25:36 +0800</pubDate><description><![CDATA[一 原题E. We Need More Bossestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYour friend is developing a computer game. He has already decided how th...]]></description><category></category></item><item><title><![CDATA[poj 1236 Network of Schools]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/80964017</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/80964017</guid><author>max_kibble</author><pubDate>Sun, 08 Jul 2018 23:28:37 +0800</pubDate><description><![CDATA[一 原题Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22353 Accepted: 8786DescriptionA number of schools are connected to a computer network. Agreements have been developed a...]]></description><category></category></item><item><title><![CDATA[cf 997c Sky Full of Stars]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/80955999</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/80955999</guid><author>max_kibble</author><pubDate>Sat, 07 Jul 2018 23:57:16 +0800</pubDate><description><![CDATA[一 原题E. Sky Full of Starstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOn one of the planets of Solar system, in Atmosphere University, many stud...]]></description><category></category></item><item><title><![CDATA[cf 1000c Covered Points Count]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/80848918</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/80848918</guid><author>max_kibble</author><pubDate>Thu, 28 Jun 2018 21:08:08 +0800</pubDate><description><![CDATA[一 原题C. Covered Points Counttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given nn segments on a coordinate line; each endpoint of every ...]]></description><category></category></item><item><title><![CDATA[Hulu的一道面试题]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/80599454</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/80599454</guid><author>max_kibble</author><pubDate>Mon, 11 Jun 2018 12:58:36 +0800</pubDate><description><![CDATA[一 题意给定一个整数数组a，分别求出满足下列条件的子串数量：1）子串[l, r]中的最大值为a[r]；2）子串[l, r]中的最小值为a[l]，最大值为a[r]注意是子串不是子序列，第一问要求O(n)的时间复杂度，第二问要求O(n*lgn)二 分析第一小问，对于a中的每个元素a[i]，我们定义prev[i]：prev[i]是在a[i]之前第一个比它大的数的下标，如果没有这样的数prev[i]=-1...]]></description><category></category></item><item><title><![CDATA[cf 985E Pencils and Boxes]]></title><link>https://blog.youkuaiyun.com/max_kibble/article/details/80405089</link><guid>https://blog.youkuaiyun.com/max_kibble/article/details/80405089</guid><author>max_kibble</author><pubDate>Tue, 22 May 2018 15:11:06 +0800</pubDate><description><![CDATA[一 原题E. Pencils and Boxestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMishka received a gift of multicolored pencils for his birthday! Unfortuna...]]></description><category></category></item></channel></rss>