<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[TRiddle的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/TRiddle</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; TRiddle]]></copyright><item><title><![CDATA[支持向量机无痛入门]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/105956855</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/105956855</guid><author>TRiddle</author><pubDate>Wed, 06 May 2020 19:06:51 +0800</pubDate><description><![CDATA[引子
所谓传统机器学习，在一部分情况下——特别是早些年——是在解决“用平面将两类点分开”的问题。我们之所以要解决这种问题，是因为它对应了现实生活中的某种问题。
比方说，如果我想找到自己的另一半，那么首先我需要学会在心里描述一个人。例如“ta是一个女性、喜欢音乐”这就是对一个人的描述，“女性”和“喜欢音乐”就是这个人的属性。如果有需要的话，我甚至可以将人抽象为一个数据点 $x = (x_1, x_2...]]></description><category></category></item><item><title><![CDATA[【解题报告】 Educational Codeforces Round 40]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/79668061</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/79668061</guid><author>TRiddle</author><pubDate>Sat, 24 Mar 2018 01:34:18 +0800</pubDate><description><![CDATA[题目链接





A. Diagonal Walking（Codeforces 954A）



题意

给出一个仅含RRR和UUU的字符串。问如何进行一系列操作（每次操作可以将连续的RURURU或URURUR替换DDD），使得最后得到的字符串长度最小。



思路

本题的入手点是，先贪心地提出一个算法，再看看有没有更优的算法。 
显然，我们可以提出这样的贪心算法：从左到右依次考虑字符串sss...]]></description><category></category></item><item><title><![CDATA[欧几里得算法与不定方程]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/72825546</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/72825546</guid><author>TRiddle</author><pubDate>Wed, 31 May 2017 23:31:55 +0800</pubDate><description><![CDATA[。]]></description><category></category></item><item><title><![CDATA[若干数组查找问题及相关高效算法（未完待续）]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/72825407</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/72825407</guid><author>TRiddle</author><pubDate>Wed, 31 May 2017 23:23:04 +0800</pubDate><description><![CDATA[。]]></description><category></category></item><item><title><![CDATA[【解题报告】Educational Codeforces Round 21]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/72818273</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/72818273</guid><author>TRiddle</author><pubDate>Wed, 31 May 2017 10:32:54 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】Educational Codeforces Round 20]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/71828213</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/71828213</guid><author>TRiddle</author><pubDate>Sat, 13 May 2017 16:00:33 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【学习笔记】用算法题介绍C++的pb_ds库中的可并堆]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/71001764</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/71001764</guid><author>TRiddle</author><pubDate>Sun, 30 Apr 2017 11:28:56 +0800</pubDate><description><![CDATA[如题。]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/70991594</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/70991594</guid><author>TRiddle</author><pubDate>Sat, 29 Apr 2017 23:43:28 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #410 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/70432596</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/70432596</guid><author>TRiddle</author><pubDate>Sat, 22 Apr 2017 14:34:58 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】  Educational Codeforces Round 19]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/70196543</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/70196543</guid><author>TRiddle</author><pubDate>Sun, 16 Apr 2017 17:16:52 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/68930039</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/68930039</guid><author>TRiddle</author><pubDate>Fri, 31 Mar 2017 20:03:52 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #402 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/68922957</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/68922957</guid><author>TRiddle</author><pubDate>Fri, 31 Mar 2017 11:12:57 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/60599683</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/60599683</guid><author>TRiddle</author><pubDate>Mon, 06 Mar 2017 21:30:57 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/59748096</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/59748096</guid><author>TRiddle</author><pubDate>Thu, 02 Mar 2017 23:16:50 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #401 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/57086391</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/57086391</guid><author>TRiddle</author><pubDate>Sat, 25 Feb 2017 17:55:44 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #395 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/55684690</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/55684690</guid><author>TRiddle</author><pubDate>Sat, 18 Feb 2017 23:43:37 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #390 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/54799104</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/54799104</guid><author>TRiddle</author><pubDate>Tue, 31 Jan 2017 12:52:59 +0800</pubDate><description><![CDATA[简略的解题报告]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Round #392 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/54783257</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/54783257</guid><author>TRiddle</author><pubDate>Mon, 30 Jan 2017 16:55:46 +0800</pubDate><description><![CDATA[简略的解题报告。]]></description><category></category></item><item><title><![CDATA[【学习笔记】LaTex数学符号极简速查]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/53959368</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/53959368</guid><author>TRiddle</author><pubDate>Sat, 31 Dec 2016 23:50:56 +0800</pubDate><description><![CDATA[.]]></description><category></category></item><item><title><![CDATA[【解题报告】Codeforces Good Bye 2016]]></title><link>https://blog.youkuaiyun.com/TRiddle/article/details/53958864</link><guid>https://blog.youkuaiyun.com/TRiddle/article/details/53958864</guid><author>TRiddle</author><pubDate>Sat, 31 Dec 2016 22:52:38 +0800</pubDate><description><![CDATA[简略的解题报告]]></description><category></category></item></channel></rss>