<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[admin__的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/admin__</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; admin__]]></copyright><item><title><![CDATA[2019 Multi-University Training Contest 1------Vacation]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/100011060</link><guid>https://blog.youkuaiyun.com/admin__/article/details/100011060</guid><author>admin__</author><pubDate>Thu, 22 Aug 2019 12:19:09 +0800</pubDate><description><![CDATA[题目链接：https://vjudge.net/problem/HDU-6581



题意：

有n+1辆车排成一列往终点行驶（行驶过程中不能超车），每辆车有各自的车长、离停止线的距离和车速，你的车在最后一个位置，问你的车头到达停止线所需的最少时间。



思路：

每一辆车都需要为后面的车辆腾出一定的距离（距离停止线的长度加上后面所有车（除最后一辆车)的车身长度），以至于每辆车都能通过停止...]]></description><category></category></item><item><title><![CDATA[10050. 「一本通 2.3 例 2」The XOR Largest Pair]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/96272461</link><guid>https://blog.youkuaiyun.com/admin__/article/details/96272461</guid><author>admin__</author><pubDate>Wed, 17 Jul 2019 09:37:10 +0800</pubDate><description><![CDATA[题目链接：https://loj.ac/problem/10050

思路：把每一个数字 x 转化为31位的二进制数，不够的前面补0，并插入到字典树中（最低为二进制位为叶节点）；

接下来对每一个数字 x 的二进制位进行查找，每一步都尽量找与当前位置相反的数字进行访问，入如果有相反的数字，根据xor运算这一位就会留下一个 1 ，最后找出最大值就行。

代码：


#include&lt;bits/...]]></description><category></category></item><item><title><![CDATA[「一本通 2.3 例 1」Phone List]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/95971588</link><guid>https://blog.youkuaiyun.com/admin__/article/details/95971588</guid><author>admin__</author><pubDate>Mon, 15 Jul 2019 15:19:50 +0800</pubDate><description><![CDATA[题目链接：https://loj.ac/problem/10049

思路：字典树模板题具体看代码


#include&lt;bits/stdc++.h&gt;
#define ll long long
#define N 100861
#define inf 0x3f3f3f3f
using namespace std;
int ch[10][N],tot;
bool book[N];
voi...]]></description><category></category></item><item><title><![CDATA[Apple Tree————POJ—3321]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/89761980</link><guid>https://blog.youkuaiyun.com/admin__/article/details/89761980</guid><author>admin__</author><pubDate>Thu, 02 May 2019 16:03:17 +0800</pubDate><description><![CDATA[题目：

There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.

The tree h...]]></description><category></category></item><item><title><![CDATA[Roadblocks ———POJ - 3255 （次短路）]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/89630829</link><guid>https://blog.youkuaiyun.com/admin__/article/details/89630829</guid><author>admin__</author><pubDate>Sun, 28 Apr 2019 08:49:37 +0800</pubDate><description><![CDATA[题目：

Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way...]]></description><category></category></item><item><title><![CDATA[The contest———CSU - 1326（分组背包、并查集）]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/89501556</link><guid>https://blog.youkuaiyun.com/admin__/article/details/89501556</guid><author>admin__</author><pubDate>Wed, 24 Apr 2019 19:54:57 +0800</pubDate><description><![CDATA[题目：

 殷犇有很多队员。他们都认为自己是最强的，于是，一场比赛开始了~

 于是安叔主办了一场比赛，比赛有n个题目，每个题目都有一个价值Pi和相对能力消耗Wi，但是有些题目因为太坑不能同时做出来，并且坑题具有传递性。（a和b一起做会坑、b和c会坑则a和c也会坑） ACM队员们想知道，于是他们想知道在能力范围内，它们最多可以作出多少价值的题目。

 聪明的你，告诉我，能帮帮他们吗？

In...]]></description><category></category></item><item><title><![CDATA[Almost Union-Find（并查集 删除）——UVa 11987]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/89465551</link><guid>https://blog.youkuaiyun.com/admin__/article/details/89465551</guid><author>admin__</author><pubDate>Tue, 23 Apr 2019 09:23:21 +0800</pubDate><description><![CDATA[题目：

Almost Union-Find
I hope you know the beautiful Union-Find structure. In this problem, you're to implement something similar, but not identical.

The data structure you need to write is also a co...]]></description><category></category></item><item><title><![CDATA[欧拉函数模板——快速求小于n且与n互质的数的个数]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/89132296</link><guid>https://blog.youkuaiyun.com/admin__/article/details/89132296</guid><author>admin__</author><pubDate>Tue, 09 Apr 2019 08:46:41 +0800</pubDate><description><![CDATA[nlog(n)打表欧拉函数：


void Euler()
{
    phi[1] = 1;
    for(int i=2;i&lt;N;i++)
    {
        if(!phi[i])
        {
            for(int j=i;j&lt;N;j=j+i)
            {
                if(!phi[j])
        ...]]></description><category></category></item><item><title><![CDATA[Fibonacci————矩阵快速幂求斐波那契数列]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/89035297</link><guid>https://blog.youkuaiyun.com/admin__/article/details/89035297</guid><author>admin__</author><pubDate>Thu, 04 Apr 2019 20:53:32 +0800</pubDate><description><![CDATA[题目：

In the Fibonacci integer sequence,F0= 0,F1= 1, andFn=Fn− 1+Fn− 2forn≥ 2. For example, the first ten terms of the Fibonacci sequence are:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …

An alte...]]></description><category></category></item><item><title><![CDATA[树上战争   HDU - 2545]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/88894495</link><guid>https://blog.youkuaiyun.com/admin__/article/details/88894495</guid><author>admin__</author><pubDate>Fri, 29 Mar 2019 15:38:54 +0800</pubDate><description><![CDATA[题目：

给一棵树，如果树上的某个节点被某个人占据，则它的所有儿子都被占据，lxh和pfz初始时分别站在两个节点上，谁当前所在的点被另一个人占据，他就输了比赛，问谁能获胜

Input

输入包含多组数据
每组第一行包含两个数N，M（N，M&lt;=100000），N表示树的节点数，M表示询问数，N=M=0表示输入结束。节点的编号为1到N。
接下来N-1行，每行2个整数A，B(1&lt;=A...]]></description><category></category></item><item><title><![CDATA[L2-020 功夫传人]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/88849241</link><guid>https://blog.youkuaiyun.com/admin__/article/details/88849241</guid><author>admin__</author><pubDate>Wed, 27 Mar 2019 16:58:04 +0800</pubDate><description><![CDATA[题目：

一门武功能否传承久远并被发扬光大，是要看缘分的。一般来说，师傅传授给徒弟的武功总要打个折扣，于是越往后传，弟子们的功夫就越弱…… 直到某一支的某一代突然出现一个天分特别高的弟子（或者是吃到了灵丹、挖到了特别的秘笈），会将功夫的威力一下子放大N倍 —— 我们称这种弟子为“得道者”。

这里我们来考察某一位祖师爷门下的徒子徒孙家谱：假设家谱中的每个人只有1位师傅（除了祖师爷没有师傅）；每位师...]]></description><category></category></item><item><title><![CDATA[L2-005 集合相似度]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/88843755</link><guid>https://blog.youkuaiyun.com/admin__/article/details/88843755</guid><author>admin__</author><pubDate>Wed, 27 Mar 2019 14:28:58 +0800</pubDate><description><![CDATA[题目：

给定两个整数集合，它们的相似度定义为：N​c​​/N​t​​×100%。其中N​c​​是两个集合都有的不相等整数的个数，N​t​​是两个集合一共有的不相等整数的个数。你的任务就是计算任意一对给定集合的相似度。

输入格式：

输入第一行给出一个正整数N（≤50），是集合的个数。随后N行，每行对应一个集合。每个集合首先给出一个正整数M（≤10​4​​），是集合中元素的个数；然后跟M个[0,...]]></description><category></category></item><item><title><![CDATA[L3-002 特殊堆栈]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/88839252</link><guid>https://blog.youkuaiyun.com/admin__/article/details/88839252</guid><author>admin__</author><pubDate>Wed, 27 Mar 2019 11:14:53 +0800</pubDate><description><![CDATA[题目：

堆栈是一种经典的后进先出的线性结构，相关的操作主要有“入栈”（在堆栈顶插入一个元素）和“出栈”（将栈顶元素返回并从堆栈中删除）。本题要求你实现另一个附加的操作：“取中值”——即返回所有堆栈中元素键值的中值。给定 N 个元素，如果 N 是偶数，则中值定义为第 N/2 小元；若是奇数，则为第 (N+1)/2 小元。

输入格式：

输入的第一行是正整数 N（≤10​5​​）。随后 N 行，每...]]></description><category></category></item><item><title><![CDATA[Cash Machine--（背包，二进制优化）]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/88579894</link><guid>https://blog.youkuaiyun.com/admin__/article/details/88579894</guid><author>admin__</author><pubDate>Fri, 15 Mar 2019 17:54:10 +0800</pubDate><description><![CDATA[题目：

A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say ...]]></description><category></category></item><item><title><![CDATA[51nod-1379 扔盘子]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/87537405</link><guid>https://blog.youkuaiyun.com/admin__/article/details/87537405</guid><author>admin__</author><pubDate>Sun, 17 Feb 2019 15:52:25 +0800</pubDate><description><![CDATA[题目：

有一口井，井的高度为N，每隔1个单位它的宽度有变化。现在从井口往下面扔圆盘，如果圆盘的宽度大于井在某个高度的宽度，则圆盘被卡住（恰好等于的话会下去）。

盘子有几种命运：1、掉到井底。2、被卡住。3、落到别的盘子上方。

盘子的高度也是单位高度。给定井的宽度和每个盘子的宽度，求最终落到井内的盘子数量。

 



 

如图井和盘子信息如下：

井：5 6 4 3 6 2 3

盘子：2...]]></description><category></category></item><item><title><![CDATA[A + B for you again    hdu 1867]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/85007333</link><guid>https://blog.youkuaiyun.com/admin__/article/details/85007333</guid><author>admin__</author><pubDate>Fri, 14 Dec 2018 17:51:46 +0800</pubDate><description><![CDATA[题目：

Generally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and “sdfg”, the result of the addition bet...]]></description><category></category></item><item><title><![CDATA[Frosh Week  HDU - 3743]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/84915930</link><guid>https://blog.youkuaiyun.com/admin__/article/details/84915930</guid><author>admin__</author><pubDate>Sun, 09 Dec 2018 09:13:18 +0800</pubDate><description><![CDATA[题目：

During Frosh Week, students play various fun games to get to know each other and compete against other teams. In one such game, all the frosh on a team stand in a line, and are then asked to arra...]]></description><category></category></item><item><title><![CDATA[upper_bound()和low_bound函数的基本使用和理解（转）]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/84886017</link><guid>https://blog.youkuaiyun.com/admin__/article/details/84886017</guid><author>admin__</author><pubDate>Fri, 07 Dec 2018 19:23:57 +0800</pubDate><description><![CDATA[博客链接：https://blog.youkuaiyun.com/sdz20172133/article/details/80101838]]></description><category></category></item><item><title><![CDATA[I Hate It  线段树]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/84670570</link><guid>https://blog.youkuaiyun.com/admin__/article/details/84670570</guid><author>admin__</author><pubDate>Sat, 01 Dec 2018 08:57:30 +0800</pubDate><description><![CDATA[题目：

很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。 
这让很多学生很反感。 
不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。

Input

本题目包含多组测试，请处理到文件结束。 
在每个测试的第一行，有两个正整数 N 和 M ( 0&amp;lt;N&amp;lt;=200000,0&amp;lt;M...]]></description><category></category></item><item><title><![CDATA[Math CodeForces - 1062B]]></title><link>https://blog.youkuaiyun.com/admin__/article/details/84667172</link><guid>https://blog.youkuaiyun.com/admin__/article/details/84667172</guid><author>admin__</author><pubDate>Fri, 30 Nov 2018 20:12:02 +0800</pubDate><description><![CDATA[题目：

传送门

 

题意：

输入一个n，问经过最少多少次操作可以使n变得最小、最小值是多少？

操作一：把n乘以一个数；

操作二：把n开平方；

 

思路：

把n化为质因数相乘的形式，比如一个数可以化为2^4*3^5*5^7*7^2;

找出指数最大是多少（假如是m），找到比m大且是2的指数次方的数k；

这时候就相当于把n乘以一个数变成2^k*3^k*5^k*7^k;

再对这个数...]]></description><category></category></item></channel></rss>