POJ 3740 Easy Finding
题目链接
题意:选一些行,要求每行正好覆盖一个列
思路:精确覆盖裸题
代码:
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXNODE = 500010;
const int MAXN = 510;
const int MAXM = 1010;
const int INF = 0x3f3f3f3f;
struct DLX {
int n, m, size;
int U[MAXNODE], D[MAXNODE], R[MAXNODE], L[MAXNODE], row[MAXNODE], col[MAXNODE];
int H[MAXN], S[MAXM];
int ansd, ans[MAXN];
void init(int n, int m) {
this->n = ......
阅读全文