fork download
copy 
  1.  
  2. import java.io.BufferedReader;
  3. import java.io.IOException;
  4. import java.io.InputStreamReader;
  5. import java.io.OutputStream;
  6. import java.io.PrintWriter;
  7. import java.util.StringTokenizer;
  8.  
  9.  
  10. public class Main {
  11.  
  12. 	static class FastReader { 
  13. 		BufferedReader br; 
  14. 		StringTokenizer st; 
  15.  
  16. 		public FastReader() 
  17. 		{ 
  18. 			br = new BufferedReader(new
  19. 					InputStreamReader(System.in)); 
  20. 		} 
  21.  
  22. 		String next() 
  23. 		{ 
  24. 			while (st == null || !st.hasMoreElements()) 
  25. 			{ 
  26. 				try
  27. 				{ 
  28. 					st = new StringTokenizer(br.readLine()); 
  29. 				} 
  30. 				catch (IOException  e) 
  31. 				{ 
  32. 					e.printStackTrace(); 
  33. 				} 
  34. 			} 
  35. 			return st.nextToken(); 
  36. 		} 
  37.  
  38. 		int nextInt() 
  39. 		{ 
  40. 			return Integer.parseInt(next()); 
  41. 		} 
  42.  
  43. 		long nextLong() 
  44. 		{ 
  45. 			return Long.parseLong(next()); 
  46. 		} 
  47.  
  48. 		double nextDouble() 
  49. 		{ 
  50. 			return Double.parseDouble(next()); 
  51. 		} 
  52.  
  53. 		String nextLine() 
  54. 		{ 
  55. 			String str = ""; 
  56. 			try
  57. 			{ 
  58. 				str = br.readLine(); 
  59. 			} 
  60. 			catch (IOException e) 
  61. 			{ 
  62. 				e.printStackTrace(); 
  63. 			} 
  64. 			return str; 
  65. 		} 
  66. 	}
  67.  
  68. 	static int l,r,mid,i1,i2,now;
  69.  
  70. 	static int get(int a, int b, int[] arr, int n) {
  71. 		if(arr[n-1]<a || arr[0]>b) return 0;
  72. 		l = 0;
  73. 		r = n-1;
  74. 		while(l<=r) {
  75. 			mid = (l+r)/2;
  76. 			if(arr[mid]==a) {
  77. 				now=mid;
  78. 				break;
  79. 			}
  80. 			if(arr[mid]<a) l = mid+1;
  81. 			else {
  82. 				r = mid-1;
  83. 				now = mid;
  84. 			}
  85. 		}
  86. 		i1 = now;
  87. 		l=0;
  88. 		r=n-1;
  89. 		while(l<=r) {
  90. 			mid = (l+r)/2;
  91. 			if(arr[mid]==b) {
  92. 				now = mid;
  93. 				break;
  94. 			}
  95. 			if(arr[mid]<b) {
  96. 				now = mid;
  97. 				l = mid + 1;
  98. 			} else {
  99. 				r = mid - 1;
  100. 			}
  101. 		}
  102. 		i2=now;
  103. 		return i2-i1+1;
  104. 	}
  105.  
  106. 	public static void main(String[] args) {
  107.  
  108. 		FastReader sc = new FastReader();
  109. 	    OutputStream outputstream = System.out;
  110. 	    PrintWriter out = new PrintWriter(outputstream);
  111.  
  112. 	    int t = sc.nextInt();
  113. 	    int n,q;
  114. 	    int a,b;
  115. 	    int[] arr = new int[100000];
  116. 	    long ans;
  117. 	    int cas = 0;
  118. 	    while(t--!=0) {
  119. 	    	out.println("Case " + ++cas + ":");
  120. 	    	n = sc.nextInt();
  121. 	    	q = sc.nextInt();
  122. 	    	for(int i = 0; i < n; i++) arr[i] = sc.nextInt();
  123. 	    	while(q--!=0) {
  124. 	    		a = sc.nextInt();
  125. 	    		b = sc.nextInt();
  126. 	    		ans = get(a,b,arr,n);
  127. 	    		out.println(ans);
  128. 	    	}
  129. 	    }
  130. 	    out.close();
  131.  
  132. 	}
  133.  
  134. }
Success #stdin #stdout 0.05s 2184192KB
comments (?)
stdin
copy 
5
5 2
1 2 3 4 5
0 0
0 1
5 1
6962 6964 8486 8924 9317
2312 2956
5 2
1 100 1000 9999 10000
1 99
9998 10001
2 5
1 100000000
1 2
2 3
3 4
4 5
5 6
5 1
10 20 30 40 50
15 45
stdout
copy 
Case 1:
0
1
Case 2:
0
Case 3:
1
2
Case 4:
1
0
0
0
0
Case 5:
3
https://ideone.com/6ssrQF
language:
Java (HotSpot 12)
created:
5 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!