糖果

最新推荐文章于 2024-06-05 15:27:47 发布

王文波～

最新推荐文章于 2024-06-05 15:27:47 发布

阅读量130

点赞数

分类专栏：蓝桥杯

本文链接：https://blog.csdn.net/qq_45772483/article/details/115146489

版权

蓝桥杯专栏收录该内容

32 篇文章 1 订阅

订阅专栏

本文介绍了一种解决数据集子集选择问题的算法，通过位运算和集合操作优化了求解过程。利用位掩码和动态规划策略，提高了查找最优子集的时间效率。核心部分展示了如何利用`f[i][a[i]]`矩阵来实现子集搜索，最终输出了最小操作次数。

摘要由CSDN通过智能技术生成

//Ã¶¾ÙËùÓÐµÄ×Ó¼¯ for (int i = s; i; i = (i - 1) & s)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>

using namespace std;

const int N = 110;
const int M = (1 << 22) + 10;

int f[N][M];
int a[N];
set<int> ss;

int main(){
	int n, m, k;
	scanf("%d%d%d", &n, &m, &k);
	
	for (int i = 1; i <= m; i ++){
		for (int j = 1; j <= k; j ++){
			int x;
			scanf("%d", &x);
			ss.insert(x);
			a[i] |= (1 << (x - 1));
		}
	}
	
	if (ss.size() < m){
		cout << "-1" << endl;
		return 0;
	}
	
	memset(f, 0x3f, sizeof f);
	int standard = ((1 << m) - 1);
	for (int i = 1; i <= n; i ++){
		f[i][a[i]] = 1;
	}
	
	for (int j = 1; j <= n; j ++){
		for (int i = 0; i <= standard; i ++){
		f[j][i] = min(f[j][i], f[j - 1][i]);
		if ((i & a[j]) == i){
			f[j][i] = 1;
		}
	}
	}
	
	
	int ans = 0x3f3f3f3f;
	for (int i = 2; i <= n; i ++){
		for (int j = 0; j <= standard; j ++){
			for (int k = 0; k <= standard; k ++){
				if ((k | a[i]) == j){
				    f[i][j] = min(f[i][j], f[i - 1][k] + 1);
					if (j == standard && f[i][j] < ans){
					//	cout << i << "---" << j << "---" << f[i][j] << endl;
						ans = min(ans, f[i][j]);
					}
				}
			}
		}
	}
	
	cout << ans << endl;
}