<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[PHILIP0917的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/PHILIP0917</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; PHILIP0917]]></copyright><item><title><![CDATA[hihoCoder 1582 Territorial Dispute 【凸包】（ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛）...]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593629</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593629</guid><author>PHILIP0917</author><pubDate>Mon, 02 Oct 2017 12:46:00 +0800</pubDate><description><![CDATA[#1582 : Territorial Dispute




时间限制:1000ms
单点时限:1000ms
内存限制:256MB


描述
In 2333, the C++ Empire and the Java Republic become the most powerful country in the world. They compete wi...]]></description><category></category></item><item><title><![CDATA[hihoCoder 1584 Bounce 【数学规律】 （ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛）...]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593628</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593628</guid><author>PHILIP0917</author><pubDate>Sun, 01 Oct 2017 15:01:00 +0800</pubDate><description><![CDATA[#1584 : Bounce




时间限制:1000ms
单点时限:1000ms
内存限制:256MB


描述
For Argo, it is very interesting watching a circle bouncing in a rectangle.
As shown in the figure below, the rectangle ...]]></description><category></category></item><item><title><![CDATA[hihoCoder 1578  Visiting Peking University 【贪心】 （ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛）...]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593627</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593627</guid><author>PHILIP0917</author><pubDate>Fri, 29 Sep 2017 16:51:00 +0800</pubDate><description><![CDATA[#1578 : Visiting Peking University




时间限制:1000ms
单点时限:1000ms
内存限制:256MB


描述
Ming is going to travel for n days and the date of these days can be represented by n integers: 0, 1,...]]></description><category></category></item><item><title><![CDATA[hihoCoder 1586 Minimum 【线段树】 (ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛)...]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593625</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593625</guid><author>PHILIP0917</author><pubDate>Fri, 29 Sep 2017 16:34:00 +0800</pubDate><description><![CDATA[#1586 : Minimum




时间限制:1000ms
单点时限:1000ms
内存限制:256MB


描述
You are given a list of integers a0, a1, …, a2^k-1.
You need to support two types of queries:
1. Output Minx,y∈[l,r]{...]]></description><category></category></item><item><title><![CDATA[HDU 6118 度度熊的交易计划 【最小费用最大流】 （2017"百度之星"程序设计大赛 - 初赛（B））...]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593626</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593626</guid><author>PHILIP0917</author><pubDate>Fri, 18 Aug 2017 13:34:00 +0800</pubDate><description><![CDATA[度度熊的交易计划
Time Limit: 12000/6000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1111Accepted Submission(s): 403
Problem Description
度度熊参与了喵哈哈村的商业大会，但是这次...]]></description><category></category></item><item><title><![CDATA[HDU 6119  小小粉丝度度熊 【预处理+尺取法】（2017"百度之星"程序设计大赛 - 初赛（B））...]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593623</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593623</guid><author>PHILIP0917</author><pubDate>Fri, 18 Aug 2017 13:26:00 +0800</pubDate><description><![CDATA[小小粉丝度度熊
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1572Accepted Submission(s): 513
Problem Description
度度熊喜欢着喵哈哈村的大明星——星星小姐。为...]]></description><category></category></item><item><title><![CDATA[HDU 6114 Chess 【组合数】（2017"百度之星"程序设计大赛 - 初赛（B））]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593624</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593624</guid><author>PHILIP0917</author><pubDate>Fri, 18 Aug 2017 12:50:00 +0800</pubDate><description><![CDATA[Chess
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 513Accepted Submission(s): 319
Problem Description
車是中国象棋中的一种棋子，它能攻击同一行或同一列中没有...]]></description><category></category></item><item><title><![CDATA[HDU 6109 数据分割 【并查集+set】 （2017"百度之星"程序设计大赛 - 初赛（A））]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593621</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593621</guid><author>PHILIP0917</author><pubDate>Sun, 13 Aug 2017 14:00:00 +0800</pubDate><description><![CDATA[数据分割
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1119Accepted Submission(s): 268
Problem Description
小w来到百度之星的赛场...]]></description><category></category></item><item><title><![CDATA[HDU 6108 小C的倍数问题 【数学】 （2017"百度之星"程序设计大赛 - 初赛（A））]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593622</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593622</guid><author>PHILIP0917</author><pubDate>Sun, 13 Aug 2017 11:39:00 +0800</pubDate><description><![CDATA[小C的倍数问题
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 481Accepted Submission(s): 278
Problem Description
根据小学数学的知识，我们知道一个正整数x是3的...]]></description><category></category></item><item><title><![CDATA[HDU 6122 今夕何夕 【数学公式】 （2017"百度之星"程序设计大赛 - 初赛（A））]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593620</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593620</guid><author>PHILIP0917</author><pubDate>Sun, 13 Aug 2017 11:33:00 +0800</pubDate><description><![CDATA[今夕何夕
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1295Accepted Submission(s): 455
Problem Description
今天是2017年8月6日，农历闰六月十五。小度独自...]]></description><category></category></item><item><title><![CDATA[HDU 6113 度度熊的01世界 【DFS】（2017"百度之星"程序设计大赛 - 初赛（A））]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593619</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593619</guid><author>PHILIP0917</author><pubDate>Sun, 13 Aug 2017 11:27:00 +0800</pubDate><description><![CDATA[度度熊的01世界
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1117Accepted Submission(s): 400
Problem Description
度度熊是一个喜欢计算机的孩子，在计算...]]></description><category></category></item><item><title><![CDATA[Vijos 1921 严厉的班长 【状态压缩动态规划】]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593618</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593618</guid><author>PHILIP0917</author><pubDate>Thu, 03 Aug 2017 12:24:00 +0800</pubDate><description><![CDATA[严厉的班长











描述
木姑娘在班级里面是班长。虽然是副班长，却有着比正班长更高的威信，并深受小朋友们的爱戴。
每天眼保健操时间，木姑娘都要监督所有小朋友认真做眼保健操。整个过程被描述为n个时间段，第i个时间段内对于揉捏穴位的速度被要求为a[i]。
如果某一位小朋友在n个时间段内，速度分别为b[1],b[2],...,b[...]]></description><category></category></item><item><title><![CDATA[XMU C语言程序设计实践（5）]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593617</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593617</guid><author>PHILIP0917</author><pubDate>Wed, 28 Jun 2017 17:35:00 +0800</pubDate><description><![CDATA[•使用动态链表完成一个简单的商品库存信息管理系统。
•商品信息包括如下字段：商品号、商品名称、商品库存
•函数
create：接收用户输入的商品号和商品名称的信息，建立链表；库存初始化为0，没有进货之前不允许销售；商品号为0表示用户输入结束。本函数用于初始化，如果第二次被调用的时候，首先要执行destroy清除旧链表。
destroy...]]></description><category></category></item><item><title><![CDATA[XMU C语言程序设计实践（4）]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593359</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593359</guid><author>PHILIP0917</author><pubDate>Wed, 28 Jun 2017 17:34:00 +0800</pubDate><description><![CDATA[以下实验二选一。
1、使用队列实现迷宫算法，找到最短路径。
2、实现顺序队列和链队列的所有基本操作，InitQueue(&amp;Q)；DestroyQueue(&amp;Q)；ClearQueue(&amp;Q)；QueueEmpty(Q)；QueueLength(Q)；GetHead(Q, &amp;e); EnQueue(&amp;Q, e)；DeQueue(&amp;Q,...]]></description><category></category></item><item><title><![CDATA[XMU C语言程序设计实践（3）]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593357</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593357</guid><author>PHILIP0917</author><pubDate>Wed, 28 Jun 2017 17:29:00 +0800</pubDate><description><![CDATA[问题描述：
以一个n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍，设计一个程序,对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。
对于本问题需用栈实现“穷举求解”算法，即：从入口出发，顺着某一个方向进行探索，若能走通，则继续往前进；否则沿着原路退回，换一个方向继续探索，直至出口位置，求得一条通路。加入所有可能的通路都探索到而未能到达出口，则所设定的迷宫没...]]></description><category></category></item><item><title><![CDATA[XMU C语言程序设计实践（2）]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593615</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593615</guid><author>PHILIP0917</author><pubDate>Wed, 28 Jun 2017 17:24:00 +0800</pubDate><description><![CDATA[任务一：颠倒的世界

小明最近突然喜欢倒着写字，写出来的句子全是颠倒的，也就是把一句话里的字符全都逆序写，譬如“I Love This Game！”，他就偏偏要写成“!emaG sihT evoL I”弄的小华同他Email交流都很难受。请你帮助小华解决这个问题，将输入的字符串全都还原成本来的面目。

任务1要求：
利用main函数带参数的功能，编写程序，将命令行中的字...]]></description><category></category></item><item><title><![CDATA[XMU C语言程序设计实践（1）]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593616</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593616</guid><author>PHILIP0917</author><pubDate>Wed, 28 Jun 2017 17:20:00 +0800</pubDate><description><![CDATA[题目：

任务1：英雄出世

炎热的夏天午后，小明正在百无聊赖地写c语言程序。忽然，电脑屏幕一阵抖动，浮现下面18×18个看似杂乱无章的数字：

 32, 32, 32, 32, 32, 32, 32, 32, 32, 95, 45, 126, 126, 126, 126, 126, 45, 95,
 32, 32, 32, 32, ...]]></description><category></category></item><item><title><![CDATA[XMU 1071 圣斗士黄金十二宫（七）银河星爆 【计算几何】]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593613</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593613</guid><author>PHILIP0917</author><pubDate>Thu, 22 Jun 2017 15:44:00 +0800</pubDate><description><![CDATA[1071: 圣斗士黄金十二宫（七）银河星爆
Time Limit:500 MSMemory Limit:64 MBSubmit:193Solved:10[Submit][Status][Web Board]
Description

　　撒加回答了星矢的第一个问题，但是当星矢要问第二个问题时，撒加的头发全变白了。白撒加的实力是无人能及的，星矢被废去了五感。这时...]]></description><category></category></item><item><title><![CDATA[XMU 1617 刘备闯三国之汉中之战 【BFS+染色】]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593614</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593614</guid><author>PHILIP0917</author><pubDate>Sun, 23 Apr 2017 22:55:00 +0800</pubDate><description><![CDATA[1617: 刘备闯三国之汉中之战
Time Limit:1000 MSMemory Limit:128 MBSubmit:6Solved:5[Submit][Status][Web Board]
Description


    刘备（161年－223年6月10日），字玄德，东汉末年幽州涿郡涿县，西汉中山靖王刘胜的后代。刘备一生极具传奇色彩，早年颠...]]></description><category></category></item><item><title><![CDATA[XMU 1615 刘备闯三国之三顾茅庐（三） 【欧拉函数+快速幂+欧拉定理】]]></title><link>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593612</link><guid>https://blog.youkuaiyun.com/PHILIP0917/article/details/101593612</guid><author>PHILIP0917</author><pubDate>Sun, 23 Apr 2017 22:47:00 +0800</pubDate><description><![CDATA[1615: 刘备闯三国之三顾茅庐（三）
Time Limit:1000 MSMemory Limit:128 MBSubmit:45Solved:8[Submit][Status][Web Board]
Description



    刘备（161年－223年6月10日），字玄德，东汉末年幽州涿郡涿县，西汉中山靖王刘胜的后代。刘备一生极具传...]]></description><category></category></item></channel></rss>