Codeforces 1838B Minimize Permutation Subarrays

​
题目描述：

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a permutation pp of size nn. You want to minimize the number of subarrays of pp that are permutations. In order to do so, you must perform the following operation exactly once:

Select integers ii, jj, where 1≤i,j≤n1≤i,j≤n, then
Swap pipi and pjpj.
For example, if p=[5,1,4,2,3]p=[5,1,4,2,3] and we choose i=2i=2, j=3j=3, the resulting array will be [5,4,1,2,3][5,4,1,2,3]. If instead we choose i=j=5i=j=5, the resulting array will be [5,1,4,2,3][5,1,4,2,3].

Which choice of ii and jj will minimize the number of subarrays that are permutations?

A permutation of length nn is an array consisting of nn distinct integers from 11 to nn in arbitrary order. For example, [2,3,1,5,4][2,3,1,5,4] is a permutation, but [1,2,2][1,2,2] is not a permutation (22 appears twice in the array), and [1,3,4][1,3,4] is also not a permutation (n=3n=3 but there is 44 in the array).

An array aa is a subarray of an array bb if aa can be obtained from bb by the deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.

Input

The first line of the input contains a single integer tt (1≤t≤1041≤t≤104) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer nn (3≤n≤2⋅1053≤n≤2⋅105) — the size of the permutation.

The next line of each test case contains nn integers p1,p2,…pnp1,p2,…pn (1≤pi≤n1≤pi≤n, all pipi are distinct) — the elements of the permutation pp.

It is guaranteed that the sum of nn over all test cases does not exceed 2⋅1052⋅105.

Output

For each test case, output two integers ii and jj (1≤i,j≤n1≤i,j≤n)  — the indices to swap in pp.

If there are multiple solutions, print any of them.

输入：

8
3
1 2 3
3
1 3 2
5
1 3 2 5 4
6
4 5 6 1 2 3
9
8 7 6 3 2 1 4 5 9
10
7 10 5 1 9 8 3 2 6 4
10
8 5 10 9 2 1 3 4 6 7
10
2 3 5 7 10 1 8 6 4 9

输出：

2 3
1 1
5 2
1 4
9 5
8 8
6 10
5 4

题目大意：将1-n按任意顺序排列，我们可以交换任意两个数，为了使该排列的子排列满足题目给定条件的数目最少。

思路分析：最理想的情况下，满足条件的只有[1]和排列本身。我们只需要分析1，2和n之间的位置关系，让n始终位于1和2之间即可。

代码：

#include<iostream>
using namespace std;
int a[200005];
int main(){
    int t;
    cin>>t;
    while(t--){
        int n,index1,index2,indexm=-1,maxs=-1;
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            if(a[i]==1)
            index1=i;
            if(a[i]==2)
            index2=i;
            if(a[i]>maxs){
                maxs=a[i];
                indexm=i;
            }
        }
        if(indexm>index1){
            if(index2>indexm){
                cout<<index1<<" "<<index1<<endl;
            }
            else
            if(index2>index1&&index2<indexm){
                cout<<index2<<" "<<indexm<<endl;
            }
            else{
                cout<<index1<<" "<<indexm<<endl; 
            }
        }
        else
        {
            if(index2>index1){
                cout<<index1<<" "<<indexm<<endl;
            }
            else
            if(index2>indexm&&index2<index1){
                cout<<index2<<" "<<indexm<<endl;
            }
            else{
                cout<<index1<<" "<<index1<<endl; 
            }
        }
    }
}

​