Java

Copy
import java.io.*;
import java.util.*;

public class ConsecutiveSubsequence {
	public static void main(String[] args) {
		Kattio io = new Kattio();
		int N = io.nextInt();
		int[] arr = new int[N];
		for (int i = 0; i < N; i++) { arr[i] = io.nextInt(); }

C++

Copy
#include <bits/stdc++.h>
using namespace std;

int main(void) {
	int n;
	cin >> n;

	vector<int> v(n);
	for (auto &i : v) cin >> i;

Python

Copy
size = int(input())
arr = list(map(int, input().split()))

best_len = 1
# given the ending limit, stores the longest consecutive sequence
ending_max_len = {}  # {element: (length, index)}
come_from = {}  # {index: previous_index}
for i in range(size):
	n = arr[i]
	if (n - 1) not in ending_max_len: