题解 | #深渊水妖#

A题

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll n,l;
	cin>>n;
	while(n--) {
		cin>>l;
		vector<ll>a(l+1,0);
		vector<ll>b;
		for(ll i=0; i<l; i++)cin>>a[i];
		ll max=-1,left=0;
		for(ll i=1; i<=l; i++) {
			if(a[i]<a[i-1]){
				if(a[i-1]-a[left]>max){
					b.clear();
					b.push_back(left+1);
					b.push_back(i);
					max=a[i-1]-a[left];
				}
				else if(a[i-1]-a[left]==max){
					b.push_back(left+1);
					b.push_back(i);
				}
				left=i;
			}
		}
		for(auto j:b)cout<<j<<" ";
		cout<<'\n';
	}
	return 0;
}