网易笔试之排列
题意:输入一个数字n,从1-n全排列,输入一个排列,根据该输入的排列确定其正向索引k,输入倒数第k个排列
思路:找规律,正数第k个排列和倒数第k个排列的相应下标的加和是n+1
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> data(n);
vector<int> res(n);
int num;
for (int i = 0; i < n; i++)
{
cin >> num;
data[i] = num;
res[i] = (n + 1) - num;
}
for (int i = 0; i < n; i++)
{
cout << res[i] << " ";
}
return 0;
}