风骨散人 - 博客园

摘要： IntervalsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 30971 Accepted: 11990DescriptionYou are... 阅读全文

posted @ 2019-11-18 22:11 风骨散人阅读(98) 评论(0) 推荐(0)

摘要： DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ... 阅读全文

posted @ 2019-11-18 21:54 风骨散人阅读(137) 评论(0) 推荐(0)

摘要： DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.Write a program t... 阅读全文

posted @ 2019-11-18 21:29 风骨散人阅读(104) 评论(0) 推荐(0)

摘要： Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 #include#... 阅读全文

posted @ 2019-11-18 21:01 风骨散人阅读(126) 评论(0) 推荐(0)

摘要： #include using namespace std;templateclass Stack{private: struct Node { T data; Node *next; }; Node *hea... 阅读全文

posted @ 2019-11-17 22:41 风骨散人阅读(151) 评论(0) 推荐(0)

摘要： #include #define MaxSize 5000using namespace std;template class Stack{ T data[MaxSize]; int top;publ... 阅读全文

posted @ 2019-11-17 22:40 风骨散人阅读(139) 评论(0) 推荐(0)

摘要：定义：栈是一种只能在某一端插入和删除数据的特殊线性表。他按照先进先出的原则存储数据，先进的数据被压入栈底，最后进入的数据在栈顶，需要读数据的时候从栈顶开始弹出数据(最后被压入栈的，最先弹出）。因此栈也称先进后出表... 阅读全文

posted @ 2019-11-17 22:40 风骨散人阅读(209) 评论(0) 推荐(0)

摘要： Problem Description小时候，乡愁是一枚小小的邮票，我在这头，母亲在那头。 —— 余光中集训是辛苦的，道路是坎坷的，休息还是必须的。经过一段时间的训练... 阅读全文

posted @ 2019-11-17 10:04 风骨散人阅读(63) 评论(0) 推荐(0)

摘要： Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with ... 阅读全文

posted @ 2019-11-17 10:01 风骨散人阅读(70) 评论(0) 推荐(0)

摘要： Problem DescriptionConflicts are everywhere in the world, from the young to the elderly, from families to ... 阅读全文

posted @ 2019-11-17 09:54 风骨散人阅读(105) 评论(0) 推荐(0)

CM_Lunatic