xiji333的博客

https://nanti.jisuanke.com/t/A2016思路：和这道题基本上一样：https://blog.youkuaiyun.com/xiji333/article/details/104010374唯一的区别就是区间从左闭右开变成了左右均闭，在处理的时候把右端点+1+1+1就好了。#include<cstdio>#include<cstring>#incl...

http://poj.org/problem?id=3680题目大意：给nnn个开区间，每一个区间都有对应的权值，让你从这nnn个区间中任意选取若干个区间，使得权值之和最大且在实数轴上每个整数被覆盖的次数<=k<=k<=k，输出这个最大的权值。思路：费用流，这玩意第一次见真的头大。下面这个解释我觉得还行，然后补充一下细节，区间左端点向右端点连的边的权值是−wi-w_i−wi...

什么是离散化：离散化，把无限空间中有限的个体映射到有限的空间中去，以此提高算法的时空效率。再通俗一点：离散化是在不改变数据相对大小的条件下，对数据进行相应的缩小。概述：离散化是程序设计中一个常用的技巧，它可以有效的降低时间复杂度。其基本思想就是在众多可能的情况中，只考虑需要用的值。离散化可以改进一个低效的算法，甚至实现根本不可能实现的算法。要掌握这个思想，必须从大量的题目中理解...

http://poj.org/problem?id=2528The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim...

http://poj.org/problem?id=2299In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence element...

http://acm.hdu.edu.cn/showproblem.php?pid=6318Long long ago, there was an integer sequence a.Tonyfang think this sequence is messy, so he will count the number of inversions in this sequence. Becau...

http://codeforces.com/problemset/problem/1199/COne common way of digitalizing sound is to record sound intensity at particular time moments. For each time moment intensity is recorded as a non-negati...