[SWEA] 정곤이의 단조 증가하는 수

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWcPjEuKAFgDFAU4

SW Expert Academy

 

 

 

[소스 코드]

import java.util.*;
import java.io.*;
public class Solution {
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			int n = Integer.parseInt(br.readLine());
			st = new StringTokenizer(br.readLine());
			int[] nums = new int[n];
			for(int i=0;i<n;i++) {
				nums[i] = Integer.parseInt(st.nextToken());
			}
			Queue<Integer> q = new LinkedList<>();
			for(int i=0;i<n;i++) {
				for(int j=i+1;j<n;j++) {
					q.offer(nums[i]*nums[j]);
				}
			}
			int result = -1;
			while(!q.isEmpty()) {
				int origin = q.poll();
				int target = origin;
				boolean check = false;
				while(target>0) {
					int cmp = target % 10;
					target /= 10;
					if(cmp < (target%10)) {
						check = true;
						break;
					}
				}
				if(!check) {
					result = Math.max(result, origin);
				}
			}
			System.out.println("#"+tc+" "+result);
		}
	}
}