第一个算法用线段树来进行快速查询第一个可以装下item的bin
第二个算法用multiset的二分快速找到能装下item的最小的bin(也就是lower_bound())
线段树可以对无序的序列实现快速查询的操作,根据题意第一个算法因为要找到第一个可以装下item的bin,用set或map等容器会对bin的集合进行排序,无法实现。
#include<iostream>
#include<queue>
#include<algorithm>
#include<cstring>
#include<map>
#include<set>
#define FAST ios::sync_with_stdio(false);
#define endl '\n'
using namespace std;
const int N = 1e6 + 6006;
const int M = 4 * N;
typedef long long ll;
const int INF = 2147483647;
int a[N];
int b[N];
int n, c;
multiset<int>s;
struct SEG
{
int t[N << 2];
void up(int p) { t[p] = max(t[p << 1], t[p << 1 | 1]); }
void build(int p, int l, int r){
if (l == r)
{
t[p] = c;
return;
}
int mid = l + r >> 1;
build(p << 1, l, mid);
build(p << 1 | 1, mid + 1, r);
up(p);
}
void modify(int p, int l, int r,int f, int x){
if (l == r)
{
t[p] -= x;
return;
}
int mid = l + r >> 1;
if (f<=mid)modify(p << 1, l, mid, f, x);
else if(f>mid) modify(p << 1|1, mid+1, r, f, x);
up(p);
}
int query(int p, int l, int r, int x)
{
if (l == r)return l;
int mid = l + r >> 1;
int res;
if (x <= t[p << 1])res=query(p << 1, l, mid, x);
else if(x<=t[p<<1|1]) res=query(p << 1 | 1, mid + 1, r, x);
return res;
}
}seg;
int main()
{
FAST;
int _;
cin >> _;
while (_--)
{
cin >> n >> c;
for (int i = 1; i <= n; i++)
cin >> a[i];
seg.build(1, 1, n);
int cnt = 0;
for (int i = 1; i <= n; i++)
{
int f=seg.query(1, 1, n, a[i]);
if (f > cnt)cnt++;
seg.modify(1, 1, n, f, a[i]);
}
multiset<int>::iterator it;
for (int i = 1; i <= n; i++)
{
it = s.lower_bound(a[i]);
if (it == s.end())
{
s.insert(c - a[i]);
continue;
}
int v = *it - a[i];
s.erase(it);
s.insert(v);
}
cout << cnt << " " << s.size() << endl;
s.clear();//一定清空容器
}
return 0;
}