2014年8月16日
CF459D Pashmak and Parmida's problem （树状数组）
摘要： Codeforces Round #261 (Div. 2)题意：给出数组A，定义f(l,r,x)为A[]的下标l到r之间，等于x的元素数。i和j符合f(1,i,a[i])>f(j,n,a[j])，求i和j的种类数。题解：使用树状数组统计小于某数的元素数量。我们可以先把f(1,i,a[i])和f(j... 阅读全文
posted @ 2014-08-16 16:12 带鱼Yuiffy 阅读(753) 评论(0) 推荐(0) 编辑
CF459C Pashmak and Buses （构造d位k进制数
摘要： C - Pashmak and Buses Codeforces Round #261 (Div. 2)C. Pashmak and Busestime limit per test1 secondmemory limit per test256 megabytesinputstandard inp... 阅读全文
posted @ 2014-08-16 10:29 带鱼Yuiffy 阅读(312) 评论(0) 推荐(0) 编辑
CF459A Pashmak and Garden （水
摘要： Pashmak and GardenCodeforces Round #261 (Div. 2)A. Pashmak and Gardentime limit per test1 secondmemory limit per test256 megabytesinputstandard inputo... 阅读全文
posted @ 2014-08-16 09:22 带鱼Yuiffy 阅读(310) 评论(0) 推荐(0) 编辑
CF459B Pashmak and Flowers （水
摘要： Pashmak and FlowersCodeforces Round #261 (Div. 2)B. Pashmak and Flowerstime limit per test1 secondmemory limit per test256 megabytesinputstandard inpu... 阅读全文
posted @ 2014-08-16 09:15 带鱼Yuiffy 阅读(340) 评论(0) 推荐(0) 编辑
CF459E Pashmak and Graph （DP？
摘要： Codeforces Round #261 (Div. 2)E - Pashmak and Graph E. Pashmak and Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inp... 阅读全文
posted @ 2014-08-16 09:10 带鱼Yuiffy 阅读(356) 评论(0) 推荐(0) 编辑