Summing the Lengths of the Longest Increasing Subsequence of Permutations

Problem Number: 
11 272
Type of Problem: 
Single Output Problem
Problem Category: 
Volume 112 (11,200-11,299)
Input: 
Random Input
0
0
Critical Input: 
Random Input: 
9739 713 4578 4032 90953 59622 59995 101 97377 67526 650 5632 730934 8529 11410 81954 625 325 837388 5595 50443 35442 26434700 1022 340250 4013 4766 1132 378 11350 66656 102379 7245641 12438 4042 6340993 7206 99999999 54638 6943 729 7225 78275 46070 1001 274 99944 901 4791 952
Problem Description Link: 
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=1…
Problem Analysis Link: 
Flag: 
1
Restrict Problem Hints: 
0
Restrict Problem Inputs: 
0
Problem Id: 
11272