Gnarly Cow We are continually faced with a series of great opportunities brilliantly disguised as insoluble problems.

  • About
  • Contact Me
  • Quotes

  •  

    January 2010
    M T W T F S S
    « Jul   Jun »
     123
    45678910
    11121314151617
    18192021222324
    25262728293031

  • Meta

    • Register
    • Log in
    • Entries RSS
    • Comments RSS
    • WordPress.org

  • Recent Posts

    • [NOI2005][Day1]维护数列(sequence)
    • An Algorithm to the Maximum Single-Degree-Constrained Spanning Tree Problem
    • SGU 242 Student’s Morning
    • USACO OPEN09 Gold Summary
    • 我十八岁了

  • Spam Blocked

    498 spam comments blocked by
    Akismet

An Algorithm to the Maximum Single-Degree-Constrained Spanning Tree Problem

January 15, 2010 — gnarlycow

My Paper Download Link (Format: PDF)

My Photos

Posted in General. 2 Comments »
« SGU 242 Student’s Morning
[NOI2005][Day1]维护数列(sequence) »
Valid XHTML Strict 1.0 • Theme: Garland-revisited by Pross
19 queries • 0.412 seconds

  • Tag Explosion

    省选 计划 许烁 anjuta CQTSC DP Entertainment Gold IPSC Life linux NOI POI ppa Rated Shawn Xu Splay SPOJ SRM stick Summary TopCoder Tree ubuntu USACO

    WP Cumulus Flash tag cloud by Roy Tanck and Luke Morton requires Flash Player 9 or better.

  • Best Friends

    • True EDGE
    • 最熟悉的陌生人

  • Recent Comments

    • 淘宝网 首页 on [NOI2005][Day1]维护数列(sequence)
    • gnarlycow on [NOI2005][Day1]维护数列(sequence)
    • gnarlycow on [NOI2005][Day1]维护数列(sequence)
    • BYVoid on [NOI2005][Day1]维护数列(sequence)
    • BYVoid on [NOI2005][Day1]维护数列(sequence)

  • Categories

    • General
    • Gold Division
    • IPSC
    • NOI
    • POI
    • Software
    • SPOJ
    • SRM
    • TopCoder
    • Uncategorized
    • USACO
    • 生活瞬间
    • 省选

  • Archives

    • June 2010
    • January 2010
    • July 2009
    • May 2009
    • March 2009
    • February 2009