提出 #73162493

---

ソースコード 拡げる

//I often recall the past. 
//Life is captured in an instant in my mind. I cut, fold and curl the time behind me, and twist it into the white clouds in the sky. 
//There are distinctions among clouds: cumulus clouds are thick and heavy, while cirrus clouds are ethereal and light. The scenes that shock me in life remain unforgettable for a lifetime once they pass through my mind, while more ordinary and common memories leave only a few remnants after being washed away by time. Recalling the past is like entering a dream; if it is too clear, it cannot please my imagination, and if it is too vague, it will fall into nothingness. Only the mountains and waters in the mist, the woman behind the veil, that just-right haziness, can satisfy my strict demands for beauty. 
//Memories always wrap me up in the yellowed pages unexpectedly. Friends who parted and reunited, streets that were demolished and rebuilt, all these clues help me set off from a specific moment and travel upstream along the river of time. The past days can never come back, and I am just a passer-by. But I still long to leave some leisure time during each journey of reminiscence, to linger before a scene, to look back at my past self in the haze of time, and to feel as much sweetness as possible. The good times once flowed through my body, and I am content. 
//The past has solidified. I move forward with my memories, but I often neglect to keep them well, and the memories themselves are changing their forms. This brings some challenges to my journey of reminiscence. 
//Where should I stop? I ask myself.
#include<bits/stdc++.h>
#define fre(x) \
	freopen(x".in","r",stdin); \
	freopen(x".out","w",stdout)
#define int long long
#define il inline
namespace IO {
	template <typename T>
	void read(T &x)
	{
		x=0;
		T flag=1;
		char ch=getchar();
		while(ch<'0' or ch>'9')
		{
			if(ch=='-')
				flag=-flag;
			ch=getchar();
		}
		while(ch>='0' and ch<='9')
		{
			x=(x<<3)+(x<<1)+(ch-'0');
			ch=getchar();
		}
		x*=flag;
	}
	template <typename T>
	void print(T x)
	{
		if(x<0)
			putchar('-'),x=-x;
		int W[114],cnt=0;
		do
		{
			W[++cnt]=x%10;
			x/=10;
		}while(x);
		for(int i=cnt;i>=1;i--)
			putchar(W[i]+'0');
	}
}
using namespace IO;
using namespace std;

const int MOD=1e9+7;

il int add(int A,int B) {return A+B>=MOD?A+B-MOD:A+B;}
il int sub(int A,int B) {return A-B<0?A-B+MOD:A-B;}
il int mul(int A,int B) {return 1ll*A*B>=MOD?1ll*A*B%MOD:A*B;}

il void Add(int &A,int B) {A+B>=MOD?A=A+B-MOD:A+=B;}
il void Sub(int &A,int B) {A-B<0?A=A-B+MOD:A-=B;}
il void Mul(int &A,int B) {1ll*A*B>=MOD?A=1ll*A*B%MOD:A*=B;}

il int qpow(int A,int B)
{
	int res=1;
	
	while(B)
	{
		if(B&1)
			Mul(res,A);
		Mul(A,A);
		B>>=1;
	}
	
	return res;
}

il int inv(int A) {return qpow(A,MOD-2);}

const int MAXN = 1e6 + 7;

int n, l, r;

struct node {
	int id, val;
} p[MAXN];

void work()
{
    int maxx = INT_MIN, minx = INT_MAX, ans = 0;

    scanf("%lld", &n);

	scanf("%lld %lld", &l, &r);

	for(int i = 1; i <= n; i++)
	{
		scanf("%lld", &p[i].val);

        maxx = max(maxx, p[i].val);
        minx = min(minx, p[i].val);

        if(p[i].val >= l and p[i].val <= r)
        {
            if(p[i].val > p[ans].val or !ans)
                ans = i;
        }
	}

    if(maxx < l or minx > r)
        puts("-1");
    else
        printf("%lld", ans);

    return ;
}

signed main()
{
	int T = 1;
	
//	scanf("%lld",&T);
	
	while(T--)
		work();
	
	return 0;
}

提出情報

ジャッジ結果