using System; using System.IO; using System.Net; using System.Net.Sockets; using System.Linq; using System.Collections; using System.Collections.Generic; using System.Text; using System.Numerics; using System.Threading.Tasks; using System.Text.RegularExpressions; using static System.Math; using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions; using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute; public static class P { public static void Main() { var nq = Console.ReadLine().Split().Select(int.Parse).ToArray(); var n = nq[0]; var q = nq[1]; var a = Console.ReadLine().Split().Select(int.Parse).ToArray(); //Mo //伸ばしていく時に高くなりうる要素を集めて、 var chunkSize = 256; var res = new int[q]; foreach (var chunk in Enumerable.Range(0, q) .Select(Index => new { Index, Elem = Query.Parse(Console.ReadLine()) }) .GroupBy(x => x.Elem.L >> 8)) { List highCand = new List(); var chunkEnd = Min(q, (chunk.Key + 1) << 8); highCand.Add(-1); var curInd = chunkEnd; foreach (var item in chunk.OrderBy(x => x.Elem.R)) { while (curInd < item.Elem.R) { if (highCand.Last() < a[curInd]) highCand.Add(a[curInd]); curInd++; } int count = 0; int curMax = 0; for (int i = item.Elem.L; i < chunkEnd; i++) { if (curMax < a[i]) { curMax = a[i]; count++; } } res[item.Index] = count + highCand.Count - (~highCand.BinarySearch(curMax)); } } Console.WriteLine(string.Join("\n", res)); } } struct Query { public int L; public int R; public static Query Parse(string s) { var qlr = s.Split().Select(int.Parse).ToArray(); return new Query() { L = qlr[1] - 1, R = qlr[2] - 1, }; } }