摘要:
Codeforces Round #532 (Div. 2) 题目总链接:https://codeforces.com/contest/1100 A. Roman and Browser 题意: 给出由-1和1组成的n个数,现在任意选定一个起点,从起点开始向左向右k个k个地拿走。最后问abs(cnt 阅读全文
摘要:
The Maximum Number of Strong Kings 题目链接:http://poj.org/problem?id=2699 Description: A tournament can be represented by a complete graph in which each 阅读全文
摘要:
Budget 题目链接:http://poj.org/problem?id=2396 Description: We are supposed to make a budget proposal for this multi-site competition. The budget proposal 阅读全文
摘要:
Sightseeing tour 题目链接:http://poj.org/problem?id=1637 Description: The city executive board in Lund wants to construct a sightseeing tour by bus in Lun 阅读全文
摘要:
Cops and Thieves Description: The Galaxy Police (Galaxpol) found out that a notorious gang of thieves has plans for stealing an extremely valuable exh 阅读全文