<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DlPF_C的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/DlPF_C</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DlPF_C]]></copyright><item><title><![CDATA[LeetCode4. Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/114164073</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/114164073</guid><author>DlPF_C</author><pubDate>Sat, 27 Feb 2021 11:12:39 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/median-of-two-sorted-arrays/

给出两个有序数组，求得两个数组的中位数。时间复杂度要log(n+m)。

题意简单，但属实有些不好想。有序，时间复杂度要log。很容易想到二分。

先考虑偶数的情况。数组可以分成两个部分。


        left                    right
A[0],A[1],……A[i-1],  |  A[i],A[i+1],……A[n-1]
B[0],B[1],…]]></description><category></category></item><item><title><![CDATA[LeetCode 898. Bitwise ORs of Subarrays]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/82533611</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/82533611</guid><author>DlPF_C</author><pubDate>Sat, 08 Sep 2018 21:40:00 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/bitwise-ors-of-subarrays/description/

枚举以第i个数结尾的运算的所有情况。


class Solution {
public:
    int subarrayBitwiseORs(vector&amp;lt;int&amp;gt;&amp;amp; A) {
        set&amp;lt;int&amp;gt; s;...]]></description><category></category></item><item><title><![CDATA[2018ICPC南京网络赛 B Call of Accepted 表达式求值]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/82533546</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/82533546</guid><author>DlPF_C</author><pubDate>Sat, 08 Sep 2018 21:31:25 +0800</pubDate><description><![CDATA[题目链接：https://nanti.jisuanke.com/t/31443

表达式求值，对于每一步运算要保存一个最大值一个最小值，处理出现负负为正的情况。


#include&amp;lt;bits/stdc++.h&amp;gt;
#define ll long long
using namespace std;
ll Judge(char c1,char c2)
{
	ll a1,a2;
	if('+...]]></description><category></category></item><item><title><![CDATA[LeetCode 895. Maximum Frequency Stack]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/82533470</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/82533470</guid><author>DlPF_C</author><pubDate>Sat, 08 Sep 2018 21:23:56 +0800</pubDate><description><![CDATA[题目地址：https://leetcode.com/problems/maximum-frequency-stack/description/

优先队列模拟栈


class FreqStack {
public:
    struct Node
    {
        int x,y,p;
        bool operator &amp;lt; (const Node &amp;amp;N) con...]]></description><category></category></item><item><title><![CDATA[LeetCode 894 All Possible Full Binary Trees]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/82533423</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/82533423</guid><author>DlPF_C</author><pubDate>Sat, 08 Sep 2018 21:21:23 +0800</pubDate><description><![CDATA[题目地址：https://leetcode.com/problems/all-possible-full-binary-trees/description/

对二叉树的递归构造。

对奇数枚举左右子树点的个数，偶数不符合条件直接返回


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 ...]]></description><category></category></item><item><title><![CDATA[牛客多校赛第九场 E Music Game  概率计算]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81904399</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81904399</guid><author>DlPF_C</author><pubDate>Tue, 21 Aug 2018 11:40:59 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/147/E
来源：牛客网
 

题目描述

Niuniu likes to play OSU!

We simplify the game OSU to the following problem.

 

Given n and m, there are n clicks. Each click may succes...]]></description><category></category></item><item><title><![CDATA[树上的启发式合并 CF1009 F. Dominant Indices]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81673485</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81673485</guid><author>DlPF_C</author><pubDate>Tue, 14 Aug 2018 20:37:22 +0800</pubDate><description><![CDATA[http://codeforces.com/contest/1009/problem/F

讲解：http://codeforces.com/blog/entry/44351

讲解中的问题是解决树上结点特性查询，而本题是查询相对于一个结点每一层根的个数。


#include&amp;lt;bits/stdc++.h&amp;gt;
#define maxn 1000010
using namespace st...]]></description><category></category></item><item><title><![CDATA[牛客多校第七场 J Sudoku Subrectangles]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81583196</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81583196</guid><author>DlPF_C</author><pubDate>Sat, 11 Aug 2018 09:48:07 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/145/J
来源：牛客网
 

You have a n * m grid of characters, where each character is an English letter (lowercase or uppercase, which means there are a total of 52 diff...]]></description><category></category></item><item><title><![CDATA[牛客多校第七场 C 	Bit Compression]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81583088</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81583088</guid><author>DlPF_C</author><pubDate>Sat, 11 Aug 2018 09:24:54 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/145/C
来源：牛客网
 

题目描述

A binary string s of length N = 2n is given. You will perform the following operation n times :
- Choose one of the operators AND (&amp;amp;),...]]></description><category></category></item><item><title><![CDATA[杭电多校第三场 HDU 6300 Problem L. Visual Cube 水题 模拟]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81320755</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81320755</guid><author>DlPF_C</author><pubDate>Tue, 31 Jul 2018 21:10:17 +0800</pubDate><description><![CDATA[Problem L. Visual Cube

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 455    Accepted Submission(s): 322
 

Problem Description

Little Q l...]]></description><category></category></item><item><title><![CDATA[杭电多校第三场 HDU 6319 Problem A. Ascending Rating （模拟单调队列）]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81320545</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81320545</guid><author>DlPF_C</author><pubDate>Tue, 31 Jul 2018 20:59:50 +0800</pubDate><description><![CDATA[Problem A. Ascending Rating

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 3701    Accepted Submission(s): 1225
 

Problem Description

Be...]]></description><category></category></item><item><title><![CDATA[杭电多校第三场HDU6321 Problem C. Dynamic Graph Matching (状压DP）]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81319818</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81319818</guid><author>DlPF_C</author><pubDate>Tue, 31 Jul 2018 20:47:11 +0800</pubDate><description><![CDATA[ 

Problem C. Dynamic Graph Matching

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 1238    Accepted Submission(s): 516
 

Problem Descript...]]></description><category></category></item><item><title><![CDATA[牛客多校第二场 J.Farm]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81163996</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81163996</guid><author>DlPF_C</author><pubDate>Mon, 23 Jul 2018 11:13:19 +0800</pubDate><description><![CDATA[题目链接：https://www.nowcoder.com/acm/contest/140/J

题目描述 

White Rabbit has a rectangular farmland of n*m. In each of the grid there is a kind of plant. The plant in the j-th column of the i-th row belon...]]></description><category></category></item><item><title><![CDATA[牛客多校第一场   J.Different Integers]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81142125</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81142125</guid><author>DlPF_C</author><pubDate>Sat, 21 Jul 2018 11:59:32 +0800</pubDate><description><![CDATA[原博地址：https://www.nowcoder.com/discuss/87249

题目描述 

Given a sequence of integers a1, a2, ..., an and q pairs of integers (l1, r1), (l2, r2), ..., (lq, rq), find count(l1, r1), count(l2, r2), ..., coun...]]></description><category></category></item><item><title><![CDATA[HDU 5929	Basic Data Structure  双向队列]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/81110236</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/81110236</guid><author>DlPF_C</author><pubDate>Thu, 19 Jul 2018 10:16:55 +0800</pubDate><description><![CDATA[Mr. Frog learned a basic data structure recently, which is called stack.There are some basic operations of stack： 
∙∙ PUSH x： put x on the top of the stack, x must be 0 or 1. 
∙∙ POP： throw the elemen...]]></description><category></category></item><item><title><![CDATA[ZOJ - 3735 Josephina and RPG]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/80554232</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/80554232</guid><author>DlPF_C</author><pubDate>Sun, 03 Jun 2018 09:35:19 +0800</pubDate><description><![CDATA[Josephina and RPGTime Limit: 2 Seconds      Memory Limit: 65536 KB      Special JudgeA role-playing game (RPG and sometimes roleplaying game) is a game in which players assume the roles of characters ...]]></description><category></category></item><item><title><![CDATA[2018 西电校赛  E  Xieldy And His Password     DP]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/80149681</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/80149681</guid><author>DlPF_C</author><pubDate>Mon, 30 Apr 2018 15:36:58 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/107/E来源：牛客网题目描述众所周知，Xieldy最常用的口令是******。 为了改变这一现状，他random了一个01串，并从中截取了一段作为自己的口令。 他选择的口令满足以下条件： 1. 口令串表示的二进制数在十进制下可以被表示为3k(k&amp;gt;=0)。 2. 口令串可以有前导零。 现已经random出了01串...]]></description><category></category></item><item><title><![CDATA[2018 华中科技大学校赛  F Sorting Trees]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/80149158</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/80149158</guid><author>DlPF_C</author><pubDate>Mon, 30 Apr 2018 14:23:24 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/106/F来源：牛客网t’s universally acknowledged that there’re innumerable trees in the campus of HUST.       One day the tree manager of HUST asked you to sort N trees ...]]></description><category></category></item><item><title><![CDATA[2018 华中科技大学校赛  L Fresh Air  思维BFS]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/80148203</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/80148203</guid><author>DlPF_C</author><pubDate>Mon, 30 Apr 2018 11:34:33 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/106/L来源：牛客网It’s universally acknowledged that there’re innumerable trees in the campus of HUST.And you know that, trees have the special ability to refresh the ...]]></description><category></category></item><item><title><![CDATA[2018 华中科技校赛 K Walking  in the Forest  最大化最小值]]></title><link>https://blog.youkuaiyun.com/DlPF_C/article/details/80148117</link><guid>https://blog.youkuaiyun.com/DlPF_C/article/details/80148117</guid><author>DlPF_C</author><pubDate>Mon, 30 Apr 2018 11:25:02 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/106/K来源：牛客网题目描述 It’s universally acknowledged that there’re innumerable trees in the campus of HUST.Now you're going to walk through a large forest. There is a ...]]></description><category></category></item></channel></rss>