2019年7月29日
SDNU 1330.Max Sum（最大子序列和）
摘要： Description Description 给定长度为n的正整数序列a1,a2,…,an。 令sum=ab1+ab2+…+abm，并且满足：ab1<ab2<…<abm；b1<b2<…<bm;1<=m<=n。 求最大的sum。 n<=1000,0<ai<=109 给定长度为n的正整数序列a1,a2 阅读全文
posted @ 2019-07-29 17:11 明霞 阅读(235) 评论(0) 推荐(0)
SDNU 1351.the Number of Department（并查集）
摘要： Description Description Company A has N employees, this company has lots of departments around the country. The employees who belong to different depa 阅读全文
posted @ 2019-07-29 14:55 明霞 阅读(197) 评论(0) 推荐(0)
SDNU 1354.Cut the Cable（gcd）
摘要： Description Description The company have n(n<=100) long cables（the length is not necessarily the same）,we assume that the length of every long cable i 阅读全文
posted @ 2019-07-29 11:02 明霞 阅读(161) 评论(0) 推荐(0)
SDNU 1372.Problem C:Primary Arithmetic（高精度）
摘要： Description Description Children are taught to add multi-digit numbers from right-to-left one digit at a time. Many find the "carry" operation - in wh 阅读全文
posted @ 2019-07-29 10:01 明霞 阅读(187) 评论(0) 推荐(0)