Codeforces Round #267 (Div. 2) D. Fedor and Essay tarjan缩点

D. Fedor and Essaytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter you had helped Fedor to
296次阅读

JS+CSS简单实现DIV遮罩层显示隐藏

 1 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> 2  <h
83次阅读

hdu 6069 Counting Divisors 筛法

Counting DivisorsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Problem DescriptionIn mathe
84次阅读

Codeforces Round #271 (Div. 2) E. Pillars 线段树优化dp

E. Pillarstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMarmot found a row with n pil
99次阅读

Codeforces Round #271 (Div. 2) F. Ant colony 线段树

F. Ant colonytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMole is hungry again. He found one a
36次阅读

Codeforces Round #396 (Div. 2) E

Mahmoud and Ehab live in a country with n cities numbered from 1 to n and connected by n - 1 undirected roads.
31次阅读

Codeforces Round #396 (Div. 2) D

Mahmoud wants to write a new dictionary that contains n words and relations between them. There are two types of relations: synonymy (i.&nbs
29次阅读

Codeforces Round #396 (Div. 2) C

Mahmoud wrote a message s of length n. He wants to send it as a birthday present to his friend Moaz who likes strings. He wrote it on a
27次阅读

Codeforces Round #396 (Div. 2) B

Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to
31次阅读

Codeforces Round #396 (Div. 2) A

While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab challeng
31次阅读