[树状数组] cf 1342D

题目

思路

一个一个边弄边加 算最多要多大的容器来存 然后挨个存进去就好了

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[200010],c[200010],bit[200010];
int n,k;
int lowbit(int x){
	return (-x)&x;
}
void edit(int pos,int val){
	for(int i=pos;i<=200000;i+=lowbit(i)){
		bit[i]+=val;
	}
}
int query(int pos){
	int res1=0;
	for(int i=pos;i>=1;i-=lowbit(i)){
		res1+=bit[i];
	}
	return res1;
}
vector<vector<int>> res;
vector<int> v;
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>k;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=k;i++) cin>>c[i];
	sort(a+1,a+1+n,greater<int>());
	for(int i=1;i<=n;i++){
		int greater=i-1-query(a[i]-1);
		edit(a[i],1);
		if(res.size()*c[a[i]]>greater){
			v.push_back(a[i]);
			continue;
		}
		vector<int> tmp;
		tmp.push_back(a[i]);
		res.push_back(tmp);
	}
	for(int i=0;i<v.size();i++){
		res[i%res.size()].push_back(v[i]);
	}
	cout<<res.size()<<endl;
	for(auto i:res){
		cout<<i.size();
		for(auto j:i){
			cout<<" "<<j;
		}
		cout<<endl;
	}
    return 0;
}