Codeforces 517 (Div. 2) C. Cram Time思维&&栈拆分数

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
	long long a,b,k;
vector<long long>q1,q2;
int main(){
	std::ios::sync_with_stdio(false);
	cin>>a>>b;
	for(long long  i=1;i<=a+b+1;i++){
		long long  sum=((1+i)*i)/2;
//			cout<<sum<<endl;
		if(sum>a+b){
		
			k=i-1;
			break;
		}
	}
//	cout<<k<<endl;
	for(long long i=k;i>=1;i--){
		if(i<=a){
			q1.push_back(i);
			a-=i;
		} 
		else{
			q2.push_back(i);
		}
	}
	cout<<q1.size()<<endl;
	for(long long i=0;i<q1.size();i++){
		cout<<q1[i]<<" ";
	} 
	cout<<endl;
	cout<<q2.size()<<endl;
	for(long long i=0;i<q2.size();i++){
		cout<<q2[i]<<" ";
	} 
	cout<<endl;
}