9702번 - LIS 다국어

Mr. C is interested with Longest Increasing Subsequence problem. Given a sequence S = s₁, s₂, …, s_N. The Longest Increasing Subsequence is the subsequence L = l₁, l₂, …, l_k of S such that l₁ < l₂ < … < l_k. 

Given a sequence S, find the total length of LIS of every consecutive subsequence (subsequence which elements are consecutive in the original sequence) of S with non zero length!

The first line of input consists of an integer T denotes the number of cases. It is followed by T blocks, each representing a case.

The first line of each case contains an integers: N (1 ≤ N ≤ 500), the length of S.

The next N lines each consists of an integer s_i (1 ≤ s_i ≤ N) denoting the i-th element of S. Each element of S is unique.

Output consists of T lines, each describes the solution for each case with the same order as in input.

Each case consists of a single line with the format “Case #i: S”, where i represents the case number and S represents the total length of LIS of every consecutive subsequence of S.