Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

MIMALESU - Min-Max-Length-Sum

SUBSEQ

Example

Input:
4 3
1 2 3 4 Output: 143

Giải thích:

Giải thích


Được gửi lên bởi:noname00.pas
Ngày:2017-12-21
Thời gian chạy:0.100s
Giới hạn mã nguồn:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Ngôn ngữ cho phép:C-CLANG C CSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG C99 JAVA PAS-FPC PYTHON PYTHON3
Nguồn bài:Contest Lào Cai - Vinh (18/12/2017)

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.