算法课复习 -- 分治

于 2019-01-13 17:59:40 发布
阅读量168 收藏
点赞数
分类专栏： 算法课复习 文章标签： 分治 二分
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_40993793/article/details/86426793
版权

HDU #5178 : pairs

传送门：http://acm.hdu.edu.cn/showproblem.php?pid=5178

题意：n个数，问有多少对数差值小于k。

思路：排个序，开个队列。每次一个新的数先把比它小的都从队列中去了，然后答案加上队列大小，最后把自己塞进队列。按顺序走一遍行了。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<utility>
#include<algorithm>
#include<utility>
#include<queue>
#include<vector>
#include<set>
#include<stack>
#include<cmath>
#include<map>
#include<ctime>
#include<functional>
#include<bitset>
#define P pair<int,int>
#define ll long long
#define ull unsigned long long
#define lson id*2,l,mid
#define rson id*2+1,mid+1,r
#define ls id*2
#define rs (id*2+1)
#define Mod(a,b) a<b?a:a%b+b
#define cl0(a) memset(a,0,sizeof(a))
#define cl1(a) memset(a,-1,sizeof(a))
using namespace std;

const ll M = 1e9 + 7;
const ll INF = 1e9;
const double _e = 10e-6;
const int maxn = 1e5 + 10;
const int matSize = 9;
const int dx[4] = { 0,0,1,-1 }, dy[4] = { 1,-1,0,0 };
const int _dx[8] = { -1,-1,-1,0,0,1,1,1 }, _dy[8] = { -1,0,1,-1,1,-1,0,1 };

int x, y, z;
char c;

int t, n, k;
int a[maxn];
ll ans;

void solve()
{
	ans = 0;
	queue<int> q;
	for (int i = 1; i <= n; i++) {
		while (!q.empty() && a[i] - q.front() > k)
			q.pop();
		ans += 1ll * q.size();
		q.push(a[i]);
	}
}

int main()
{
	scanf("%d", &t);
	while (t--) {
		scanf("%d%d", &n, &k);
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		sort(a + 1, a + n + 1);
		solve();
		printf("%lld\n", ans);
	}
	return 0;
}

 

OpenJ_Bailian #2299 : Ultra-QuickSort

传送门：http://bailian.openjudge.cn/practice/2299?lang=en_US

题意：给出一串数，每个数只能和相邻的数交换位置，问最少交换多少次能使这一串数从小到大排序。

思路：求逆序对个数，树状数组直接做就行了。或者归并排序来做也可以。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<utility>
#include<algorithm>
#include<utility>
#include<queue>
#include<vector>
#include<set>
#include<stack>
#include<cmath>
#include<map>
#include<ctime>
#include<functional>
#include<bitset>
#define P pair<int,int>
#define ll long long
#define ull unsigned long long
#define lson id*2,l,mid
#define rson id*2+1,mid+1,r
#define ls id*2
#define rs (id*2+1)
#define Mod(a,b) a<b?a:a%b+b
#define cl0(a) memset(a,0,sizeof(a))
#define cl1(a) memset(a,-1,sizeof(a))
using namespace std;

const ll M = 1e9 + 7;
const ll INF = 1e9;
const double _e = 10e-6;
const int maxn = 5e5 + 10;
const int matSize = 9;
const int dx[4] = { 0,0,1,-1 }, dy[4] = { 1,-1,0,0 };
const int _dx[8] = { -1,-1,-1,0,0,1,1,1 }, _dy[8] = { -1,0,1,-1,1,-1,0,1 };

int x, y, z;
char c;

int lowbit(int x)
{
	return x&(-x);
}

int n, cnt;
int a[maxn], b[maxn];
map<int, int> mp;

void init()
{
	mp.clear();
}

void add(int x)
{
	for (int i = x; i <= cnt; i += lowbit(i))
		a[i]++;
}

int query(int x)
{
	int res = 0;
	for (int i = x; i > 0; i -= lowbit(i))
		res += a[i];
	return res;
}

int main()
{
	while (~scanf("%d", &n)) {
		if (n == 0)break;
		init();
		for (int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
			b[i] = a[i];
		}
		sort(a + 1, a + n + 1);
		cnt = 0;
		for (int i = 1; i <= n; i++) {
			if (mp[a[i]] == 0)
				mp[a[i]] = ++cnt;
		}
		for (int i = 1; i <= n; i++)
			b[i] = mp[b[i]];

		cl0(a);
		ll ans = 0;
		for (int i = n; i > 0; i--) {
			ans += 1ll * query(b[i] - 1);
			add(b[i]);
		}
		printf("%lld\n", ans);
	}
	return 0;
}

 

HDU #2083 : 简易版之最短距离

传送门：http://acm.hdu.edu.cn/showproblem.php?pid=2083

题意：给出n个点，选择一个点使得所有点到它的距离之和最小，问最小距离和是多少。

思路：直接找最中间位置的点就可以了。

比如对于a、b两个点（a<=b），选择点c，若a<=c<=b则无论c在哪都有|ac|+|cb|=|b-a|；否则|ac|+|cb|>=|b-a|

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<utility>
#include<algorithm>
#include<utility>
#include<queue>
#include<vector>
#include<set>
#include<stack>
#include<cmath>
#include<map>
#include<ctime>
#include<functional>
#include<bitset>
#define P pair<int,int>
#define ll long long
#define ull unsigned long long
#define lson id*2,l,mid
#define rson id*2+1,mid+1,r
#define ls id*2
#define rs (id*2+1)
#define Mod(a,b) a<b?a:a%b+b
#define cl0(a) memset(a,0,sizeof(a))
#define cl1(a) memset(a,-1,sizeof(a))
using namespace std;

