<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[weixin_30758821的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/weixin_30758821</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_30758821]]></copyright><item><title><![CDATA[CodeForces - 1221E Game With String（不平等博弈）]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431375</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431375</guid><author>weixin_30758821</author><pubDate>Tue, 08 Oct 2019 15:01:00 +0800</pubDate><description><![CDATA[Alice and Bob play a game. Initially they have a strings1,s2,…,sns1,s2,…,sn, consisting of only characters.andX. They take alternating turns, and Alice is moving first. During each turn, the ...]]></description><category></category></item><item><title><![CDATA[白鹭引擎EUI做H5活动  入门篇]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/101713658</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/101713658</guid><author>weixin_30758821</author><pubDate>Sun, 29 Sep 2019 11:49:00 +0800</pubDate><description><![CDATA[前言：本学习文档的目的是为了实现h5,或者简单的h5游戏，比如说，我们要实现一个可以左右，或者上下移动的场景的h5,在场景移动的过程中，会有相应的动画或者操作，我们通过 js 也可以实现，但是为了流畅度和更好的效果，还是需要借助一些引擎来实现，比如说 2d的渲染引擎 pixi.js 或者是本文档要学习的 Egret （白鹭）引擎；
作为刚接触游戏引擎的人，虽然没有相关使用经验，但是也听...]]></description><category></category></item><item><title><![CDATA[2019CCPC秦皇岛 E题 Escape（网络流）]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431376</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431376</guid><author>weixin_30758821</author><pubDate>Sat, 28 Sep 2019 20:33:00 +0800</pubDate><description><![CDATA[Escape
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 16Accepted Submission(s): 12
Problem Description
Given a maze of size n×m. ...]]></description><category></category></item><item><title><![CDATA[2019CCPC秦皇岛D题 Decimal]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431372</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431372</guid><author>weixin_30758821</author><pubDate>Sat, 28 Sep 2019 20:09:00 +0800</pubDate><description><![CDATA[Decimal
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 103Accepted Submission(s): 49
Problem Description
Given a positive integer...]]></description><category></category></item><item><title><![CDATA[2019CCPC秦皇岛I题 Invoker(DP)]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431373</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431373</guid><author>weixin_30758821</author><pubDate>Sat, 28 Sep 2019 20:08:00 +0800</pubDate><description><![CDATA[Invoker
Time Limit: 15000/12000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 117Accepted Submission(s): 35
Problem Description
In dota2, there is a h...]]></description><category></category></item><item><title><![CDATA[2019CCPC秦皇岛 F Forest Program]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431370</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431370</guid><author>weixin_30758821</author><pubDate>Sat, 28 Sep 2019 20:05:00 +0800</pubDate><description><![CDATA[队友过的：https://blog.youkuaiyun.com/liufengwei1/article/details/101632506
Forest Program
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 124...]]></description><category></category></item><item><title><![CDATA[2019CCPC秦皇岛 J MUV LUV EXTRA（KMP）]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431369</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431369</guid><author>weixin_30758821</author><pubDate>Sat, 28 Sep 2019 19:57:00 +0800</pubDate><description><![CDATA[MUV LUV EXTRA
Time Limit: 2000/1500 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 134Accepted Submission(s): 49
Problem Description
One day, Kagami Su...]]></description><category></category></item><item><title><![CDATA[2019CCPC秦皇岛 K MUV LUV UNLIMITED(博弈)]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431366</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431366</guid><author>weixin_30758821</author><pubDate>Sat, 28 Sep 2019 19:39:00 +0800</pubDate><description><![CDATA[MUV LUV UNLIMITED
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 143Accepted Submission(s): 16
Problem Description
联合国太平洋方面第11军横滨...]]></description><category></category></item><item><title><![CDATA[关于C++线程池的实现的思考]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102299183</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102299183</guid><author>weixin_30758821</author><pubDate>Thu, 26 Sep 2019 14:53:00 +0800</pubDate><description><![CDATA[　　今天突然对前些日子一直很疑惑的c++线程池有了新的想法。其实所谓的线程池无非就是两个技术点，一个，多线程，指工作线程和主线程分离，或者说数据接收和处理分两个线程，一般就是讲需要运行的函数放到子线程执行，这个在C++目前版本可以用std::thread来实现。另外一个是池，池子嘛，可以反复装东西，也就是子线程的服用问题，可以这样考虑，在线程池类中添加一个队列，用来存储需要执行的函数，然...]]></description><category></category></item><item><title><![CDATA[Elasticsearch logstash filter]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/101863783</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/101863783</guid><author>weixin_30758821</author><pubDate>Wed, 25 Sep 2019 18:38:00 +0800</pubDate><description><![CDATA[参照官方文档：
https://www.elastic.co/guide/en/logstash/current/advanced-pipeline.html

demo-pipeline.conf

input {
    beats {
        port =&gt; "5044"
    }
}
 filter {
    grok {
      ...]]></description><category></category></item><item><title><![CDATA[ELK filebeat的安装]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/101863779</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/101863779</guid><author>weixin_30758821</author><pubDate>Wed, 25 Sep 2019 18:32:00 +0800</pubDate><description><![CDATA[安装参考官方文档：
https://www.elastic.co/guide/en/beats/filebeat/current/filebeat-installation.html

注意事项：
From the PowerShell prompt, run the following commands to install Filebeat as a Windows ser...]]></description><category></category></item><item><title><![CDATA[2018 牛客国庆集训派对Day4 - H 树链博弈]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431363</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431363</guid><author>weixin_30758821</author><pubDate>Wed, 25 Sep 2019 16:41:00 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/contest/204/H来源：牛客网
题目描述




给定一棵 n 个点的树，其中 1 号结点是根，每个结点要么是黑色要么是白色 现在小 Bo 和小 Biao 要进行博弈，他们两轮流操作，每次选择一个黑色的结点将它变白，之后可以选择任意多个(可以不选)该点的祖先(不包含自己)，然后将这些点的颜色翻转，不能进行操...]]></description><category></category></item><item><title><![CDATA[HDU3032 Nim or not Nim?(Lasker’s Nim游戏)]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431354</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431354</guid><author>weixin_30758821</author><pubDate>Wed, 25 Sep 2019 14:32:00 +0800</pubDate><description><![CDATA[Nim or not Nim?
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3759Accepted Submission(s): 1937
Problem Description
Nim is a two-pl...]]></description><category></category></item><item><title><![CDATA[POJ1704 Georgia and Bob(Nim博弈变形)]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431361</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431361</guid><author>weixin_30758821</author><pubDate>Wed, 25 Sep 2019 14:29:00 +0800</pubDate><description><![CDATA[Georgia and Bob




Time Limit:1000MS

Memory Limit:10000K


Total Submissions:14312

Accepted:4840




Description
Georgia and Bob decide to play a self-invented ...]]></description><category></category></item><item><title><![CDATA[关于.net中使用reportview所需注意]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/101389130</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/101389130</guid><author>weixin_30758821</author><pubDate>Tue, 24 Sep 2019 21:36:00 +0800</pubDate><description><![CDATA[参考文章链接：http://www.cnblogs.com/watercold/p/5258608.html
这段时间在做一个winform的小项目时，发现使用.net中的ReportViewer插件的时候出现了一些小问题，这里码住。
使用ReportViewer需注意打包时需要将dll文件引用到exe目录。否则会出现他人使用时找不到文件的错误，例如：


遇见类似错误，只需...]]></description><category></category></item><item><title><![CDATA[gdb 调试中No symbol “***” in current context解决方法]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102299181</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102299181</guid><author>weixin_30758821</author><pubDate>Tue, 24 Sep 2019 15:17:00 +0800</pubDate><description><![CDATA[主要是因为GCC/G++版本和GDB不匹配造成的，网上也有说是因为O2优化问题，具体啥原因需要自己尝试一下。
解决：
放狗搜索，解决办法是在编译是加-gdwarf-3即可，出现这样的原因是gcc,gdb的版本不匹配造成的。
参考：
https://blog.youkuaiyun.com/u013573789/article/details/45564289
https://blog.csd...]]></description><category></category></item><item><title><![CDATA[第二章、URL与资源]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102151927</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102151927</guid><author>weixin_30758821</author><pubDate>Sun, 22 Sep 2019 20:11:00 +0800</pubDate><description><![CDATA[1 URL统一资源定位符
URL 是浏览器寻找信息时所需的资源位置。通过 URL，人类和应用程序才能找到、使用并共享因特网上大量的数据资源。URL是作为URI的一个子集，URI是一类更通用的资源标识符，主要是由URL和URN构成。HTTP 规范将更通用的概念 URI 作为其资源标识符，但实际上，HTTP 应用程序处理的只是 URI 的 URL 子集。
URL主要内容由三部分组成
...]]></description><category></category></item><item><title><![CDATA[sed基础]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102151928</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102151928</guid><author>weixin_30758821</author><pubDate>Sat, 21 Sep 2019 22:54:00 +0800</pubDate><description><![CDATA[sed 文本流编辑的 行编辑器

hold space ：保持空间。仓库，半成品









一次从文件中读取一行，放到自己编辑的内存缓冲空间即模式空间，不会编辑原文件；根据所给定的命令在模式空间中做编辑处理，处理结果默认输出到显示屏


sed [OPTION]... {script-only-if-no-other-script}...]]></description><category></category></item><item><title><![CDATA[C++ 11 +，开坑。]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102299182</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102299182</guid><author>weixin_30758821</author><pubDate>Sat, 21 Sep 2019 14:55:00 +0800</pubDate><description><![CDATA[最近换新工作了。工作中需要用到高端的c++11的一些操作，至于我后面又plus一下还是因为可能是c++14或者17中提供的一些操作。反正都是c++11以及之后的一些特性。
首先，今天看一下关于函数模板的问题。我前几天看到这样一段代码。

 1 #include &lt;iostream&gt;
 2 
 3 class test
 4 {
 5 private:
 6 p...]]></description><category></category></item><item><title><![CDATA[CF240E Road Repairs(最小树形图-记录路径)]]></title><link>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431359</link><guid>https://blog.youkuaiyun.com/weixin_30758821/article/details/102431359</guid><author>weixin_30758821</author><pubDate>Fri, 20 Sep 2019 19:48:00 +0800</pubDate><description><![CDATA[A country named Berland hasncities. They are numbered with integers from1ton. City with index1is the capital of the country. Some pairs of cities have monodirectional roads built between t...]]></description><category></category></item></channel></rss>