find minimum-length subarray that has all numbers
File input.txt consists of two lines: first has integer number N space then integer number K (1 ≤ N,K ≤ 250000). Second has N space-delimeted integers, where each integer is less than or equal to K. It is guaranteed that each integer from 1 to K is in the array. The task is to find subarray of minimum length, that contains all integers. And print its start and end. Note, that indexing starts from 1. Examples: Input Output 5 3 2 4 1 2 1 3 2 6 4 2 6 2 4 2 3 3 1 I had this task in a recent programming competition. It is over, and I am not cheating. I've implemented it using python 3: with open(