枚举、模拟与排序

枚举、模拟与排序

import java.util.Scanner;

public class Main {
	
	static int INF = 0x3f3f3f3f;
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int[] a = new int[n + 5];
		for (int i = 0; i < n; i ++) {
			a[i] = in.nextInt();
		}
		int cnt = 0;
		for (int i = 0; i < n; i ++) {
			int maxn = -INF, minn = INF;
			for (int j = i; j < n; j ++) {
				maxn = Math.max(maxn, a[j]);
				minn = Math.min(minn, a[j]);
				if (maxn - minn == j - i) cnt ++;
			}
		}
		System.out.println(cnt);
	}

}

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int ans = 0;
		for (int i = 1; i <= n; i ++) {
			int x = i;
			while (x > 0) {
				int t = x % 10;
				x /= 10;
				if (t == 2 || t == 1 || t == 0 || t == 9) {
					ans += i;
					break;
				}
			}
		}
		System.out.println(ans);
	}

}

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		int cnt = 0;
		int[] a = new int[10010];
		while (T -- > 0) {
			String s = in.nextLine();
			String[] arr = s.split(" ");
			for (int i = 0; i < arr.length; i ++) {
				a[cnt ++] = Integer.parseInt(arr[i]);
			}
		}
		Arrays.sort(a, 0, cnt);
		int ans1 = 0, ans2 = 0;
		for (int i = 1; i < cnt; i ++) {
			if (a[i] == a[i - 1]) ans2 = a[i];
			else if (a[i] >= a[i - 1] + 2) ans1 = a[i] - 1;
		}
		System.out.println(ans1 + " " + ans2);
	}

}