Cod sursa(job #2634939)

Utilizator OvidRata Ovidiu Ovid Data 12 iulie 2020 19:06:38
Problema Xor Max Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1 kb
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll


int t, n, m, k, a[300010], crd[10000], q, l, r;


int32_t main(){
INIT
cin>>t;

while(t--){
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>a[i]; crd[a[i] ]=i;
    }

    int mn1=n, mn2=n;

    for(int i=2; i<n; i++){
            mn1=n;
        for(int j=1; j<i; j++){
            mn1=min(mn1, a[j]); if(mn1<a[i]){break;}
        }
    mn2=n;
    for(int j=i+1; j<=n; j++){
        mn2=min(mn2, a[j]); if(mn2<a[i]){break;}
    }
    if(mn1<a[i] && mn2<a[i] ){
        cout<<"YES\n"<<crd[mn1]<<" "<<i<<" "<<crd[mn2]<<"\n"; goto Next;
    }
    }
    cout<<"NO\n";
Next:continue;
}


return 0;
}