摘要: 题目在这里http://community.topcoder.com/stat?c=problem_statement&pm=12750&rd=15703看第一队的得分S,总分是A如果S>A/2并且S-a[i](ai是s中最小的元素))# include # include # include # define maxn 1600000LLusing namespace std;typedef long long ll;ll dp[maxn];class YetAnotherTwoTeamsProblem{public: long long count(vector sk 阅读全文
posted @ 2013-09-21 19:14 1carus 阅读(181) 评论(0) 推荐(0) 编辑