<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[diaohan7033的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/diaohan7033</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; diaohan7033]]></copyright><item><title><![CDATA[Ubuntu 18.04 安装 mysql]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205686</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205686</guid><author>diaohan7033</author><pubDate>Mon, 08 Apr 2019 11:26:00 +0800</pubDate><description><![CDATA[最近安装mysql遇到了一系列的坑，我发誓再也不想花费数个上午来做这些事了。
最初图方便使用 sudo apt-get mysql-common mysql-server mysql-client等命令，然而装下来的根本没办法使用。
然后发现官方网站有提供apt支持的.deb文件
Download MySQL APT Repository
最后选择去官方网站提供的方法进行安装...]]></description><category></category></item><item><title><![CDATA[CodeForces 846D. Monitor(二维线段树)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205687</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205687</guid><author>diaohan7033</author><pubDate>Wed, 31 Oct 2018 16:43:00 +0800</pubDate><description><![CDATA[题目大意：给予n,m,k,t 和 t 行i,j,val代表第i行j列的元素会在val天后损坏。求在整张（n*m）图中求一个k*k的区域的数全部损坏的最小天数。试了一下二维线段树，总结一下就是和一维的差别不大，从二叉树变成了四叉树（三维线段树岂不是要八叉树，丧心病狂）。总体上就是把一个长方形均分四块，然后总的节点数就是一个首项为[max(n*m)^2]公比为1/4的等比数列前若干项和，具体...]]></description><category></category></item><item><title><![CDATA[CodeForces 1045A. Last chance(线段树+网络流SAP)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205684</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205684</guid><author>diaohan7033</author><pubDate>Fri, 26 Oct 2018 14:42:00 +0800</pubDate><description><![CDATA[网络流，对三种武器分别有不同建图的方法，核心宗旨是：源点-&gt;武器-&gt;飞船-&gt;汇点。

SQL rockets – every SQL rocket can destroy at most one spaceship in the given set.
Cognition beams – every Cognition beam has an interval [l...]]></description><category></category></item><item><title><![CDATA[BZOJ 1013: [JSOI2008]球形空间产生器sphere (解方程)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205685</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205685</guid><author>diaohan7033</author><pubDate>Mon, 01 Oct 2018 12:34:00 +0800</pubDate><description><![CDATA[1013: [JSOI2008]球形空间产生器sphere
Time Limit: 1 SecMemory Limit: 162 MBSubmit: 7277Solved: 3931[Submit][Status][Discuss]
Description

　　有一个球形空间产生器能够在n维空间中产生一个坚硬的球体。现在，你被困在了这个n维球体中，你只知道球
面上...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2018 北京网络赛:K-Dimensional Foil II]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205682</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205682</guid><author>diaohan7033</author><pubDate>Sat, 22 Sep 2018 20:44:00 +0800</pubDate><description><![CDATA[#1835 : K-Dimensional Foil II




时间限制:1000ms
单点时限:1000ms
内存限制:256MB


描述
"K-Dimensional Foil" is a dimensional weapon. Its function is quite easy: It can ascend a region in 3D spa...]]></description><category></category></item><item><title><![CDATA[HDU 3308 LCIS]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205683</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205683</guid><author>diaohan7033</author><pubDate>Fri, 24 Aug 2018 11:28:00 +0800</pubDate><description><![CDATA[题目大意:给予一个序列，两种操作
·查询 L-R 中的最长严格递增连续子序列的长度
·更改 LOC 的字符为X
经典的线段树区间合并，线段树种一共有三个数组
no[]当前 L到R中的最大值
ls[]从左数的最大长度
rs[]从右数的最大长度

#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt...]]></description><category></category></item><item><title><![CDATA[HDU 6435 CSGO]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205680</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205680</guid><author>diaohan7033</author><pubDate>Thu, 23 Aug 2018 09:25:00 +0800</pubDate><description><![CDATA[按照我们蒟蒻菜队的核心思想(排序贪心)来搞这个题，首先想到暴力的方法，然后不用说肯定会TLE。。
然后加一波玄学排序，标准就是 武器点数+Σ|(主武器的属性值-副武器相应属性的平均值)|，这样第一个不总是正解，
因为可能会有这样的情况
2 2 1
0 233
0 346
0 123
0 456
主武器最大值和最小和平均值比较偏离情况是一样的，既然正解不出现在第一对，那第二...]]></description><category></category></item><item><title><![CDATA[BZOJ 5293 求和(LCA)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205681</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205681</guid><author>diaohan7033</author><pubDate>Fri, 10 Aug 2018 14:59:00 +0800</pubDate><description><![CDATA[5293: [Bjoi2018]求和
Time Limit: 20 SecMemory Limit: 512 MBSubmit: 203Solved: 128[Submit][Status][Discuss]
Description

master 对树上的求和非常感兴趣。他生成了一棵有根树，并且希望多次询问这棵树上一段路径上所有节点深度的k
次方和，而且每次的k...]]></description><category></category></item><item><title><![CDATA[HDU 3338 Kakuro Extension(网络流)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205678</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205678</guid><author>diaohan7033</author><pubDate>Thu, 09 Aug 2018 20:23:00 +0800</pubDate><description><![CDATA[因为某个地方m写成n玄学调bug一个小时...
写完内心是崩溃的...

#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include &lt;list&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[POJ 1220 NUMBER BASE CONVERSION(进制转换，大数)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205679</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205679</guid><author>diaohan7033</author><pubDate>Wed, 08 Aug 2018 01:59:00 +0800</pubDate><description><![CDATA[输入输入如题面，注意对0的处理，然后Java大数真好用。

import java.math.BigInteger;
import java.util.Arrays;
import java.util.*;
import java.io.*;

public class Main{
    static int valOfChar(char a){
        if...]]></description><category></category></item><item><title><![CDATA[HDU 1535 Invitation Cards(最短路)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205599</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205599</guid><author>diaohan7033</author><pubDate>Tue, 07 Aug 2018 16:19:00 +0800</pubDate><description><![CDATA[题目读了半天，发现是从1到 2 ~n个点再从 2 ~n个点回到1的最短路。。
所以正向反向分别建图，跑最短路就好了。

#include &lt;algorithm&gt;
#include &lt;queue&gt;
#include &lt;cstring&gt;
#include &lt;iostream&gt;

using namespace std;
typ...]]></description><category></category></item><item><title><![CDATA[HDU 3572 Task Schedule(网络流+当前弧优化)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205596</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205596</guid><author>diaohan7033</author><pubDate>Sat, 04 Aug 2018 10:55:00 +0800</pubDate><description><![CDATA[网络流入门题目，抽象建边的过程有些困难，外加当前弧优化就过去了（没有这个会T）

#include &lt;algorithm&gt;
#include &lt;iostream&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;map&gt;
#include &lt;set&gt;
#in...]]></description><category></category></item><item><title><![CDATA[HDU 2363 Cycling (最短路 + 暴力枚举)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205597</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205597</guid><author>diaohan7033</author><pubDate>Fri, 03 Aug 2018 01:37:00 +0800</pubDate><description><![CDATA[给与n座山头m条路，求高度差最小的前提下的最短路。。
用dijkstra记录上个节点最高最低点/二分上下界 WA了一辈子，最后发现数据规模其实很小。
直接枚举每一个上下界得到结果即可。
双向边，双向边，双向边。

#include &lt;algorithm&gt;
#include &lt;queue&gt;
#include &lt;iostream&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[POJ 1789 (最小生成树 Prim)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205595</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205595</guid><author>diaohan7033</author><pubDate>Wed, 01 Aug 2018 23:07:00 +0800</pubDate><description><![CDATA[题目描述：给予n个长度为7的字符串，定义两字符串间的代价为同一位置不同的字符的个数，现在要联通所有的字符串求最小代价。 思路：一开始使用Krustal算法，然而因为是稠密图导致TLE，换用Prim。
Krustal:(TLE)

#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;iostream...]]></description><category></category></item><item><title><![CDATA[HDU 6333 Harvest of Apples]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205594</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205594</guid><author>diaohan7033</author><pubDate>Wed, 01 Aug 2018 19:49:00 +0800</pubDate><description><![CDATA[场上怎么都想不出来，看了标程想自闭。。。

#include &lt;algorithm&gt;
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;vector&gt;
#include &lt;cmath&gt;
using namespace std;
#define N 100005
#d...]]></description><category></category></item><item><title><![CDATA[HDU 2227 Find the nondecreasing subsequences(dp+线段树维护)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205591</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205591</guid><author>diaohan7033</author><pubDate>Wed, 01 Aug 2018 10:09:00 +0800</pubDate><description><![CDATA[Find the nondecreasing subsequences
Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2225Accepted Submission(s): 862
Problem Descript...]]></description><category></category></item><item><title><![CDATA[HDU 3549 Flow Problem(网络流Dinic)]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205593</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205593</guid><author>diaohan7033</author><pubDate>Wed, 01 Aug 2018 09:23:00 +0800</pubDate><description><![CDATA[题目描述:给予一张图，源点 1，汇点 n 求最大流。
标准模板题，附上封装好的Dinic模板。


#include &lt;algorithm&gt;
#include &lt;iostream&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;map&gt;
#include &lt;...]]></description><category></category></item><item><title><![CDATA[网络流:棋盘V]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205590</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205590</guid><author>diaohan7033</author><pubDate>Tue, 31 Jul 2018 15:51:00 +0800</pubDate><description><![CDATA[问题 A: 棋盘V
时间限制: 1 Sec内存限制: 128 MB提交: 192解决: 7[提交] [状态] [讨论版] [命题人:admin]
题目描述
有一块棋盘，棋盘的边长为100000，行和列的编号为1到100000。棋盘上有n个特殊格子，任意两个格子的位置都不相同。
现在小K要猜哪些格子是特殊格子。她知道所有格子的横坐标和纵坐标，但并不知道对应关系。换言之，...]]></description><category></category></item><item><title><![CDATA[POJ 3667 Hotel]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205589</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205589</guid><author>diaohan7033</author><pubDate>Fri, 27 Jul 2018 12:01:00 +0800</pubDate><description><![CDATA[Hotel




Time Limit: 3000MS

Memory Limit: 65536K


Total Submissions: 19938

Accepted: 8653




Description


The cows are journeying north to Thunder Bay in Canada to gai...]]></description><category></category></item><item><title><![CDATA[数据结构:链表]]></title><link>https://blog.youkuaiyun.com/diaohan7033/article/details/102205588</link><guid>https://blog.youkuaiyun.com/diaohan7033/article/details/102205588</guid><author>diaohan7033</author><pubDate>Fri, 27 Jul 2018 00:45:00 +0800</pubDate><description><![CDATA[//
// Created by DevilInChina on 2018/6/25.
//

#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;functional&gt;
using namespace std;
template &lt;typename T&gt;
class ...]]></description><category></category></item></channel></rss>