<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Snakeflute的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Snakeflute</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Snakeflute]]></copyright><item><title><![CDATA[OpenGL 窗口创建]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/62892302</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/62892302</guid><author>Snakeflute</author><pubDate>Fri, 17 Mar 2017 17:22:07 +0800</pubDate><description><![CDATA[使用OpenGL实用库的第一步是初始化GLUT:
glutInit(&argc, argv);              
接着, 是说明展示窗口的标题:
    glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB);    
下面就是指定显示窗口需要显示的内容, 使用OpenGL函数创建一个图并把图的定义传给GLUT函数glutDisplayFunc(即将图赋给显]]></description><category></category></item><item><title><![CDATA[HDU 4027 - Can you answer these queries?(线段树)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/62225004</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/62225004</guid><author>Snakeflute</author><pubDate>Wed, 15 Mar 2017 14:55:16 +0800</pubDate><description><![CDATA[Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others) 
Total Submission(s): 15043    Accepted Submission(s): 3529Problem Description 
A lot of]]></description><category></category></item><item><title><![CDATA[POJ 3368 - Frequent values(离散化ST)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/61927281</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/61927281</guid><author>Snakeflute</author><pubDate>Mon, 13 Mar 2017 20:54:08 +0800</pubDate><description><![CDATA[Frequent values 
Time Limit: 2000MS      Memory Limit: 65536K 
Total Submissions: 18364        Accepted: 6602 
DescriptionYou are given a sequence of n integers a1 , a2 , … , an in non-decreasing order]]></description><category></category></item><item><title><![CDATA[Codeforces 367B - Sereja ans Anagrams(map)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/61919661</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/61919661</guid><author>Snakeflute</author><pubDate>Mon, 13 Mar 2017 16:00:19 +0800</pubDate><description><![CDATA[B. Sereja ans Anagrams 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Sereja has two sequences a and b and number p. Sequence a consists o]]></description><category></category></item><item><title><![CDATA[POJ 3191 - The Moronic Cowmpouter(进制转换)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/61917446</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/61917446</guid><author>Snakeflute</author><pubDate>Mon, 13 Mar 2017 14:41:29 +0800</pubDate><description><![CDATA[The Moronic Cowmpouter 
Time Limit: 1000MS      Memory Limit: 65536K 
Total Submissions: 4192     Accepted: 2168 
DescriptionInexperienced in the digital arts, the cows tried to build a calculating eng]]></description><category></category></item><item><title><![CDATA[POJ 3186 - Treats for the Cows(DP)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/61917071</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/61917071</guid><author>Snakeflute</author><pubDate>Mon, 13 Mar 2017 14:27:42 +0800</pubDate><description><![CDATA[Treats for the Cows 
Time Limit: 1000MS      Memory Limit: 65536K 
Total Submissions: 5729     Accepted: 2963 
DescriptionFJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for]]></description><category></category></item><item><title><![CDATA[Codeforces 367A - Sereja and Algorithm(前缀和)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/61203050</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/61203050</guid><author>Snakeflute</author><pubDate>Fri, 10 Mar 2017 18:21:17 +0800</pubDate><description><![CDATA[A. Sereja and Algorithm 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Sereja loves all sorts of algorithms. He has recently come up with]]></description><category></category></item><item><title><![CDATA[Codeforces 366D - Dima and Trap Graph(DFS)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/61198102</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/61198102</guid><author>Snakeflute</author><pubDate>Fri, 10 Mar 2017 15:36:58 +0800</pubDate><description><![CDATA[D. Dima and Trap Graph 
time limit per test3 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Dima and Inna love spending time together. The problem is, Seryozha]]></description><category></category></item><item><title><![CDATA[Codeforces 366C - Dima and Salad(DP)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/60966137</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/60966137</guid><author>Snakeflute</author><pubDate>Thu, 09 Mar 2017 19:42:03 +0800</pubDate><description><![CDATA[C. Dima and Salad 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Dima, Inna and Seryozha have gathered in a room. That’s right, someone’s]]></description><category></category></item><item><title><![CDATA[Codeforces 450D - Jzzhu and Cities(最短路)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/60574402</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/60574402</guid><author>Snakeflute</author><pubDate>Mon, 06 Mar 2017 13:13:20 +0800</pubDate><description><![CDATA[D. Jzzhu and Cities 
time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Jzzhu is the president of country A. There are n cities numbered from]]></description><category></category></item><item><title><![CDATA[Codeforces 362D - Fools and Foolproof Roads(并查集+优先队列)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/60143695</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/60143695</guid><author>Snakeflute</author><pubDate>Fri, 03 Mar 2017 17:35:34 +0800</pubDate><description><![CDATA[D. Fools and Foolproof Roads 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
You must have heard all about the Foolland on your Geography l]]></description><category></category></item><item><title><![CDATA[Codeforces 552C - Vanya and Scales(数学)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/59581286</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/59581286</guid><author>Snakeflute</author><pubDate>Thu, 02 Mar 2017 17:56:41 +0800</pubDate><description><![CDATA[C. Vanya and Scales 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Vanya has a scales for weighing loads and weights of masses w0, w1, w2,]]></description><category></category></item><item><title><![CDATA[Codeforces 552B - Vanya and Books(数学)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/59577378</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/59577378</guid><author>Snakeflute</author><pubDate>Thu, 02 Mar 2017 17:46:27 +0800</pubDate><description><![CDATA[B. Vanya and Books 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Vanya got an important task — he should enumerate books in the library a]]></description><category></category></item><item><title><![CDATA[Codeforces 551C - GukiZ hates Boxes(贪心二分)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/59150513</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/59150513</guid><author>Snakeflute</author><pubDate>Wed, 01 Mar 2017 21:22:03 +0800</pubDate><description><![CDATA[C. GukiZ hates Boxes 
time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Professor GukiZ is concerned about making his way to school, because]]></description><category></category></item><item><title><![CDATA[Codeforces 550D - Regular Bridge(构造)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/57496611</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/57496611</guid><author>Snakeflute</author><pubDate>Sun, 26 Feb 2017 21:36:08 +0800</pubDate><description><![CDATA[D. Regular Bridge 
time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
An undirected graph is called k-regular, if the degrees of all its verti]]></description><category></category></item><item><title><![CDATA[Codeforces 550C - Divisibility by Eight(思维)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/57081331</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/57081331</guid><author>Snakeflute</author><pubDate>Sat, 25 Feb 2017 15:00:14 +0800</pubDate><description><![CDATA[C. Divisibility by Eight 
time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
You are given a non-negative integer n, its decimal representatio]]></description><category></category></item><item><title><![CDATA[Codeforces 363D - Renting Bikes(贪心二分)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/56841086</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/56841086</guid><author>Snakeflute</author><pubDate>Fri, 24 Feb 2017 14:47:07 +0800</pubDate><description><![CDATA[D. Renting Bikes 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
A group of n schoolboys decided to ride bikes. As nobody of them has a bik]]></description><category></category></item><item><title><![CDATA[POJ 1182 - 食物链(种类并查集)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/56675546</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/56675546</guid><author>Snakeflute</author><pubDate>Thu, 23 Feb 2017 16:40:03 +0800</pubDate><description><![CDATA[食物链 
Time Limit: 1000MS      Memory Limit: 10000K 
Total Submissions: 67959        Accepted: 20089 
Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。  
现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到]]></description><category></category></item><item><title><![CDATA[Codeforces 361C - Levko and Array Recovery(贪心)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/56496348</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/56496348</guid><author>Snakeflute</author><pubDate>Wed, 22 Feb 2017 20:34:47 +0800</pubDate><description><![CDATA[C. Levko and Array Recovery 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Levko loves array a1, a2, … , an, consisting of integers, very]]></description><category></category></item><item><title><![CDATA[Codeforces 548C - Mike and Frog(暴力循环节)]]></title><link>https://blog.youkuaiyun.com/Snakeflute/article/details/56291163</link><guid>https://blog.youkuaiyun.com/Snakeflute/article/details/56291163</guid><author>Snakeflute</author><pubDate>Tue, 21 Feb 2017 18:03:09 +0800</pubDate><description><![CDATA[C. Mike and Frog 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Mike has a frog and a flower. His frog is named Xaniar and his flower is n]]></description><category></category></item></channel></rss>