const ll M = 1e9 + 7;
const ll INF = 1e9;
const double _e = 10e-6;
const int maxn = 1e5 + 10;
const int matSize = 9;
const int dx[4] = { 0,0,1,-1 }, dy[4] = { 1,-1,0,0 };
const int _dx[8] = { -1,-1,-1,0,0,1,1,1 }, _dy[8] = { -1,0,1,-1,1,-1,0,1 };

int x, y, z;
char c;

int t, n;
int a[maxn];

int main()
{
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		sort(a + 1, a + n + 1);
		ll ans = 0;
		int l = 1, r = n;
		while (l < r) {
			ans += 1ll * (a[r] - a[l]);
			l++, r--;
		}
		printf("%lld\n", ans);
	}
	return 0;
}

 

OpenJ_Bailian #1064 : Cable master

传送门：http://bailian.openjudge.cn/practice/1064?lang=en_US

题意：给n块木头，以及最终需要的块数k。求出问把木头切成k块后，其中最短的那块的最大值。

思路：二分答案。精度问题的话可以直接*100转化成整数来求，或者二分个几百次。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<utility>
#include<algorithm>
#include<utility>
#include<queue>
#include<vector>
#include<set>
#include<stack>
#include<cmath>
#include<map>
#include<ctime>
#include<functional>
#include<bitset>
#define P pair<int,int>
#define ll long long
#define ull unsigned long long
#define lson id*2,l,mid
#define rson id*2+1,mid+1,r
#define ls id*2
#define rs (id*2+1)
#define Mod(a,b) a<b?a:a%b+b
#define cl0(a) memset(a,0,sizeof(a))
#define cl1(a) memset(a,-1,sizeof(a))
using namespace std;

const ll M = 1e9 + 7;
const ll INF = 1e9 + 10;
const double _e = 10e-6;
const int maxn = 1e4 + 10;
const int matSize = 9;
const int dx[4] = { 0,0,1,-1 }, dy[4] = { 1,-1,0,0 };
const int _dx[8] = { -1,-1,-1,0,0,1,1,1 }, _dy[8] = { -1,0,1,-1,1,-1,0,1 };

int x, y, z;
char c;

int n, k;
double temp;
int a[maxn];

int main()
{
	while (~scanf("%d%d", &n, &k)) {
		for (int i = 1; i <= n; i++) {
			scanf("%lf", &temp);
			a[i] = temp * 100;
		}
		int l = 0, r = INF;
		while (l + 1 < r) {
			int mid = (l + r) / 2;
			int ans = 0;
			for (int i = 1; i <= n; i++)
				ans += a[i] / mid;
			if (ans >= k)
				l = mid;
			else
				r = mid;
		}
		int a1 = l / 100, a2 = l % 100;
		printf("%d.", a1);
		if (a2 < 10)printf("0");
		printf("%d\n", a2);
	}
	return 0;
}

 

OpenJ_Bailian #2456 : Aggressive cows

传送门：http://bailian.openjudge.cn/practice/2456?lang=en_US

题意：有n个牛棚，c头牛。牛比较凶猛所以它们太近了要打架。给出n个牛棚的位置，每个牛棚放一只牛，问两只牛之间的最短距离的最大值是多少。

思路：二分答案。默认1号位置放牛，之后隔着dis位置的牛棚放牛，看放不放的下。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<utility>
#include<algorithm>
#include<utility>
#include<queue>
#include<vector>
#include<set>
#include<stack>
#include<cmath>
#include<map>
#include<ctime>
#include<functional>
#include<bitset>
#define P pair<int,int>
#define ll long long
#define ull unsigned long long
#define lson id*2,l,mid
#define rson id*2+1,mid+1,r
#define ls id*2
#define rs (id*2+1)
#define Mod(a,b) a<b?a:a%b+b
#define cl0(a) memset(a,0,sizeof(a))
#define cl1(a) memset(a,-1,sizeof(a))
using namespace std;

const ll M = 1e9 + 7;
const ll INF = 1e9;
const double _e = 10e-6;
const int maxn = 1e5 + 10;
const int matSize = 9;
const int dx[4] = { 0,0,1,-1 }, dy[4] = { 1,-1,0,0 };
const int _dx[8] = { -1,-1,-1,0,0,1,1,1 }, _dy[8] = { -1,0,1,-1,1,-1,0,1 };

int x, y, z;
char c;

int n, k;
int a[maxn];

bool solve(int dis)
{
	int pos = 1, cnt = k - 1;
	while (cnt > 0) {
		pos = lower_bound(a + 1, a + n + 1, a[pos] + dis) - a;
		if (pos > n)return false;
		cnt--;
	}
	return true;
}

int main()
{
	while (~scanf("%d%d", &n, &k)) {
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		sort(a + 1, a + n + 1);
		int l = 0, r = INF;
		while (l + 1 < r) {
			int mid = (l + r) / 2;
			if (solve(mid))
				l = mid;
			else
				r = mid;
		}
		printf("%d\n", l);
	}
	return 0;
}

 

__喵喵喵
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值