Vmorish

点我看题题意:***分析:***参考代码:#include#include#include#include#include#includeusing namespace std;const int maxn = 2e5+5;int n;char arr[maxn];//记录int val[maxn];//对应技能值int l[maxn],r[maxn];//

点我看题题意:分别给出两个序列a和b,根据规则ai≤max{aj-j│bk≤j官方题解:预处理：a_i -= i ，易证明从最小的b开始选每次选最大的一定可以使结果最大。 证明思路：如果条件改为a_i<=max{a_j-j|b_k<=j<=n}，那么b的顺序与最后的结果无关。条件改回来后，由于每次要计算一个数的最大值时都有a_(n+1)...a_(i-1)在范围中，所以每次只需让a_i

POJ - 2442 Sequence(优先队列/堆)DescriptionGiven m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind of sequences. Then we can calcu

点我看题题意:看病排队,首先根据病情的轻重缓急来医治,严重的先治,病情相同的情况下,先来的先治,根据输入输出病人的id.分析:就是一个优先队列进队出队的问题,关键在于优先队列的重载小于号.参考代码:#include#include#include#include#include#includeusing namespace std;int n;struct Nod