結果
| 問題 | No.905 Sorted? |
| ユーザー |
 Oland
|
| 提出日時 | 2019-10-12 01:30:53 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 455 ms / 2,000 ms |
| コード長 | 5,879 bytes |
| コンパイル時間 | 2,079 ms |
| コンパイル使用メモリ | 80,520 KB |
| 実行使用メモリ | 69,220 KB |
| 最終ジャッジ日時 | 2024-11-26 02:25:43 |
| 合計ジャッジ時間 | 8,752 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 23 |
ソースコード
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
private FastScanner in = new FastScanner(System.in);
private PrintWriter out = new PrintWriter(System.out);
final int MOD = (int)1e9+7;
long ceil(long a, long b){return (a + b - 1) / b;}
//A + sumA = B + sumB
void solve() throws Exception{
int N = in.nextInt();
long[] A = new long[N];
int[][] label = new int[N][2];
for(int i = 0; i < N; i++){
A[i] = in.nextLong();
if(i >= 1){
label[i][0] = label[i-1][0] + (A[i-1] <= A[i] ? 0 : 1);
label[i][1] = label[i-1][1] + (A[i-1] >= A[i] ? 0 : 1);
}
}
int Q = in.nextInt();
for(int i = 0; i < Q; i++){
int L = in.nextInt(), R = in.nextInt();
out.println((label[L][0] == label[R][0] ? "1" : "0") + " " + (label[L][1] == label[R][1] ? "1" : "0"));
}
}
//end solve
public static void main(String[] args) throws Exception {
new Main().m();
}
private void m() throws Exception {
solve();
out.flush();
}
static class FastScanner {
Reader input;
FastScanner() {this(System.in);}
FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
int nextInt() {return (int) nextLong();}
long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}