题目链接:1113 Integer Set Partition (25分)
题意
将给定数组分为两个数组a1,a2使得两个数组中元素个数差值最小,元素和差值最大。
分析
-
数组元素个数差值最小即等分。使得元素和最大,使a1放原数组中按照重小到大排序后的前n/2个(向下取整),剩下的n - n / 2个放在a2中。无论奇偶a1都放n/2个。
-
不需要排序,找到原数组中的中位数。时间复杂度O(n),使用随机选择算法加快排思想。下标从0开始,求排名下标为n/2的数。遍历数组使小于中位数的加在a1的元素和中,其余的加在a2的元素和中,因为中位数可能有重复,统计小于中位数的个数cnt,比较n/2和cnt的大小
sum = sum2 - sum1;
if (cnt < n / 2)
sum -= (n / 2 - cnt) * mid * 2;
else if (cnt > n / 2)
sum += (cnt - n / 2) * mid * 2;
代码1
这个想不通为啥会超时,明明是O(n)的算法,试过100000个测试用例元素有序或者逆序,查找到中间值只需要20次左右,然而还超时,不明白为什么,直接使用库函数sort不会超时。求大佬指教。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
void swap(int a[], int l, int h) {
int t = a[l];
a[l] = a[h];
a[h] = t;
}
const int maxn = 100010;
int a[maxn];
int cnt1 = 0;
int findMid(int a[], int low, int high, int k);
int main(int argc, char** argv) {
srand((unsigned)time(NULL));
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
// sort(a, a + n);
int mid = findMid(a, 0, n - 1, n / 2); // 得到中位数
long long sum1 = 0, sum2 = 0, cnt = 0, sum = 0;
// for (int i = 0; i < n; i++) {
// if (i < n / 2)
// sum1 += a[i];
// else
// sum2 += a[i];
// }
for (int i = 0; i < n; i++) {
if (a[i] < mid) {
sum1 += a[i];
cnt++; // 计算小于中位数的个数
} else
sum2 += a[i];
}
sum = sum2 - sum1;
if (cnt < n / 2)
sum -= (n / 2 - cnt) * mid * 2;
else if (cnt > n / 2)
sum += (cnt - n / 2) * mid * 2;
int subn = (n & 1) ? 1 : 0;
printf("%d %lld\n", subn, sum);
return 0;
}
int findMid(int a[], int low, int high, int k) {
int i = low, j = high;
while (i < j) {
cnt1++;
int i = low, j = high;
int p = rand() % (high - low + 1) + low;
swap(a, low, p);
int base = a[low];
while (i < j) {
while (i < j && a[j] >= base)
j--;
a[i] = a[j];
while (i < j && a[i] <= base)
i++;
a[j] = a[i];
}
a[i] = base;
if (i == k)
return a[i];
else if (i > k) {
high = i - 1;
} else
low = i + 1;
}
return 0;
}
AC代码
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int a[maxn];
int main(int argc, char** argv) {
srand((unsigned)time(NULL));
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
int sum1 = 0, sum2 = 0, cnt = 0, sum = 0;
for (int i = 0; i < n; i++) {
if (i < n / 2)
sum1 += a[i];
else
sum2 += a[i];
}
sum = sum2 - sum1;
int subn = (n & 1) ? 1 : 0;
printf("%d %d", subn, sum);
return 0;
}