多校
关注
分享
扫一扫
多校
lwgkzl
海风和着歌声，星空伴着代码
展开
-
hdu 6058 Kanade's sum
Problem Description Give you an array A[1..n]of length n. Let f(l,r,k) be the k-th largest element of A[l..r]. Specially , f(l,r,k)=0 if r−l+1k. Give you k , you need to calculate ∑原创 2017-08-02 12:42:53 · 271 阅读 · 0 评论 -
HDU 6060 RXD and dividing（贪心，思维）
RXD and dividing Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 441 Accepted Submission(s): 179 Problem Description R原创 2017-08-02 12:57:20 · 361 阅读 · 0 评论