https://111qqz.com/en/tags/%E8%AE%A1%E6%95%B0%E6%8E%92%E5%BA%8F/Recent content in 计数排序 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzTue, 04 Oct 2016 18:41:12 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-10-04-cf558e/Tue, 04 Oct 2016 18:41:12 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-10-04-cf558e/<p><a href="http://codeforces.com/problemset/problem/558/E" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：给出一个字符串，仅由小写字母组成。现在给出q个操作，每个操作l,r,k三个参数，k=1表示把区间[l,r]变为升序排列，k=0表示把区间[l,r]变为降序排列。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-30-hdu-1280/Sat, 30 Jul 2016 10:13:30 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-30-hdu-1280/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=1280" target="_blank" rel="noreferrer">hdu1280</a></p> <p>题意：给出n(3000)个数，两两求和，输出最大的m(5000)个和。</p>