题意:
给定一个长度为n的置换,根据这个置换生成一个图,ai对应第i个节点,规则如下:
若一个区间【l,r】的两个端点,分别为这个区间的最大最小值,则点l和点r生成一条长为1的无向通路。
问最后1到n最短路
思路:
若在一个区间[l,r]内,最大最小值的 位置 分别为x和y,不妨另x在前。
则首先可以肯定,一定存在一条x到y的通路,且这是一条必须走的路,因为xy上的数以及是最值,所以x左侧的道路不可能链接x右侧,同理y右侧的点也不可能连接y左侧,因为已近是最值,要跨过最值连接的话必然违反已经是最值这条规则。
同时,不难发现相邻两个点一定是有一条边的,所以这个xy通路无论是相邻或者不相邻,一定是更优的,因为若相邻无损失,若不相邻则赚。
只要不断递归[l,x] [y,r]即可。
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int inf = 1e9 + 9;
const ll INF = 1e18l;
/*
priority_queue<int> big_heep;
priority_queue<int,vector<int>,greater<int> > small_heep;
struct cmp{//if return true,it means that the number in the left was smaller than the right one
bool operator () (int a,int b){
}
};
*/
ll two[51];
struct data {
int num;
int id;
}maxn[300005][51], minn[300005][51];
int get(int len) {
int k = log2(len);
return k;
}
int find(int l, int r, int check) {
int k = get(r - l + 1);
if (check) {
if (maxn[l][k].num > maxn[r + 1 - two[k]][k].num) return maxn[l][k].id;
else return maxn[r + 1 - two[k]][k].id;
}
else {
if (minn[l][k].num < minn[r + 1 - two[k]][k].num) return minn[l][k].id;
else return minn[r + 1 - two[k]][k].id;
}
}
int ans(int l, int r) {
if (r == l) return 0;
if (r - l == 1) return 1;
int x = find(l, r, 1);
int y = find(l, r, 0);
if (x > y) swap(x, y);
return ans(l, x) + ans(y, r) + 1;
}
void work() {
int n;
cin >> n;
for (int i = 1;i <= n;i++) {
int x;
cin >> x;
maxn[i][0].num = minn[i][0].num = x;
maxn[i][0].id = minn[i][0].id = i;
}
if (n == 1) {
cout << 0 << "\n";
return;
}
if (n == 2) {
cout << 1 << "\n";
return;
}
for (int j = 1;j <= 29;j++)
for (int i = 1;(i + two[j] - 1) <= n;i++)
if (maxn[i][j - 1].num > maxn[i + two[j - 1]][j - 1].num) maxn[i][j] = maxn[i][j - 1];
else maxn[i][j] = maxn[i + two[j - 1]][j - 1];
for (int j = 1;j <= 29;j++)
for (int i = 1;(i + two[j] - 1) <= n;i++)
if (minn[i][j - 1].num < minn[i + two[j - 1]][j - 1].num) minn[i][j] = minn[i][j - 1];
else minn[i][j] = minn[i + two[j - 1]][j - 1];
cout << ans(1, n) << "\n";
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t;
cin >> t;
two[0] = 1;
for (int i = 1;i <= 29;i++) two[i] = two[i - 1] * 2;
while (t--) {
work();
}
return 0;
}