双端队列bfs: w = 0放头, w = 1放尾(类似与dp)
DFS
小技巧
while(cin >> ch)
一般枚举所有的两种方案dfs (2^n)**/ ** 二进制(n * 2^n)
看第 i 位是不是1,可以右移 i 位再 &1 看
u >> i & 1
(要从0开始枚举)
如果需要拼接: dfs
能剪枝的就把它先剪了(在确认没错的情况下)
找区间:
ret += upper_bound(a.begin(), a.end(), 3 * a[j] - 2 * a[i]) - lower_bound(a.begin(), a.end(), 2 * a[j] - a[i]);
(找z)
二分也行啊,别再一个一个试了
$$
给出 n 根长度不一的木棍,第 i 根棍子长度为 a_i 。两根长度分别为a_b和a_c的木棍可以拼接成一根长度为a_b + a_c的木棍,同理3根,4根,甚至n根都能拼接。
问:使用这 n 根木棍作三角形的边(一根木棍至多使用一次,也可以不使用),能拼出的面积最大的三角形的面积。
$$
double dfs(int l1, int l2, int l3, int cnt){
if(cnt>n) return -1;//最优性剪枝??
if(judge(l1, l2, l3))
{
mx = max(mx,area(l1,l2,l3));
}
dfs(l1+a[cnt],l2,l3,cnt+1);
dfs(l1,l2+a[cnt],l3,cnt+1);
dfs(l1,l2,l3+a[cnt],cnt+1);
dfs(l1,l2,l3,cnt+1);
return mx;
}
string s = "BESIGOM";
map<char, int> v;
int ans = 0;
for (int i = 0; i < (1 << 7); ++i) {
for (int j = 0; j < 7; ++j)
v[s[j]] = i >> j & 1;//
for (auto w : v) {
cout << w.first << " " << w.second << endl;
}
if ((v['B'] + v['I']) * (v['G'] + v['O'] + v['E'] + v['S']) * v['M'] % 2 == 0) {
int temp = 1;
for (int j = 0; j < 7; ++j)
temp *= mp[i >> j & 1][s[j]];//组合数学
ans += temp;
}
}
最长正方形搜索, dp可做 (最好从1,1开始存)
dp: 查上方,左方,左上方
f[i][j]=min(min(f[i][j-1],f[i-1][j]),f[i-1][j-1])+1
ans = max(f[i][j], ans); max说明了能取成功, f[n][m]不一定能取成功
int a[105][105];
int n, m, xx, yy, temp = 0;
void dfs(int x, int y) {
if (!a[x][y])
return ;
for (int i = xx; i < x; ++i)
if (!a[i][y]) return ;
for (int i = yy; i < y; ++i)
if (!a[x][i]) return ;
++temp;
dfs(x + 1, y + 1);//直接搜下一层()斜对角可以搜
}
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (a[i][j]) {
temp = 0;
xx = i, yy = j;
dfs(i, j);
ans = max(ans, temp);//是可以放出来的
} } }
int n, a[20]; bool vis[20]; //全部选择,对n升序排序
// 一共tar个坑,当前枚举到第pos个坑
void dfs(int pos, int tar) {
if (pos == tar + 1) {
for (int i = 1; i <= tar; i ++ ) cout << a[i] << " ";
cout << endl;
return ;
}
// 选数填坑,选择的数范围是1~n
for (int i = 1; i <= n; i ++) {
if (!vis[i]) {
vis[i] = true; a[pos] = i;
dfs (pos + 1, tar);
vis[i] = false;
} } }
for (int i = 1; i <= n; i++) dfs(1, i);
//只需要小的在前,大的在后,增加条件
// 当前枚举到第pos个坑, 上一个坑填的是start-1,这次只能从start开始找数填, 一共要填tar个坑
void dfs(int pos, int start, int tar) {
if (pos == tar + 1) {
for (int i = 1; i <= tar; i ++ ) cout << a[i] << " ";
cout << endl;
return ;
}
// 选数填坑,选择的数范围是start~n
for (int i = start; i <= n; i ++) {
if (!vis[i]) {
vis[i] = true; a[pos] = i;
dfs (pos + 1, i + 1, tar);
vis[i] = false;
} } }
for (int i = 1; i <= n; i ++ ) dfs(1, 1, i);
#include <iostream>#include <cstring>#include <algorithm>#include <vector>
#define x first #define y second using namespace std;
typedef pair<int, int> PII; const int N = 55; //acwing奶牛选美
int n, m; char g[N][N]; vector<PII> points[2];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};//记住这种
void dfs(int x, int y, vector<PII>& ps)
{ g[x][y] = '.';
ps.push_back({x, y});//这样放置
for (int i = 0; i < 4; i ++ ){
int a = x + dx[i], b = y + dy[i];
if (a >= 0 && a < n && b >= 0 && b < m && g[a][b] == 'X')//
dfs(a, b, ps);//
} }
int main()
{ cin >> n >> m;
for (int i = 0; i < n; i ++ ) cin >> g[i];//输入
for (int i = 0, k = 0; i < n; i ++ )
for (int j = 0; j < m; j ++ )
if (g[i][j] == 'X')
dfs(i, j, points[k ++ ]);//求连通块的精妙之处,在dfs中早已处理好了这块
int res = 1e8;
for (auto& a: points[0])
for (auto& b: points[1])
res = min(res, abs(a.x - b.x) + abs(a.y - b.y) - 1);
return 0;}
char g[105][105];
int m, n; int top;
const double eps = 1e-6; pair<int, int> q[105 * 105];
inline double dis(pair<int, int> a, pair<int, int> b) {
double dx = a.first - b.first;
double dy = a.second - b.second;
return sqrt(dx * dx + dy * dy);
}
double get_sum() {//利用两两之间的距离hash映射
double sum = 0;
for (int i = 0; i < top; ++i) {
for (int j = i + 1; j < top; ++j) {
sum += dis(q[i], q[j]);
}
}
return sum;
}
char get_tu(double key) {
static double tu[30];
static int id = 0;
for (int i = 0; i < id; ++i) {
if (fabs(tu[i] - key) < eps)
return i + 'a';
}
tu[id++] = key;
return id + 'a' - 1;
}
void dfs(int x, int y) {
q[top++] = {x, y};
g[x][y] = '0';
for (int i = x - 1; i <= x + 1; ++i) {
for (int j = y - 1; j <= y + 1; ++j) {
if (i == x && j == y)
continue;
if (i >= 0 && i < n && j >= 0 && j < m && g[i][j] == '1')
dfs(i, j);
}
}
}
int main() {
IOS
cin >> m >> n;
for (int i = 0; i < n; ++i)
cin >> g[i];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {//连通块
if (g[i][j] == '1') {
top = 0;
dfs(i, j);
char c = get_tu(get_sum());
for (int k = 0; k < top; ++k) {
g[q[k].first][q[k].second] = c;
}
}
}
}
for (int i = 0; i < n; ++i)
cout << g[i] << endl;
return 0;
}