![]() | ||||
Online Judge | Problem Set | Authors | Online Contests | User |
---|---|---|---|---|
Web Board Home Page F.A.Qs Announcement | Current Contest Past Contests Scheduled Contests Award Contest |
Sticks Problem Time Limit:6000MS Memory Limit:65536K
Xuanxuan has n sticks of different length. One day, she puts all her
sticks in a line, represented by S1, S2, S3, ...Sn. After measuring the
length of each stick Sk (1 <= k <= n), she finds that for some
sticks Si and Sj (1<= i < j <= n), each stick placed between
Si and Sj is longer than Si but shorter than Sj.
The input contains multiple test cases. Each case contains two lines.
Output the maximum value j - i in a single line. If there is no such i and j, just output -1. Sample Input
POJ Monthly,static |
[Submit] [Go Back] [Status] [Discuss]
All Copyright Reserved 2003-2005 Ying Fuchen,Xu Pengcheng
Any problem, Please Contact Administrator