Q1
d
1
=
i
−
1
,
d
2
=
n
−
i
,
由于每棵树都只能在两次被修建的间隔中长高,
且当不被修建时会不断长高,所以
a
n
s
=
m
a
x
(
d
1
,
d
2
)
∗
2
d1 = i - 1, d2 = n - i, 由于每棵树都只能在两次被修建的间隔中长高,\\且当不被修建时会不断长高,所以ans = max(d1, d2) * 2
d1=i−1,d2=n−i,由于每棵树都只能在两次被修建的间隔中长高,且当不被修建时会不断长高,所以ans=max(d1,d2)∗2
#include<iostream>
using namespace std;
const int N = 1e4 + 10;
int a[N], t;
int main()
{
int n;
cin >> n;
for(int i = 1; i <= n; ++i)
{
int t = max(i - 1, n - i);
cout << 2 * t << endl;
}
return 0;
}
Q2
把不同数码管看作不同点,利用递归/位运算实现指数枚举,然后判断枚举出的这些数码管是否满足题目的要求,也就是互相连通,可以用并查集。
/*
* @Author: gorsonpy
* @Date: 2022-12-17 11:57:05
* @Last Modified by: gorsonpy
* @Last Modified time: 2022-12-17 12:13:13
*/
#include <iostream>
#include<vector>
using namespace std;
const int N = 10;
int e[N][N];
int p[N], st[N], ans;
int find(int x)
{
if(p[x] != x) p[x] = find(p[x]);
return p[x];
}
bool check(vector<int> v)
{
for(int i = 1; i <= 7; ++i) p[i] = i;
for(int i = 0; i < v.size(); ++i)
for(int j = 0; j < v.size(); ++j)
{
int a = v[i], b = v[j];
if(e[a][b] || e[b][a])
{
a = find(a), b = find(b);
if(a != b) p[a] = b;
}
}
int cnt = 0;
for(int i = 1; i <= 7; ++i)
if(p[i] == i && st[i] == 1) ++cnt;
return cnt == 1;
}
void dfs(int u)
{
if(u == 8)
{
vector<int> v;
for(int i = 1; i <= 7; ++i)
if(st[i] == 1) v.push_back(i);
if(check(v)) ++ans;
return;
}
st[u] = 1;
dfs(u + 1);
st[u] = 0;
st[u] = 2;
dfs(u + 1);
st[u] = 0;
}
int main()
{
e[1][2] = e[2][1] = 1;
e[1][3] = e[3][1] = 1;
e[2][4] = e[4][2] = 1;
e[3][4] = e[4][3] = 1;
e[2][5] = e[5][2] = 1;
e[3][6] = e[6][3] = 1;
e[4][5] = e[5][4] = 1;
e[4][6] = e[6][4] = 1;
e[5][7] = e[7][5] = 1;
e[6][7] = e[7][6] = 1;
dfs(1);
cout << ans << endl;
return 0;
}