<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[鸿杰 的博客]]></title><description><![CDATA[世界上有太多孤独的人害怕先踏出第一步。]]></description><link>https://blog.youkuaiyun.com/Hpuer_Random</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Hpuer_Random]]></copyright><item><title><![CDATA[快速排序]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/107147739</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/107147739</guid><author>Hpuer_Random</author><pubDate>Sun, 05 Jul 2020 23:53:51 +0800</pubDate><description><![CDATA[明天要面试，听说会考快速排序，预习一下
/*
选在一个基准数，比它小的在它的左边，比它大的在它的右边。（分治）
然后再对左右两部分进行上面的操作一直到最后
时间复杂度O(n^2)到O(nlogn)
不是稳定的排序方式
*/

#include&lt;bits/stdc++.h&gt;
using namespace std;

void QuickSOrt(int a[], int start, int last){
        if(start&gt;=last) return ;
        i]]></description><category></category></item><item><title><![CDATA[codeforces gym 102058——————HPU ICPC国庆训练1]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/102467801</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/102467801</guid><author>Hpuer_Random</author><pubDate>Thu, 10 Oct 2019 13:09:33 +0800</pubDate><description><![CDATA[题目来源：https://codeforces.com/gym/102058
目录E. FractionsL. Repetitive PalindromeM. Coke Challenge
E. Fractions
官方题解：




#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
ll A,B,C,...]]></description><category></category></item><item><title><![CDATA[图形学实验3——————简单种子填充算法]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101460177</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101460177</guid><author>Hpuer_Random</author><pubDate>Sun, 06 Oct 2019 20:39:43 +0800</pubDate><description><![CDATA[test
#include&lt;GL/glut.h&gt;
#include&lt;stdio.h&gt;
#include&lt;math.h&gt;
#include&lt;windows.h&gt;

void init(void) {
	glClearColor(1.0, 1.0, 1.0, 0.0);
	glMatrixMode(GL_PROJECTION);
	gluOrtho2D(...]]></description><category></category></item><item><title><![CDATA[2017 EC-Final 部分题解——————HPU ICPC国庆训练2]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/102090951</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/102090951</guid><author>Hpuer_Random</author><pubDate>Fri, 04 Oct 2019 21:33:06 +0800</pubDate><description><![CDATA[目录，点击即可跳转到相应题解[A. Chat Group](https://codeforces.com/gym/101775/problem/A)[C. Traffic Light](https://codeforces.com/gym/101775/problem/C)[K. Downgrade](https://codeforces.com/gym/101775/problem/K)[L. ...]]></description><category></category></item><item><title><![CDATA[洛谷 P3834 ——————【模板】可持久化线段树 1（主席树）]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101119967</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101119967</guid><author>Hpuer_Random</author><pubDate>Sat, 21 Sep 2019 21:13:18 +0800</pubDate><description><![CDATA[P3834 【模板】可持久化线段树 1（主席树）

#include&lt;bits/stdc++.h&gt;
using namespace std;
const int MAXN = 2e5+7;
int n, m, cnt, rt[MAXN], a[MAXN], x, y, k;
struct node{int l,r,sum;} T[MAXN*30];
vector&lt;int&gt; ...]]></description><category></category></item><item><title><![CDATA[HDU 2665 Kth number——————区间第k大，主席树]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101110852</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101110852</guid><author>Hpuer_Random</author><pubDate>Sat, 21 Sep 2019 17:28:43 +0800</pubDate><description><![CDATA[Kth number
Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 21499    Accepted Submission(s): 6560
Problem Description
Give you a sequence and a...]]></description><category></category></item><item><title><![CDATA[POJ 2761 Feed the dogs——————区间第K大，主席树]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101110695</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101110695</guid><author>Hpuer_Random</author><pubDate>Sat, 21 Sep 2019 16:41:47 +0800</pubDate><description><![CDATA[Feed the dogs
Time Limit: 6000MS		Memory Limit: 65536K
Total Submissions: 23591		Accepted: 7498
Description
Wind loves pretty dogs very much, and she has n pet dogs. So Jiajia has to feed the dogs eve...]]></description><category></category></item><item><title><![CDATA[POJ 2104 K-th Number——————主席树模板，区间第k大]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101110319</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101110319</guid><author>Hpuer_Random</author><pubDate>Sat, 21 Sep 2019 16:29:58 +0800</pubDate><description><![CDATA[K-th Number
Time Limit: 20000MS		Memory Limit: 65536K
Total Submissions: 77307		Accepted: 27874
Case Time Limit: 2000MS
Description
You are working for Macrohard company in data structures department....]]></description><category></category></item><item><title><![CDATA[图形学实验02——————画直线，椭圆,多边形]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101030648</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/101030648</guid><author>Hpuer_Random</author><pubDate>Thu, 19 Sep 2019 18:29:34 +0800</pubDate><description><![CDATA[文章目录画直线画圆画椭圆画多边形
画直线
glBegin(GL_LINES) 接下来的两个点将连在一起
	glBegin(GL_LINES);
	glVertex2f(-0.5f, 0.5f);
	glVertex2f(0.5f, -0.5f);
	glEnd();

#include &lt;GL/glut.h&gt;

#include &lt;math.h&gt;
const int n =...]]></description><category></category></item><item><title><![CDATA[图形学实验01]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/100779592</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/100779592</guid><author>Hpuer_Random</author><pubDate>Sun, 15 Sep 2019 23:03:15 +0800</pubDate><description><![CDATA[#include &lt;GL/glut.h&gt; //需要正确安装GLUT，安装方法如预备知识中所述

void myDisplay(void)

{
	//glClearColor(0.0, 0.0, 0.0, 0.0);
	glClearColor(1.0, 1.0, 1.0, 1.0);
	glClear(GL_COLOR_BUFFER_BIT);

	glColor3f (1.0f...]]></description><category></category></item><item><title><![CDATA[牛客练习赛51 A-E]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/100588029</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/100588029</guid><author>Hpuer_Random</author><pubDate>Fri, 06 Sep 2019 23:48:50 +0800</pubDate><description><![CDATA[B	子串查询
主要是学习了一下string 中 find 的用法
#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
const int MAXN = 1e5+7;


int main() {
        int n,q;
        string s;
        cin&gt;&gt;n...]]></description><category></category></item><item><title><![CDATA[The Preliminary Contest for ICPC Asia Nanjing 2019]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/100540548</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/100540548</guid><author>Hpuer_Random</author><pubDate>Wed, 04 Sep 2019 15:56:11 +0800</pubDate><description><![CDATA[H - Holy Grail
As the current heir of a wizarding family with a long history,unfortunately, you find yourself forced to participate in the cruel Holy Grail War which has a reincarnation of sixty years...]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 139]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/100539168</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/100539168</guid><author>Hpuer_Random</author><pubDate>Wed, 04 Sep 2019 15:08:14 +0800</pubDate><description><![CDATA[文章目录[A - Tenki](https://atcoder.jp/contests/abc139/tasks/abc139_a)[B - Power Socket](https://atcoder.jp/contests/abc139/tasks/abc139_b)[C - Lower](https://atcoder.jp/contests/abc139/tasks/abc139_c)[D ...]]></description><category></category></item><item><title><![CDATA[河南理工2019暑期选拔赛————我好菜]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/99472411</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/99472411</guid><author>Hpuer_Random</author><pubDate>Tue, 13 Aug 2019 21:17:23 +0800</pubDate><description><![CDATA[文章目录[Problem  A	小L的项链切割](http://acm.zzuli.edu.cn/problem.php?id=1526)[Problem  B	小L的试卷](http://acm.zzuli.edu.cn/problem.php?id=1527)[Problem  C	小L记单词](http://acm.zzuli.edu.cn/problem.php?id=2041)[Prob...]]></description><category></category></item><item><title><![CDATA[leetcode第 149 场周赛 1155. 掷骰子的N种方法]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/99202757</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/99202757</guid><author>Hpuer_Random</author><pubDate>Sun, 11 Aug 2019 16:34:23 +0800</pubDate><description><![CDATA[掷骰子的N种方法
这里有 ddd 个一样的骰子，每个骰子上都有 fff 个面，分别标号为 1,2,...,f1, 2, ..., f1,2,...,f。
我们约定：掷骰子的得到总点数为各骰子面朝上的数字的总和。
如果需要掷出的总点数为 targettargettarget，请你计算出有多少种不同的组合情况（所有的组合情况总共有fdf^dfd 种），模 109+710^9 + 7109+7 后返回。...]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 137 D - Summer Vacation——————贪心，优先队列]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/99128977</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/99128977</guid><author>Hpuer_Random</author><pubDate>Sat, 10 Aug 2019 23:55:03 +0800</pubDate><description><![CDATA[abc137_D - Summer Vacation
Problem Statement
There are NNN  one-off jobs available. If you take the i-th job and complete it, you will earn the reward of BiB_iBi​ after AiA_iAi​ days from the day you ...]]></description><category></category></item><item><title><![CDATA[POJ 2976 Dropping tests —————— 01分数规划，二分]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/98880944</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/98880944</guid><author>Hpuer_Random</author><pubDate>Thu, 08 Aug 2019 18:04:50 +0800</pubDate><description><![CDATA[POJ 2976 Dropping tests
给出n个a和b，让选出n-k个使得 100∗∑i=1nai∑i=1nbi100*\frac{\sum_{i=1}^{n} a_i}{\sum_{i=1}^{n}b_i}100∗∑i=1n​bi​∑i=1n​ai​​ 最大
01规划问题，看这里
看完就会了
这里用的是二分的方法
/*--------- Hongjie ----------*/
/**
...]]></description><category></category></item><item><title><![CDATA[BZOJ 1113 海报PLA——————单调栈]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/98878717</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/98878717</guid><author>Hpuer_Random</author><pubDate>Thu, 08 Aug 2019 17:43:26 +0800</pubDate><description><![CDATA[BZOJ 1113 海报PLA
Description
N个矩形,排成一排. 现在希望用尽量少的矩形海报Cover住它们.
Input
第一行给出数字N,代表有N个矩形.N在[1,250000] 下面N行,每行给出矩形的长与宽.其值在[1,1000000000]2 1/2 Postering
Output
最少数量的海报数.
Sample Input
5
1 2
1 3
2 2
2 5
1 4

...]]></description><category></category></item><item><title><![CDATA[POJ 2559 Largest Rectangle in a Histogram ——————单调栈]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/98877099</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/98877099</guid><author>Hpuer_Random</author><pubDate>Thu, 08 Aug 2019 17:30:42 +0800</pubDate><description><![CDATA[POJ 2559 Largest Rectangle in a Histogram
现在有 nnn 个宽度为 111 ，高度分别为h1,h2,...,hnh_1,h_2,...,h_nh1​,h2​,...,hn​的长方形从左到右组成的柱状图。问里面包含的长方形的最大面积是多少？
下图对应的样例
7
2 1 4 5 1 3 3
结果是 8 ，图中阴影部分


用单调栈来维护以hih_ihi​为高度...]]></description><category></category></item><item><title><![CDATA[POJ 3250 Bad Hair Day——————单调栈]]></title><link>https://blog.youkuaiyun.com/Hpuer_Random/article/details/98876278</link><guid>https://blog.youkuaiyun.com/Hpuer_Random/article/details/98876278</guid><author>Hpuer_Random</author><pubDate>Thu, 08 Aug 2019 16:57:29 +0800</pubDate><description><![CDATA[POJ 3250 Bad Hair Day
Farmer John的奶牛在风中凌乱了它们的发型……
每只奶牛都有一个身高hi(1≤hi≤1,000,000,000)hi(1 ≤ hi ≤ 1,000,000,000)hi(1≤hi≤1,000,000,000)，现在在这里有一排全部面向右方的奶牛，一共有NNN只(1≤N≤80,000)(1 ≤ N ≤ 80,000)(1≤N≤80,000)。对于奶...]]></description><category></category></item></channel></rss>