题意: 需要你构造一个n个正整数元素的数组,必须满足数组元素总和为s,且存在一个k,(0 <= k <= s),使得找不到任何非空子数组的元素和等于 k 或 s - k,如果有这样的数组,输出YES和任意输出数组元素,并且输出k。
思路:
- 思路很简单,直接构造一个有 n - 1 个 1 的数组,那么另一个元素便是s - n + 1,并选定k = n。
- 再判断一下若s - n + 1 > n,若s - n + 1 > k的话就是存在答案数组的
代码实现:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <cstring>
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int n, s;
signed main()
{
IOS;
cin >> n >> s;
if(s - n + 1 > n){
cout << "YES" << endl;
for(int i = 1; i < n; i ++)
cout << 1 << " ";
cout << s - n + 1 << endl << n << endl;
}
else cout << "NO" << endl;
return 0;
}