摘要：
1007 Maximum Subsequence Sum (25分) Given a sequence of K integers { N 1 , N 2 , ..., N K }. A continuous subsequence is defined to be { N 阅读全文
摘要：
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door 阅读全文
摘要：
1.CTRL+A全选文档2.菜单-格式-字体。3.西文字体那里调成Times new roman-确定。 阅读全文