上一页 1 2 3 4 5 6 7 8 9 10 ··· 28 下一页

2016年8月6日

SPOJ DQUERY - D-query

摘要: DQUERY - D-query Given a sequence of n numbers a1, a2, ..., an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query 阅读全文

posted @ 2016-08-06 10:25 焰 阅读(374) 评论(0) 推荐(0) 编辑

2016年8月4日

code forces 140F New Year Snowflake

摘要: F. New Year Snowflake F. New Year Snowflake As Gerald ..., in other words, on a New Year Eve Constantine prepared an unusual present for the Beautiful 阅读全文

posted @ 2016-08-04 11:44 焰 阅读(267) 评论(0) 推荐(0) 编辑

2016年8月1日

codeforces 140E New Year Garland

该文被密码保护。 阅读全文

posted @ 2016-08-01 21:11 焰 阅读(27) 评论(0) 推荐(0) 编辑

2016年7月31日

codeforces 148E Porcelain

摘要: E. Porcelain E. Porcelain During her tantrums the princess usually smashes some collectable porcelain. Every furious shriek is accompanied with one it 阅读全文

posted @ 2016-07-31 19:08 焰 阅读(301) 评论(0) 推荐(0) 编辑

codeforces 148D Bag of mice(概率dp)

摘要: D. Bag of mice D. Bag of mice The dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mounta 阅读全文

posted @ 2016-07-31 14:16 焰 阅读(177) 评论(0) 推荐(0) 编辑

2016年7月30日

矩阵快速幂

该文被密码保护。 阅读全文

posted @ 2016-07-30 15:43 焰 阅读(5) 评论(0) 推荐(0) 编辑

codeforces 702E Analysis of Pathes in Functional Graph(倍增)

摘要: E. Analysis of Pathes in Functional Graph E. Analysis of Pathes in Functional Graph You are given a functional graph. It is a directed graph, in which 阅读全文

posted @ 2016-07-30 13:59 焰 阅读(505) 评论(0) 推荐(0) 编辑

2016年7月29日

HDU 3078 Network

摘要: Network Problem Description The ALPC company is now working on his own network system, which is connecting all N ALPC department. To economize on spen 阅读全文

posted @ 2016-07-29 21:35 焰 阅读(189) 评论(0) 推荐(0) 编辑

hdu 2874 Connections between cities(树上倍增)

摘要: Connections between cities Problem Description After World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. Ho 阅读全文

posted @ 2016-07-29 17:42 焰 阅读(294) 评论(0) 推荐(0) 编辑

HDU 2586 How far away ?

摘要: How far away ? Problem Description There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask 阅读全文

posted @ 2016-07-29 09:59 焰 阅读(126) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5 6 7 8 9 10 ··· 28 下一页

导航