jxnu专题

https://acs.jxnu.edu.cn/problem/HDU1003

描述: Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. 输入: T

Counterfeit Dollar(题目地址链接:https://acs.jxnu.edu.cn/problem/NOIOPJCH020115)

描述: Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguishable from t