2010 年 4月 9 日随笔档案 - 蓝牙

2010年4月9日

摘要： SumsetsTime Limit: 1000ms Memory limit: 65536kB 题目描述 Given S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S. 输入 Several S, each consisti... 阅读全文

posted @ 2010-04-09 22:05 蓝牙阅读(875) 评论(0) 推荐(0)

poj3441 4 Values whose Sum is 0

摘要： 4 Values whose Sum is 0Time Limit: 15000ms Memory limit: 228000kB 题目描述 The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c... 阅读全文

posted @ 2010-04-09 20:49 蓝牙阅读(672) 评论(0) 推荐(0)