原题

#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
int n,m,a[maxn],l[maxn],r[maxn];
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i]; 	T463178
	}
	for(int i=1;i<=m;i++){
		cin>>l[i]>>r[i]; 
	}
	int k=0;
	for(int i=1;i<=m;i++){
		if(r[i]-l[i]+1<3){
			cout<<"Not triangle"<<endl;
			k=1;
			continue;
		} 
		for(int j=l[i];j<=r[i];j++){
			if(a[i]+a[i+1]>a[i+2]){
				if(a[i]+a[i+2]>a[i+1]){
					if(a[i+1]+a[i+2]>a[i]){
						cout<<"Triangle"<<endl;
						break;
					} 
				}
			}
			if(a[i+2]!=r[i]) break;	
		}
		cout<<"Not triangle"<<e	ndl;
	}
	return 0;
}