whosemario的专栏

<br />250pts<br />#include <vector>#include <list>#include <map>#include <set>#include <deque>#include <stack>#include <bitset>#include <string>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <ios

<br />250pts<br />#include <vector>#include <list>#include <map>#include <set>#include <deque>#include <stack>#include <bitset>#include <string>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <ios

<br />第一场资格赛，大牛都没参加。。。<br />250pts<br />#include <vector>#include <list>#include <map>#include <set>#include <deque>#include <stack>#include <bitset>#include <string>#include <functional>#include <numeric>#include <utility>#include <s

这次悲剧的爆了，分数大降，后悔没做900pts的题目。。。。250pts#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using names

<br />SRM 250<br />#include <vector>#include <list>#include <map>#include <set>#include <deque>#include <stack>#include <bitset>#include <string>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <io

<br />250 pts<br />#include <vector>#include <list>#include <map>#include <set>#include <deque>#include <stack>#include <bitset>#include <string>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <io

<br />250pts 这题实在没什么可说的。。。。<br />#include <vector>#include <list>#include <map>#include <set>#include <deque>#include <stack>#include <bitset>#include <string>#include <functional>#include <numeric>#include <utility>#include <sstream>

题目链接如下:http://community.topcoder.com/stat?c=problem_statement&pm=11496&rd=14545这个题的状态很好写出，假设dp[i][j]表示：到第i个人其得到j分时的情况个数，那么可以写出状态：dp[i]