1157D

2100\greedy\math

题目大意；求一长度为K的数组 满足ai+1>ai + 1 ai+1<ai^2 sum(ai)=n

大致思路；先构造一个 最大的 形如：X X+1 X+2 X+3…X+K

然后从后往前逐个+1 另外特判几种情况即可

#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define endl '\n'
#define fi for(int i=1;i<=k;i++) 
#define fi2 for(int i=0;i<n;i++) 

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int INF=0x3f3f3f3f; 
const int MAX=2e5+10;
int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
ll a[MAX];
int main(){
	ll n,k;
	cin>>n>>k;
	ll left=n-(k+1)*k/2;
	if(k==1){
		cout<<"YES"<<endl;
		cout<<n;
		return 0;
	}
	if(left<0){
		cout<<"NO";
		return 0;
	}
	if(k<=3&&left%k==k-1&&left/k==0){
		cout<<"NO";
		return 0;
	} 


	
	fi{
		 
		a[i]=i+left/k==0;
		if(i>k-left%k){
			a[i]++;
		}
		
	}
		if(a[1]==1&&left%k==k-1){
		a[2]--;
		a[k]++;
	}
	ll sum=0;
	cout<<"YES"<<endl;
	fi{
		cout<<a[i]<<' ';
		sum+=a[i];
	}
//	cout<<endl<<sum<<endl;
	
}