[Solved] Longest monotonic subsequence algorithm NOT longest increasing algorithm
try this one: import java.io.BufferedReader; import java.io.InputStreamReader; public class Rozwiazanie { public static void main(String[] args) { try { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] splittedLinia = br.readLine().split((char) 32 + “”);//moglaby byc ” ” ale tak na wszelki wypadek nie ma chuja zeby sie popierdolilo teraz nawet na linuxie int aktualnyWyraz = Integer.parseInt(splittedLinia[0]);//uwaga jakby … Read more