对于给定的程序,要求输出每个数字在程序运行过程中的最左边的位置和最右边的位置的差值
观察程序可知,这个冒泡排序有以下性质:
1.每次将值从小到大的顺序放到正确的位置上
2.对于未排序的数字,他们的顺序和原始数列一致
故我们可以比较容易的发现,每个数字的最右值为 x+(已经出现的比数字x大的数字个数)
而每个数字的最左值为 当前位置,或x
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
using namespace std;
#define sp system("pause")
typedef long long ll;
const int MAXN = 100000 + 10;
int tree[MAXN << 2];
int ans[MAXN];
void update(int l, int r, int now, int tar)
{
if (l == r&&l == tar)tree[now]++;
else
{
int mid = (l + r) >> 1;
if (tar <= mid)update(l, mid, now << 1, tar);
else update(mid + 1, r, now << 1 | 1, tar);
tree[now] = tree[now << 1] + tree[now << 1 | 1];
}
}
int query(int l, int r, int now, int ql, int qr)
{
if (ql == l&&qr == r)return tree[now];
int mid = (l + r) >> 1;
if (qr <= mid)return query(l, mid, now << 1, ql, qr);
else if (ql > mid)return query(mid + 1, r, now << 1 | 1, ql, qr);
else return query(l, mid, now << 1, ql, mid) + query(mid + 1, r, now << 1 | 1, mid + 1, qr);
}
int main()
{
int T;
cin >> T;
int cas = 1;
while (T--)
{
int n;
vector<int>v;
memset(tree, 0, sizeof tree);
memset(ans, 0, sizeof ans);
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
int x;
scanf("%d", &x);
int maxx = -1, minn = n + 1;
maxx = max(maxx, max(i + 1, x + query(1, n, 1, x, n)));
maxx = max(maxx, x);
minn = min(minn, min(i + 1, x + query(1, n, 1, x, n)));
minn = min(minn, x);
ans[x] = maxx - minn;
update(1, n, 1, x);
}
printf("Case #%d:", cas++);
for (int i = 1; i <= n; i++)
printf(" %d", ans[i]);
printf("\n");
}
}