摘要： Problem Description有N个比赛队（1节点数，说明不是拓扑序。 1 #include 2 #include 3 #include 4 #include 5 #include 6 7 using namespace std; 8 9 const int maxn=505;10 11... 阅读全文

摘要： 2015-05-0822:45:28地址：http://code.google.com/codejam/contest/204113/dashboard题意：给出一个n，然后是n*n的矩阵，题目保证这个矩阵可以转化为下三角矩阵，问最少的操作数，使它成为下三角矩阵。其实对于矩阵的每一行，我们只需保留它... 阅读全文

摘要： 不得不说，真的是渣，只做出了一道题。 A. Set of StringsYou are given a stringq. A sequence ofkstringss1, s2, ..., skis calledbeautiful, if the concatenation of ... 阅读全文

摘要： 1303. Minimal CoverageGiven set of line segments [Li, Ri] with integer coordinates of their end points. Your task is to find the minimal s... 阅读全文

摘要： 1167. Bicolored HorsesTime limit: 1.0 secondMemory limit: 64 MBEvery day, farmer Ion (this is a Romanian name) takes out all his horses, so th... 阅读全文

摘要： 题意：给出一个数n(1 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 const int maxn=60000+3; 9 const int inf=0x3f3f3f3f;10 11 int dp[maxn];12 1... 阅读全文

摘要： Can you answer these queries?Problem DescriptionA lot of battleships of evil are arranged in a line before the battle. Our commander decid... 阅读全文

摘要： Meteor ShowerDescriptionBessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into ear... 阅读全文

摘要： DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different fr... 阅读全文

摘要： Fence RepairDescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds t... 阅读全文