Answer Happy

The program should be written in C# programming
language!!!
Only C# language accepted.
Please write code relevant to the problem!!!
Thank you for your hard work.
Considering a finite sequence of integers. A subsequence of length K is formed by K (not necessarily consecutive) elements of the original sequence. However, these elements are required to appear in the same ordering as they were in the original sequence. We say that a sequence a[1], a[2], ..., a[K] has at most one fall if for all but at most one j from {1, 2,... K-1} it holds that alj] = a[j+1]. Write a program that determines length of maximum such subsequence with at most one fall in a given sequence of N elements. First line of the input consists of positive integer N, N = 10 000. Second line consists of the sequence of Nintegers. Individual integers are separated by a space-character. Program outputs one integer - the desired length. Example: For the input 9 597 378 2 4 1 the output is 6 as the longest subsequence with at most one fall is: 5778 24.