C. Permutation Operations（cf构造题,差分）

Problem - 1746C - Codeforces

 

给定一个长度为n，每个数为1~n的序列

有n次操作，第i次选择 一个位置 ，那个位置及其后面的全部数加上i，使得整个序列变成上升子序列，输出操作的位置

 

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
//#define int long long 
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =2e5+ 10,M = N *25,base =400  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 1e9+7;
const LL LNF=(LL) INF * INF;




inline void solve()
{
	int n;cin >> n;
	VI a(n);
	fu(i,0,n-1) cin >> a[i];
	
	fd(i,n-1,1)a[i] -= a[i-1];
	
	VI p(n);
	iota(p.begin(),p.end(),0);// 构造0~n-1 

// i,j, p[] 对应的值 , 让a[i] 大的  对上 前面的值，因为 p是从小到大的
// 也就是 让 a[i] 大的  对上 较小的值 
	sort(p.begin(),p.end(),[&](int i,int j){
		return a[i] > a[j] ;
	});
	
	fu(i,0,n-1) cout << p[i] + 1 <<" \n"[i==n-1];
					
	
}
signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
//	init(N-1);
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
//#define int long long 
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =2e5+ 10,M = N *25,base =400  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 1e9+7;
const LL LNF=(LL) INF * INF;

int a[N],ans[N],s[N];

inline void solve()
{
	int n;cin >> n;
	fu(i,1,n) cin >> a[i],ans[i] = 0;
	
	fd(i,n,1)s[i] = a[i] - a[i-1];
	
	fu(i,1,n)
	if(s[i] <= 0 ) // i < j a[i-1] > a[i]  
	{
		ans[a[i-1]] = i ; // a[i] + a[i-1] > a[i-1](1~n) 
	}
	
	fu(i,1,n) if(!ans[i]) ans[i] = 1 ;// 整个数组的都加 i，不影响单调性，但这个位置不能不填 
	
	fu(i,1,n ) cout << ans[i] <<" \n"[i == n];					
	
}
signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
//	init(N-1);
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}