题目链接:http://codeforces.com/problemset/problem/856/A
题意:给定一个数组a[n],求一个新数组b[n],使得任意a[i] + b[j] 都不同。n小于100,a[i]、b[i]范围在1到1e6内。
题解:显而易见b[1] =1在任何情况下都最优,然后维护b从小到大可取的范围,记录a数组各个项的差,b数组任意两项的差都不能与此相等。
代码:
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <functional>
#include <map>
#include <bitset>
#define INF 0x7fffffff
#define REP(i,j,k) for(int i = j;i <= k;i++)
#define squr(x) (x) * (x)
#define lowbit(x) (x&(-x))
#define getint(x) scanf("%d", &(x))
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 110;
int n, m;
int a[MAXN];
bool f[1000010];
set<int>s;
set<int>ans;
set<int>tf;
int main(int argc, const char * argv[]) {
int T;
getint(T);
REP(ca, 1, T) {
getint(n);
s.clear();
ans.clear();
tf.clear();
memset(f, 0, sizeof(f));
REP(i, 1, n) {
getint(a[i]);
}
sort(a + 1, a + 1 + n);
if (n == 1) {
printf("YES\n");
printf("1\n");
continue;
}
REP(i, 1, n) {
REP(j, i + 1, n) {
f[a[j] - a[i]] = true;
tf.insert(a[j] - a[i]);
}
}
ans.insert(1);
REP(i, 1, 1000000 - 1) {
if (!f[i]) {
ans.insert(i + 1);
for(auto it : tf) {
if (i + it <= 1000000) {
f[i + it] = true;
}
}
}
if (ans.size() >= n) {
break;
}
}
if (ans.size() == n) {
printf("YES\n");
for(auto it : ans) {
printf("%d ", it);
}
printf("\n");
} else {
printf("NO\n");
}
}
return 0;
}