题意:
对于每个测试用例,给出两个正整数n,k,要求输出一个数组,使得刚好有k个子数组的和为正数,(n + 1) * n / 2 - k 个子数组的和为负数.
代码实现:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#define ll long long
#define pa pair<int,int>
#define fi first
#define se second
using namespace std;
int a[1000];
int main()
{
int _;
cin >> _;
while (_--)
{
int n,k;
scanf("%d%d",&n,&k);
//计算一个要几个和为负数的数组
int u = (n + 1) * n / 2 - k;
int p = 1;
int ff = 0;
while (u > 0)
{
ff = u;
a[p] = -500;
u -= n - (p++ - 1);
}
for (int i = p; i <= n; i++)
{
a[i] = 499 / (n - 1);
}
a[p + ff - 1] = 510;
for (int i = 1; i <= n; i++)
{
printf("%d ",a[i]);
}
printf("\n");
}
return 0;
}