<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qi_programmer的博客]]></title><description><![CDATA[梦回江南的小窝]]></description><link>https://blog.youkuaiyun.com/qi_programmer</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qi_programmer]]></copyright><item><title><![CDATA[用三角函数解决几何问题]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/130537261</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/130537261</guid><author>qi_programmer</author><pubDate>Sun, 07 May 2023 00:13:39 +0800</pubDate><description><![CDATA[的延长线上，展开铺平，过点。]]></description><category></category></item><item><title><![CDATA[函数知识点总结]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/128770872</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/128770872</guid><author>qi_programmer</author><pubDate>Fri, 27 Jan 2023 20:01:58 +0800</pubDate><description><![CDATA[口诀：左右平移，左加右减；上下平移，上加下减。一般地，如果在一个变化过程中有两个变量。都有唯一的值与它对应，那么我们称。注：坐标轴上的点不属于任何象限。列表法、关系式法、图像法。上的点的纵坐标相等；上的点的横坐标相等。]]></description><category></category></item><item><title><![CDATA[线段树详解（包含加法线段树、乘法线段树及区间根号线段树，简单易懂）]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/128270136</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/128270136</guid><author>qi_programmer</author><pubDate>Mon, 12 Dec 2022 19:32:55 +0800</pubDate><description><![CDATA[线段树及简单应用。]]></description><category></category></item><item><title><![CDATA[秦九韶算法c++]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/127883004</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/127883004</guid><author>qi_programmer</author><pubDate>Thu, 17 Nov 2022 12:44:48 +0800</pubDate><description><![CDATA[秦九韶算法]]></description><category></category></item><item><title><![CDATA[CSP注意事项]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/126907842</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/126907842</guid><author>qi_programmer</author><pubDate>Sat, 17 Sep 2022 18:33:24 +0800</pubDate><description><![CDATA[CSP注意事项
]]></description><category></category></item><item><title><![CDATA[数字三角形（洛谷P1216）基础dp]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/125714544</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/125714544</guid><author>qi_programmer</author><pubDate>Mon, 11 Jul 2022 09:02:49 +0800</pubDate><description><![CDATA[传送门]]></description><category></category></item><item><title><![CDATA[c++俄罗斯方块]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/125025137</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/125025137</guid><author>qi_programmer</author><pubDate>Sat, 28 May 2022 23:29:35 +0800</pubDate><description><![CDATA[//上下左右键控制
#include&lt;bits/stdc++.h&gt;
#include&lt;windows.h&gt;
int a[24][17],i,j,tim=800,ti=800,shape=0,b,bn,ta[4][4],turn[4][4],nex[4][4],nextshape,add=0,score=0,speed=1,ok=1,mouse=0,best=0;
void Place(const int x, const int y)
{
COORD PlaceCursorHere;]]></description><category></category></item><item><title><![CDATA[关于深搜优化的一点想法]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/124448638</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/124448638</guid><author>qi_programmer</author><pubDate>Fri, 13 May 2022 13:04:36 +0800</pubDate><description><![CDATA[深搜剪枝]]></description><category></category></item><item><title><![CDATA[实现next_permutation]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/124020712</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/124020712</guid><author>qi_programmer</author><pubDate>Thu, 07 Apr 2022 16:48:39 +0800</pubDate><description><![CDATA[讲暴力枚举或深搜时会讲到 《全排列问题》。其原理是深搜。
那么如何自己实现一个next_permutation呢·？
一、深搜
代码就不贴了，比较基础。
二、指针
我们可以用指针快速实现：
#include &lt;algorithm&gt;
#include &lt;iostream&gt;
using namespace std;

int a[10005];

template &lt;class T&gt;
bool _next_permutation(T first, T last)
{
    ]]></description><category></category></item><item><title><![CDATA[关于c++中的各种排序]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/123995844</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/123995844</guid><author>qi_programmer</author><pubDate>Wed, 06 Apr 2022 17:51:20 +0800</pubDate><description><![CDATA[干货来了————
排序算法主要包括：计数排序（桶排序）、插入排序、选择排序、冒泡排序、快速排序等。那这些排序的效率如何呢？
文章目录主程序生成数据程序输入数据输出文件
主程序
#include &lt;ctime&gt;
#include &lt;cstdio&gt;
#include &lt;iostream&gt;
#include &lt;memory.h&gt;
#define endl '\n'
using namespace std;

int n, maxn;
int a[20005], b[]]></description><category></category></item><item><title><![CDATA[c++算法——欧拉筛]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/123957979</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/123957979</guid><author>qi_programmer</author><pubDate>Mon, 04 Apr 2022 18:50:29 +0800</pubDate><description><![CDATA[文章目录引入模板比对
引入
大家都知道埃氏筛吧？
#include &lt;iostream&gt;
#define maxn 1005
#define endl '\n'
#define LL long long
#define L unsigned long long
#define I unsigned int
using namespace std;

int visit[maxn];

void work()
{
    ios_base::sync_with_stdio(false);
    ]]></description><category></category></item><item><title><![CDATA[c++格式化代码]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/123203230</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/123203230</guid><author>qi_programmer</author><pubDate>Tue, 01 Mar 2022 12:56:26 +0800</pubDate><description><![CDATA[文章目录一、头文件二、定义变量三、赋值、判断四、其他
一、头文件
#include &lt;cstdio&gt;	//若是标准头文件则用 &lt;&gt;
#include "music.h"	//若是自己写的头文件则用 ""
//#include 后加空格

二、定义变量
int n, m;	//建议在逗号后加空格

三、赋值、判断
a = 0;
if (a == 0) {
	……
}

四、其他
int main() {

}


...]]></description><category></category></item><item><title><![CDATA[c++线性表]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/123045050</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/123045050</guid><author>qi_programmer</author><pubDate>Thu, 24 Feb 2022 13:06:22 +0800</pubDate><description><![CDATA[线性表的分类 （简单 STL）一、长度可变数组 vector二、栈 stack （稍慢，最好手写栈）三、队列 queue四、链表 list
一、长度可变数组 vector
二、栈 stack （稍慢，最好手写栈）
三、队列 queue
四、链表 list

...]]></description><category></category></item><item><title><![CDATA[c++子集枚举]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/123044768</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/123044768</guid><author>qi_programmer</author><pubDate>Mon, 21 Feb 2022 13:09:30 +0800</pubDate><description><![CDATA[相信大家都做过 烤鸡 这道题。但 101010 个循环实在太麻烦。若要 100、1000100、1000100、1000 个循环呢?

子集枚举！

文章目录一、子集枚举的定义二、代码实现三、例题P1657 选书时间限制内存限制题目描述输入格式输出格式输入输出样例输出 #1复制说明/提示分析四、复杂度分析
一、子集枚举的定义
什么是子集枚举？

对于一个数据，若每个数据只有 222 种状态，例如：选或不选，选第一种或第二种……这时，子集枚举就成为一种很好的选择。
因为每个数据只有 222 种状态，由此想到 ]]></description><category></category></item><item><title><![CDATA[c++快读快写]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/122972691</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/122972691</guid><author>qi_programmer</author><pubDate>Mon, 21 Feb 2022 12:26:50 +0800</pubDate><description><![CDATA[文章目录快读
快读



]]></description><category></category></item><item><title><![CDATA[关于万能头]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/122792800</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/122792800</guid><author>qi_programmer</author><pubDate>Sat, 05 Feb 2022 20:09:35 +0800</pubDate><description><![CDATA[#include &lt;bits/stdc++.h&gt;	//万能头文件

#include &lt;cstdio&gt;
#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;
#include &lt;float.h&gt;
#include &lt;ctype.h&gt;
#include &lt;map&gt;
#include &lt;stdbool]]></description><category></category></item><item><title><![CDATA[深度优先搜索]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/122730282</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/122730282</guid><author>qi_programmer</author><pubDate>Fri, 28 Jan 2022 13:48:25 +0800</pubDate><description><![CDATA[深度优先搜索，简称深搜， DFSDFSDFS
基础模板：
#include &lt;cstdio&gt;
#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;
#include &lt;float.h&gt;
#include &lt;ctype.h&gt;
#include &lt;map&gt;
#include &lt;stdbool.h&gt;
usin]]></description><category></category></item><item><title><![CDATA[c++常用头文件]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/122672586</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/122672586</guid><author>qi_programmer</author><pubDate>Mon, 24 Jan 2022 18:09:39 +0800</pubDate><description><![CDATA[#include &lt;cstdio&gt;
#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;
#include &lt;float.h&gt;
#include &lt;ctype.h&gt;
#include &lt;map&gt;
#include &lt;stdbool.h&gt;
using namespace std;


]]></description><category></category></item><item><title><![CDATA[二分查找与二分答案]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/122606673</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/122606673</guid><author>qi_programmer</author><pubDate>Thu, 20 Jan 2022 18:39:44 +0800</pubDate><description><![CDATA[基础·版子
#include&lt;bits/stdc++.h&gt;
using namespace std;
int x,n,mid,high,low=1;
int main(){
	cin&gt;&gt;x&gt;&gt;n;
	high=n;
	while(low&lt;high){
		mid=(high+low)/2;
		if(mid&lt;x) 
			low=mid+1;
		else 
			high=mid;
		cout&lt;&lt;low&lt;&lt;','&lt;&lt;hi]]></description><category></category></item><item><title><![CDATA[c++音乐头文件]]></title><link>https://blog.youkuaiyun.com/qi_programmer/article/details/122321189</link><guid>https://blog.youkuaiyun.com/qi_programmer/article/details/122321189</guid><author>qi_programmer</author><pubDate>Wed, 05 Jan 2022 13:05:00 +0800</pubDate><description><![CDATA[#ifndef MUSIC_H
#define MUSIC_H
#include&lt;bits/stdc++.h&gt;
#include&lt;windows.h&gt;
#define qdo 262 
#define qre 294
#define qmi 330
#define qfa 349
#define qso 392
#define qla 440
#define qsi 494
#define do 523
#define re 578
#define mi 659
#define fa]]></description><category></category></item></channel></rss>