摘要：
A - Between the Offices 题目链接http://codeforces.com/contest/867/problem/A 解题心得：就是一个水题，读懂题就好，如果从S到F次数大于F到S就输出YES，否则输出NO。#includeusing nam... 阅读全文
摘要：
The Heaviest Non-decreasing Subsequence Problem解题心得这个题就是一个简单的动态规划，非递减最长子序列的改版（加一个权重），只要把权重为5的改成5个权重为1的然后dp就可以解决了，注意要用nlogn的复杂度才可以。#inc... 阅读全文
摘要：
Popular CowsDescriptionEvery cow’s dream is to become the most popular cow in the herd. In a herd of N (1 #include#includeusing namesp... 阅读全文
摘要：
Oil DepositsTime Limit: 1000MS Memory Limit: 10000KDescriptionThe GeoSurvComp geologic survey company is responsible for detecting und... 阅读全文
摘要：
Avoid The LakesTime Limit: 1000MS Memory Limit: 65536KDescriptionFarmer John’s farm was flooded in the most recent storm, a fact only ... 阅读全文
摘要：
AnanagramsMost crossword puzzle fans are used to anagrams — groups of words with the same letters in different orders — for example OP... 阅读全文
摘要：
Andy’s First DictionaryAndy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the nu... 阅读全文
摘要：
Cube paintingWe have a machine for painting cubes. It is supplied with three different colors: blue, red and green. Each face of the c... 阅读全文
摘要：
OthelloOthello is a game played by two people on an 8 x 8 board, using disks that are white on one side and black on the other. One pl... 阅读全文
摘要：
Squares A children’s board game consists of a square array of dots that contains lines connecting some of the pairs of adjacent dots. ... 阅读全文