这个系列貌似是挂在voj上的,传送
好了, 下面开始魔法训练 @_@..
POJ 2443 Set Operation
题意:…
思路:
这个枚举就过了。。需要用到位压缩。
POJ 3244 Difference between Triplets(数学推导)
题意:
给n个(x, y, z)元组
define: d(i, j) = max(xi-xj, yi-yj, zi-zj) - min(xi-xj, yi-yj, zi-zj)
思路:
很好的数学题!
转换: 把a,b,c看成数轴上的点,
则 max(a, b, c)-min(a, b, c) = ( |a-b|+|a-c|+|b-c| )/2
= (| (xi-yi)-(xj-yj) | + | (xi-zi)-(xj-zj) | + | (yi-zi)-(yj-zj) |)/2
= ( |n-m| + |n-l| + |m-l|)/2 (1)
(1)的式子可以排序后O(n)时间解决。
while (scanf("%d", &n) != EOF && n) {
int aa, bb, cc;
rep(i, 0, n-1) {
scanf("%d%d%d", &aa, &bb, &cc);
a[i] = aa*1ll-bb;b[i] = aa*1ll-cc;c[i] = bb*1ll-cc;
}
sort(a, a+n);sort(b, b+n);sort(c, c+n);
LL ans = 0;
rep (i, 0, n-1) {
ans += i*a[i]-a[i]*(n-1-i);
ans += i*b[i]-b[i]*(n-1-i);
ans += i*c[i]-c[i]*(n-1-i);
}
printf("%I64d\n", ans/2);
}
POJ 3685 Matrix(二分嵌套)
题意:
给出一个由矩阵,Aij是下标的函数…
求矩阵中第k大
思路:
行不满足单调性,但是每列是递增的。
注意重复的元素!
1)第一重二分
二分答案 范围[-inf, inf]
求出小于x的数小于等于k-1的上界。这就是答案。
2)第二重二分
枚举每一列,求小于x的数的个数
const LL C = 100000;
const LL MXX = 1ll<<50;
LL n, k;
inline LL calc(LL i, LL j) {
return i*i+C*i+j*j-C*j+i*j;
}
int go(LL key) {
LL i, j, cnt = 0;
for (j=1;j<=n;++j) {
LL l=1, r=n+1, tmp;
do {
i = l+(r-l)/2;
tmp = calc(i, j);
//debug
//printf("%I64d %I64d: %I64d\n", i, j, tmp);
if (tmp < key)
l = i;
else
r = i;
} while (l<r-1);
tmp = calc(l, j);
if (tmp >= key) continue;
cnt += r-1;
if (cnt > k-1) return 1;
}
// debug
//cout << cnt << " elements less than " << key << endl;
if (cnt <= k-1) return -1;
return 1;
}
LL solve() {
LL l = -MXX, r = MXX;
while (l<r-1) {
LL mid = l+(r-l)/2;
int re = go(mid);
if (re>0) r=mid;
else l = mid;
}
return l;
}