摘要:
D - 3N Numbers Time limit : 2sec / Memory limit : 256MB Score : 500 points Problem Statement Let N be a positive integer. There is a numerical sequenc 阅读全文
摘要:
D. Array Division time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Array Division time 阅读全文
摘要:
H. HighwayIn ICPCCamp there were n towns conveniently numbered with 1,2,...,n connected with (n−1) roads. Thei-th road connecting towns a i and b i ha 阅读全文
摘要:
E. Partial SumBobo has a integer sequence a 1 ,a 2 ,...,a n of length n. Each time, he selects two ends 0 ≤ l < r ≤ n andadd |∑ rj=l+1 a j | − C into 阅读全文
摘要:
C. Success Rate time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Success Rate time lim 阅读全文
摘要:
Building Shops Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description HDU’s n classrooms are on a line 阅读全文