Create Hw3LICS.cpp

// Write a C++ program LICS.cpp which, given two sequences of integers, computes and prints
// the length of the longest possible increasing subsequence common to the two input sequences. A
// subsequence is a subset of elements which keep their orders (not necessarily consecutive) in the
// original sequence. Your program should get its input from cin. The input has two lines and each
// line contains the length of a sequence of integers followed by the sequence itself. Example runs of
// valid input arguments are (the first line is the command line, the second and third lines are the
input and the fourth line is the expected output of your program).