It’s universally acknowledged that there’re innumerable trees in the campus of HUST. There is a row of trees along the East-9Road which consists of N trees. Now that we know the height of each tree, the gardeners of HUST want to know the super-neatness of this row of trees. The neatness of asequence of trees is defined as the difference between the maximum height and minimum height in this sequence. The super-neatness of this sequence of treesis defined as the sum of neatness of allcontinous subsequences of the trees. Multiple cases please process until the end of input.There are at most 100 test cases.
It’s universally acknowledged that there’re innumerable trees in the campus of HUST. There is a row of trees along the East-9 Road which consists of N trees. Now that we know the height of each tree, the gardeners of HUST want to know the super-neatness of this row of trees. The neatness of a sequence of trees is defined as the difference between the maximum height and minimum height in this sequence. The super-neatness of this sequence of trees is defined as the sum of neatness of all continous subsequences of the trees. Multiple cases please process until the end of input. There are at most 100 test cases.
（图片来源网络，侵删）
