- 博客(5)
- 收藏
- 关注
RSS订阅原创 scu oj 4443 Range Query （scoure :2015年四川省acm省赛）
Range Query frog has a permutation p(1),p(2),…,p(n) of {1,2,…,n}. She also has m1+m2 records (ai,bi,ci) of the permutation. For 1≤i≤m1, (ai,bi,ci) means min{p(ai),p(ai+1),…,p(bi)}=ci;For m1i
2015-08-25 11:43:56
1696
原创 hdu 5244 inverse (上海大都会赛) （分治算法）
nverse Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 110 Accepted Submission(s): 44 Problem Description Mike has got a huge ar
2015-08-17 20:36:54
1420
原创 scu oj 4442 Party(2015年四川省acm程序设计竞赛)
Party n frogs are invited to a tea party. Frogs are conveniently numbered by 1,2,…,n. The tea party has black and green tea in service. Each frog has its own preference. He or she may drink only b
2015-08-10 14:29:14
1898
原创 bzoj [NOI2007]货币兑换Cash （cdq分治+斜率优化 ）
1492: [NOI2007]货币兑换Cash Time Limit: 5 Sec Memory Limit: 64 MB Submit: 2454 Solved: 1078 [Submit][Status][Discuss] Description Input 第一行两个正整数N、S，分别表示小Y 能预知的天数以及初始时拥有的钱数。 接下来N 行，第K 行三个实数AK
2015-08-04 19:59:27
714
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人