CF1433D Districts Connection
题意:
给定n块区域,某几个区域隶属于同一个帮派,现在要求将他们链接起来要求
相同区域之间不直接相连(其中一共是 n-1 条链接边)
问题分析:
没直接相互链接。。。。只要保证 整组 区域 不是同一个帮派就行
AC代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<sstream>
#include<string.h>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
#define ll long long
#define lowbit(x) (x)&(-x)
#define mem(a,b) memset((a),(b),sizeof(a));
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
const ll inf=0x3f3f3f3f;//1061109567,2*未超int,allinf=mem(a,0x3f,sizeof(a));
typedef pair<int ,int > PII;
const int nn=1e6+10;
int a[6000];
int main()
{
//#define io
#ifdef io
freopen("in.txt","r",stdin);
#endif
int t,n,i,j,k;
cin>>t;
while(t--){
cin>>n;
k=0;
forr(i,1,n){
cin>>a[i];
if(a[i]!=a[1]){
k=i;
}
}
if(!k)cout<<"NO"<<endl;
else{
cout<<"YES"<<endl;
forr(i,2,n){
if(a[i]==a[1])cout<<k<<" "<<i<<endl;
else cout<<1<<" "<<i<<endl;;
}
}
}
return 0;
}