[B! algorithm] eagletmtã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

eagletmt id:eagletmt

algorithmã«é–¢ã™ã‚‹eagletmtã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (28)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

æŒ‡æ•°æ™‚é–“ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å…¥é–€
æœ¬æ—¥ã®å†…å®¹ ïƒ˜ NPå›°é›£å•é¡Œã‚’è§£ããŸã‚ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ‰±ã„ã¾ã™ ð‘‚ð‘ƒð‘‡ ð¼ â‰¤ ð´ ð¼ â‰¤ ð‘ð‘‚ð‘ƒð‘‡(ð¼) è¿‘ä¼¼ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãƒ’ãƒ¥ãƒ¼ãƒªã‚¹ãƒ†ã‚£ãƒƒã‚¯ ð‘“ ð‘˜ ð‘ ð‘› FPT ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ maxâ¡ ð‘ð‘¥|ð´ð‘¥ â‰¤ ð‘, ð‘¥: æ•´æ•°} { ð‘‚âˆ— ð‘ ð‘› æ•´æ•°è¨ˆç”» åŽ³å¯†æŒ‡æ•°æ™‚é–“ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 3 åŠ¹çŽ‡çš„ãªæŒ‡æ•°æ™‚é–“ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ïƒ˜ ä½•ã®æŒ‡æ•°ï¼Ÿ ïµ é ‚ç‚¹æ•°? è¾ºã®æ•°? ãã‚Œã¨ã‚‚â€¦ â€¢ 2 ð¸ ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã¾ãšå½¹ã«ç«‹ãŸãªã„ãŒï¼Œ2 ð‘‰ ã®ã‚¢ãƒ« ã‚´ãƒªã‚ºãƒ ãªã‚‰ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã§ã‚‚ã‚ˆãå‡ºé¡Œã•ã‚Œã¦ã„ã‚‹ â€¢ å…¥åŠ›ã‚µã‚¤ã‚ºã¨ã¯åˆ¥ã®ãƒ‘ãƒ©ãƒ¡ãƒ¼ã‚¿ã«é–¢ã—ã¦ã®ã¿æŒ‡æ•°ã§ã‚ã‚‹ ã‚ˆã†ãªå ´åˆã‚‚ã‚ã‚‹ (FPTã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ) ïƒ˜ æŒ‡æ•°ã®åº•ã¯ï¼Ÿ ð‘› ïµ2 ð‘› ã¨2 ã§ã¯è§£ã‘ã‚‹ã‚µã‚¤ã‚ºãŒå€é•ã† 2 100 ïµ 1.2 < 1004 ïƒ˜ ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã«å‡ºã†ã‚‹ã‚‚ã®ã«çµžã£ã¦è§£èª¬ 4
eagletmt 2012/03/27
algorithm
ãƒªãƒ³ã‚¯
What's new in purely functional data structures since Okasaki?
Since Chris Okasaki's 1998 book "Purely functional data structures", I haven't seen too many new exciting purely functional data structures appear; I can name just a few: IntMap (also invented by Okasaki in 1998, but not present in that book) Finger trees (and their generalization over monoids) There are also some interesting ways of implementing already known datastructures, such as using "nested
eagletmt 2012/02/10
algorithm
ãƒªãƒ³ã‚¯
Topcoder
Topcoder is a crowdsourcing marketplace that connects businesses with hard-to-find expertise. The Topcoder Community includes more than one million of the worldâ€™s top designers, developers, data scientists, and algorithmists. Global enterprises and startups alike use Topcoder to accelerate innovation, solve challenging probl ems, and tap into specialized skills on demand.
eagletmt 2011/06/18
Binary Indexed Trees

algorithm
ãƒªãƒ³ã‚¯
Data Structure Visualization
Currently, we have visualizations for the following data structures and algorithms: Basics Stack: Array Implementation Stack: Linked List Implementation Queues: Array Implementation Queues: Linked List Implementation Lists: Array Implementation (available in java version) Lists: Linked List Implementation (available in java version) Recursion Factorial Reversing a String N-Queens Probl em Indexing
eagletmt 2011/05/03
algorithm
ãƒªãƒ³ã‚¯
What are the lesser known but useful data structures?
There are some data structures around that are really useful but are unknown to most programmers. Which ones are they? Everybody knows about linked lists, binary trees, and hashes, but what about Skip lists and Bloom filters for example. I would like to know more data structures that are not so common, but are worth knowing because they rely on great ideas and enrich a programmer's tool box. PS: I
eagletmt 2011/03/25
algorithm
ãƒªãƒ³ã‚¯
Main Page - Algowiki
AlgoWiki: The Programmer's Compendium Welcome to AlgoWiki, your resource for all algorithms, large and small. Please feel free to contribute as much as you'd like. We're still got a long way to go before we have a decent-sized code base. You can search for topics using the Search box, you can click Random page to go to a random page, or you can go to Special:Allpages to view a list of all the page
eagletmt 2010/12/19
algorithm
ãƒªãƒ³ã‚¯
ãƒžãƒ«ãƒã‚ãƒ¼ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ - sileã®ãƒ–ãƒã‚°
ã€ŒSorting and Searching Stringsã€ã§èª¬æ˜Žã•ã‚Œã¦ã„ã‚‹ãƒžãƒ«ãƒã‚ãƒ¼ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã®å®Ÿè£…ã€‚ è©³ç´°ã¯ãƒªãƒ³ã‚¯å…ˆã‚’å‚ç…§ã€‚ ãƒžãƒ«ãƒã‚ãƒ¼ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ æ–‡å—åˆ—ã®é…åˆ—ã®ã‚½ãƒ¼ãƒˆãŒé«˜é€Ÿã«è¡Œãˆã‚‹ URL("http://...")ã®é…åˆ—ã®ã‚ˆã†ãªæŽ¥é éƒ¨åˆ†ã®é‡è¤‡çŽ‡ãŒé«˜ã„æ–‡å—åˆ—é…åˆ—ã®å ´åˆã§ã‚‚æ€§èƒ½ãŒä½Žä¸‹ã—ã«ãã„ ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ + åŸºæ•°ã‚½ãƒ¼ãƒˆã€ã®ã‚ˆã†ãªæ„Ÿã˜ï¼Ÿ ã‚½ãƒ¼ãƒˆæ–¹æ³• åŸºæœ¬çš„ã«ã¯é€šå¸¸ã®ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã¨ä¼¼ã¦ã„ã¦ã€Œãƒ”ãƒœãƒƒãƒˆè¦ç´ *1ã‚’é¸ã‚“ã§ã€é…åˆ—ã‚’åˆ†å‰²ã™ã‚‹ã€ã¨ã„ã£ãŸã“ã¨ã‚’ç¹°ã‚Šè¿”ã™ã€‚ ãŸã ã—ã€ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã¯å„æ®µéšŽã§é…åˆ—ã‚’äºŒåˆ†å‰²(ãƒ”ãƒœãƒƒãƒˆè¦ç´ ã‚ˆã‚Šã‚‚å¤§ãã„ã‹å°ã•ã„ã‹*2 )ã—ã€ãã®ãŸã‚ã®æ¯”è¼ƒã«ã¯è¦ç´ (æ–‡å—åˆ—)å…¨ä½“ã‚’ç”¨ã„ã‚‹ã®ã«å¯¾ã—ã¦ã€ãƒžãƒ«ãƒã‚ãƒ¼ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã§ã¯ã€é…åˆ—ã¯ä¸‰åˆ†å‰²(ãƒ”ãƒœãƒƒãƒˆè¦ç´ ã‚ˆã‚Šã‚‚å¤§ãã„ã‹å°ã•ã„ã‹ã€ãã‚Œã¨ã‚‚ç‰ã—ã„ã‹)ã•ã‚Œã€ãã®ãŸã‚ã®æ¯”è¼ƒã«ã¯æ–‡å—åˆ—å…¨ä½“ã§ã¯ãªã(å„æ®µéšŽã§)ä¸€æ–‡å—ã®ã¿ã€ãŒç”¨ã„ã‚‰ã‚Œ
eagletmt 2010/10/03
algorithm
ãƒªãƒ³ã‚¯
Libicpc - nya3.jp
libic pc ãƒãƒ¼ãƒ kkntkr / Unknown ã«ã‚ˆã‚‹ã€ACM-ICPC å‘ã‘ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å®Ÿè£…ã‚’ã¾ã¨ã‚ãŸãƒšãƒ¼ã‚¸ã§ã™ã€‚ åŸºç¤Ž ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆ ãƒžã‚¯ãƒ è¨ˆç®— ãƒ“ãƒƒãƒˆæ¼”ç®— å®Ÿæ•°æ¯”è¼ƒ å¹¾ä½• åŸºç¤Ž ãƒ‡ãƒ¼ã‚¿æ§‹é€ å†…ç©ãƒ»å¤–ç© å›žè»¢æ–¹å‘é–¢æ•° å°„å½± é¢ç©ãƒ»ä½“ç© å††ã¨å††ã®å…±é€šéƒ¨åˆ† å¤šè§’å½¢ã®é¢ç© äº¤å·® å††ã¨å††ã®äº¤ç‚¹ å††ã¨ç›´ç·šã®äº¤å·®åˆ¤å®š å††ã¨ç›´ç·šã®äº¤ç‚¹ å‡¸å¤šè§’å½¢ã¨ç·šåˆ†ã®åŒ…å«åˆ¤å®š å¤šè§’å½¢ã¨ç‚¹ã®åŒ…å«åˆ¤å®š ç›´ç·šã¨ç›´ç·šã®äº¤å·®åˆ¤å®š ç›´ç·šã¨ç›´ç·šã®äº¤ç‚¹ ç›´ç·šã¨ç·šåˆ†ã®äº¤å·®åˆ¤å®š ç·šåˆ†ã¨ç‚¹ã®äº¤å·®åˆ¤å®š ç·šåˆ†ã¨ç·šåˆ†ã®äº¤å·®åˆ¤å®š è·é›¢ æœ€é ç‚¹å¯¾ ç›´ç·šã¨ç‚¹ã®è·é›¢ ç›´ç·šã¨ç›´ç·šã®è·é›¢ ç›´ç·šã¨ç·šåˆ†ã®è·é›¢ ç·šåˆ†ã¨ç‚¹ã®è·é›¢ ç·šåˆ†ã¨ç·šåˆ†ã®è·é›¢ å¤šè§’å½¢ å‡¸åŒ… å‡¸å¤šè§’å½¢ã®ã‚¯ãƒªãƒƒãƒ”ãƒ³ã‚° ãã®ä»– ã‚¢ãƒ¬ãƒ³ã‚¸ãƒ¡ãƒ³ãƒˆ ãƒ€ã‚¤ã‚¹ ä¸‰æ¬¡å…ƒå¹¾ä½• ç›´ç·šã¨ç›´ç·šã®è·é›¢ ã‚°ãƒ©ãƒ• åŸºç¤Ž ãƒ‡ãƒ¼ã‚¿æ§‹é€ æœ€çŸè·¯ Bellman-Ford Dijkstra Warshall-Flo
eagletmt 2010/07/09
algorithm
ãƒªãƒ³ã‚¯
ç„¼ããªã¾ã—æ³•ãƒ©ã‚¤ãƒ–ãƒ©ãƒª2 - nodchipã®æ—¥è¨˜
ä»¥å‰å…¬é–‹ã—ã¦ã„ãŸç„¼ããªã¾ã—ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãŒå¤ããªã£ãŸã®ã§ã€æ–°ã—ãå…¬é–‹ã—ã¾ã™ã€‚ ãã—ã¦ã€ä»¥å‰ã®è¨˜äº‹ã‚’ç·¨é›†ã—ã‚ˆã†ã¨ã—ãŸã¨ã“ã‚ã€èª¤ã£ã¦å‰Šé™¤ã—ã¦ã—ã¾ã„ã¾ã—ãŸã€‚ã‚‚ã¨ã«ã¯æˆ»ã›ãªã„ã‚ˆã†ã§ã™ãƒ»ãƒ»ãƒ»ã€‚ typedef long long ll; #define REP(i,n) for(int i=0;i<(int)n;++i) #define ALL(c) (c).begin(), (c).end() #ifdef _MSC_VER #include <Windows.h> ll getTime() { return GetTickCount(); } #else #include <sys/time.h> ll getTime() { struct timeval tv; gettimeofday(&tv, NULL); ll result = tv.tv_sec * 1000LL + tv.tv_usec
eagletmt 2010/07/08
algorithm
ãƒªãƒ³ã‚¯
å‰å‘ãã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€Vitebiã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - yasuhisa's blog
Viterbiæ›¸ãã®ä½•å›žç›®ã ã‚ã€‚ã€‚ã€‚é€±æœ«ã«ã¯ãƒã‚¦ãƒ ã‚¦ã‚§ãƒ«ãƒ(Baum-Welch)ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã“ã¨å‰å‘ãå¾Œã‚å‘ãã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ›¸ããŸã„ã¨ã“ã‚ã€‚ www.yasuhisay.info # -*- coding: utf-8 -*- # ç¢ºçŽ‡çš„è¨€èªžãƒ¢ãƒ‡ãƒ«(æ±äº¬å¤§å¦å‡ºç‰ˆ)ç¬¬4ç« (éš ã‚Œãƒžãƒ«ã‚³ãƒ•ãƒ¢ãƒ‡ãƒ«) require 'pp' # å“è©žiã‹ã‚‰å“è©žjã¸ã®é·ç§»ç¢ºçŽ‡ # ç•ªå·ã¨å“è©žã®å¯¾å¿œä»˜ã‘: 0(åè©ž)ã€1(å† è©ž)ã€2(å‹•è©ž)ã€3(å½¢å®¹è©ž)ã€4(å‰ç½®è©ž) a = [[0.3, 0.0, 0.4, 0.1, 0.2], [0.7, 0.0, 0.0, 0.3, 0.0], [0.3, 0.2, 0.1, 0.2, 0.2], [0.5, 0.1, 0.0, 0.4, 0.0], [0.6, 0.3, 0.0, 0.1, 0.0]] # å“è©žjã‹ã‚‰å˜èªžiã‚’ç”Ÿæˆã™ã‚‹ç¢ºçŽ‡ # ç•ªå·ã¨å˜èªžã®å¯¾å¿œä»˜ã‘: 0(T
eagletmt 2010/07/08
algorithm
ãƒªãƒ³ã‚¯
Topcoder
Topcoder is a crowdsourcing marketplace that connects businesses with hard-to-find expertise. The Topcoder Community includes more than one million of the worldâ€™s top designers, developers, data scientists, and algorithmists. Global enterprises and startups alike use Topcoder to accelerate innovation, solve challenging probl ems, and tap into specialized skills on demand.
eagletmt 2010/06/09
algorithm
ãƒªãƒ³ã‚¯
ãƒžãƒ«ãƒã‚³ã‚¢æ™‚ä»£ã®"ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ "å†å…¥é–€
ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å†å…¥é–€ ã¯ã˜ã‚ã« ãƒ»ä¸¦{è¡Œ|åˆ—} & {Lock|Wait}Free ãƒ»ABA & ABA' ãƒ»volatile ï¼† ãƒ¡ãƒ¢ãƒªãƒãƒªã‚¢ ãƒ»ãƒ—ãƒªãƒŸãƒ†ã‚£ãƒ– ãƒ»CAS ãƒ»MCAS ãƒ»STM ãƒ»ãƒ¡ãƒ¢ãƒªç®¡ç†:free & GC ãƒ»Toots List & Skiplist [å˜æ–¹å‘List] ãƒ»ãƒªã‚¹ãƒˆ ãƒ»ç´°ç²’åº¦ãƒªã‚¹ãƒˆ ãƒ»Lazyãƒªã‚¹ãƒˆ ãƒ»Lock-Freeãƒªã‚¹ãƒˆ ãƒ»Lock-Freeãƒªã‚¹ãƒˆ2 [SkipList] ãƒ»ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ ãƒ»Lazyã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ ãƒ»Lock-freeã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ [åŒæ–¹å‘List] Queue & PriorityQueue [UnBounded Queue] ãƒ»Queue ãƒ»CAS based Lock-Free Queue ãƒ»LL/SC based Lock-Free Queue [Unbounded Priority Queue] ãƒ»Heap
eagletmt 2010/05/03
algorithm
ãƒªãƒ³ã‚¯
ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã§ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€
GPGPU Seminar (GPU Accelerated Libraries, 2 of 3, cuSPARSE)
eagletmt 2010/03/29
Union-Find, ãƒã‚±ãƒƒãƒˆæ³•, å¹³æ–¹åˆ†å‰², ã‚»ã‚°ãƒ¡ãƒ³ãƒˆæœ¨, Binary Indexed Tree, é ˜åŸŸæœ¨(Range Tree)

algorithm
ãƒªãƒ³ã‚¯
ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã§ã®å‹•çš„è¨ˆç”»æ³•
Bahasa dan kebudayaan Jepang - daftar kosa kata - Japan Foundation
eagletmt 2010/03/29
algorithm

dp
ãƒªãƒ³ã‚¯
ãƒ¡ãƒ¢åŒ–ã‚’ç”¨ã„ãŸãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã®å®Ÿè£…ã«ã¤ã„ã¦ å¤šå¤‰æ•°ã®æœ€é©åŒ–å•é¡Œã«ãŠã„ã¦ã€å•é¡ŒãŒã‚ˆã‚Šå°ã•ãªéƒ¨åˆ†å•é¡Œã«åˆ†å‰²ã§ãã€éƒ¨åˆ†å•é¡Œã®æœ€é©è§£ãŒå…¨ä½“ã®æœ€é©è§£ã« å«ã¾ã‚Œã¦ã„ã‚‹ã¨ã„ã†é–¢ä¿‚ãŒå†å¸°çš„
ãƒ¡ãƒ¢åŒ–ã‚’ç”¨ã„ãŸãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã®å®Ÿè£…ã«ã¤ã„ã¦ å¤šå¤‰æ•°ã®æœ€é©åŒ–å•é¡Œã«ãŠã„ã¦ã€å•é¡ŒãŒã‚ˆã‚Šå°ã•ãªéƒ¨åˆ†å•é¡Œã«åˆ†å‰²ã§ãã€éƒ¨åˆ†å•é¡Œã®æœ€é©è§£ãŒå…¨ä½“ã®æœ€é©è§£ã« å«ã¾ã‚Œã¦ã„ã‚‹ã¨ã„ã†é–¢ä¿‚ãŒå†å¸°çš„ã«æˆã‚Šç«‹ã£ã¦ã„ã‚‹ãªã‚‰ã°ã€å°ã•ãªéƒ¨åˆ†å•é¡Œã‹ã‚‰é€æ¬¡çš„ã«è§£ã„ã¦ã„ãã“ã¨ã«ã‚ˆã£ ã¦åŠ¹çŽ‡è‰¯ãå…¨ä½“ã®æœ€é©è§£ã‚’æ±‚ã‚ã‚‹å‹•çš„è¨ˆç”»æ³•ã¨å‘¼ã°ã‚Œã‚‹æ‰‹æ³•ãŒåˆ©ç”¨ã§ãã‚‹ã€‚å‹•çš„è¨ˆç”»æ³•ã‚’ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ä¸Šã§å®Ÿ è£…ã™ã‚‹éš›ã«ã€å¤šãã®å ´åˆã¯å†å¸°çš„é–¢æ•°ã¨ãƒ¡ãƒ¢åŒ–ã‚’ç”¨ã„ã¦ç›´æ„Ÿçš„ãªãƒ—ãƒã‚°ãƒ©ãƒ ã¨ã—ã¦å®¹æ˜“ã«å®Ÿè£…ã§ãã‚‹ã€‚ ãŸã ã—ã€å‹•çš„è¨ˆç”»æ³•ã®ä¸ã§ã‚‚ã€ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã®ã‚ˆã†ã«ã€ä¸€åº¦æ±‚ã‚ãŸå¤‰æ•°ã®å€¤ã‚’é€æ¬¡çš„ã«æ”¹è‰¯ã—ã¦ã„ãã‚ˆã† ãªæ‰‹æ³•ã¯ä¸€èˆ¬ã«ç ´å£Šçš„ä»£å…¥ã‚’ç”¨ã„ã¦è¨˜è¿°ã•ã‚Œã¦ãŠã‚Šã€å‰¯ä½œç”¨ã‚’å–ã‚Šæ‰±ãˆãªã„ãƒ¡ãƒ¢åŒ–ã¨ã„ã†æ‰‹æ®µã§å®Ÿè£…ã§ãã‚‹ã‹ ã©ã†ã‹ä¸€è¦‹ã™ã‚‹ã¨æ˜Žã‚‰ã‹ã§ãªã„ã€‚ ã—ã‹ã—ã€å°‘ã—è€ƒãˆã‚Œã°ã€ã‚ã‚‹å¤‰æ•°ã®å€¤ãŒæ”¹è‰¯ã«ã‚ˆã£ã¦æœ€é©å€¤ã«è¿‘ã¥ãã¨ãã«ã€ãã‚Œã‚‰ã®å€¤ã®åˆ—å…¨ä½“ã‹ã‚‰ä½•ã‚‰ ã‹ã®è©•ä¾¡é–¢æ•°ã§é¸æŠžã—ãŸã‚‚ã®ãŒæ±‚ã‚
eagletmt 2010/03/28
ãƒ¡ãƒ¢åŒ–+æœ«å°¾å†å¸°ã§å‰¯ä½œç”¨ç„¡ã—ã® Dijkstra

algorithm

purely functional
ãƒªãƒ³ã‚¯
Spaghetti Source - å„ç¨®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã® C++ ã«ã‚ˆã‚‹å®Ÿè£…
ACM/ICPCï¼ˆãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆï¼‰ç³»åˆ—ã®å•é¡Œã‚’è§£ãã“ã¨ã‚’ç›®æ¨™ã«ã—ã¦ï¼Œå„ç¨®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ C++ ã§å®Ÿè£…ã—ã¦ã¿ãŸï¼Žæ¥µã‚ã¦æ„åœ°ãŒæ‚ªã„é¡žã®å•é¡Œã«ã¯å¯¾å¿œã—ã¦ã„ãªã„ã—ï¼Œç‰¹å®šã®å…¥åŠ›ã«å¯¾ã—ã¦é«˜é€Ÿã«å‹•ãã¨ã„ã†ã“ã¨ã‚‚ãªã„ï¼Žè¨ˆç®—é‡ã‚‚æœ€è‰¯ã¨ã¯é™ã‚‰ãªã„ï¼Ž ã“ã‚Œã‚‰ã‚’å‚è€ƒã«ã™ã‚‹æ–¹ã¸ã®æ³¨æ„ã¨ãŠé¡˜ã„ï¼š ã“ã‚Œã‚‰ã®è¨˜è¿°ã¯æ£ç¢ºã¨ã¯é™ã‚Šã¾ã›ã‚“ï¼Žå‚è€ƒæ–‡çŒ®ã‚’å‚ç…§ã™ã‚‹ã“ã¨ã‚’å¼·ãæŽ¨å¥¨ã—ã¾ã™ï¼Žé–“é•ã£ã¦ã„ã‚‹å ´åˆã¯æ˜¯éžæ•™ãˆã¦ãã ã•ã„ï¼Ž ã“ã‚Œã‚‰ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã¯é–“é•ã£ã¦ã„ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ï¼Žå„äººã§æ¤œè¨¼ã™ã‚‹ã“ã¨ã‚’å¼·ãæŽ¨å¥¨ã—ã¾ã™ï¼Žãƒã‚°ãŒã‚ã‚Œã°æ˜¯éžæ•™ãˆã¦ãã ã•ã„ï¼Ž åˆ†é¡žãŒæ€ªã—ã„ã®ã§ï¼Œã“ã‚Œã¯ã“ã£ã¡ã ã‚ã†ï¼Œã¨ã„ã†ã“ã¨ãŒã‚ã‚Œã°ã‚³ãƒ¡ãƒ³ãƒˆã‚’ä¸‹ã•ã‚‹ã¨åŠ©ã‹ã‚Šã¾ã™ï¼Ž æ³¨æ„ï¼ ç¾åœ¨æ›¸ãæ›ãˆä¸ TODO åˆ†é¡žã‚’æ£ã—ãè¡Œã†ï¼Ž å…¨ä½“çš„ã«èª¬æ˜Žã¨ä½¿ã„æ–¹ã‚’è©³ã—ãï¼Ž Verify ã—ã¦ã„ãªã„ã‚‚ã®ã‚’ Verifyï¼Ž ãƒœãƒãƒŽã‚¤å›³ï¼ˆã„ã¤ã«ãªã‚‹ã“ã¨ã‚„ã‚‰â€¦â€¦ï¼‰ åŸºæœ¬ ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆ ã‚°ãƒ©ãƒ•
eagletmt 2010/03/27
webarchive

algorithm
ãƒªãƒ³ã‚¯
æœ€å°è²»ç”¨æµ @ C++ - è½æ›¸ãã€æ™‚ã€…è½å¦
æœ€å°è²»ç”¨æµå®Ÿè£…ã—ãŸï¼Ž æœ€å°è²»ç”¨æµã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯å°‘ãªãã¨ã‚‚3ç¨®é¡žãã‚‰ã„ã‚ã‚‹ï¼Ž ã¨ã‚Šã‚ãˆãšï¼Œãƒ•ãƒãƒ¼ã‚’æ±‚ã‚ã¦ã‹ã‚‰ï¼Œè² é–‰è·¯ã‚’é ‘å¼µã£ã¦æ¶ˆã—ã¦ã„ã æœ€å°è²»ç”¨0ãƒ•ãƒãƒ¼ã‹ã‚‰ã¯ã˜ã‚ã¦ï¼Œaugmenting shortest path ã§å¢—ã‚„ã—ã¦ã„ã push, relabelã®ä¸€èˆ¬åŒ–ï¼ˆã‚ˆãçŸ¥ã‚‰ãªã„ï¼‰ 2ç•ªç›®ã‚’å®Ÿè£…ã—ãŸï¼Ž ç°¡å˜ã®ãŸã‚ï¼Œéžè² è²»ç”¨ï¼Ž æ¤œè¨¼ã¯ UVa 10594 Data Flow. é©å½“ã«çµ„ã‚“ã ã‚‰æ™‚é–“ã‚ªãƒ¼ãƒãƒ¼ã ã£ãŸã®ã§ï¼Œé…åˆ—ã¨ã‹ä½¿ã£ã¦çœŸé¢ç›®ã«æ›¸ã„ãŸï¼Ž æœ¬ä½“ã¯ä»¥ä¸‹ï¼Žéžè² è²»ç”¨ã¨ã„ã†ã®ãŒå¤§ãã„ï¼Žã¾ãšï¼Œf=0ãŒæœ€å°è²»ç”¨0ãƒ•ãƒãƒ¼ã«ãªã£ã¦ã„ã‚‹ï¼Ž ã‚ˆã£ã¦ï¼Œãƒãƒ†ãƒ³ã‚·ãƒ£ãƒ«ã®æ±ºå®šã«ãƒ™ãƒ«ãƒžãƒ³ãƒ•ã‚©ãƒ¼ãƒ‰ã‚’å®Ÿè¡Œã—ãªãã¦è‰¯ã„ï¼Ž ãŸã ï¼Œå˜ç´”ã«ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©ã§ã‚¬ãƒ³ã‚¬ãƒ³æµã—ã¦ã„ã‘ã°è‰¯ã„ï¼Ž pair<bool, ll> successive_shortest_path() { typedef pair<ll, int> TV; FOR
eagletmt 2010/02/25
algorithm
ãƒªãƒ³ã‚¯
å®Ÿæ•°æŽ¢ç´¢ä¸‰ç¨®é¡žè§£èª¬ - nodchipã®æ—¥è¨˜
è‡ªåˆ†ãŒã‚ˆãä½¿ã†å®Ÿæ•°ä¸Šã®æŽ¢ç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€Œä¸‰åˆ†æŽ¢ç´¢ã€ã€Œé»„é‡‘åˆ†å‰²æŽ¢ç´¢ã€ã€ŒäºŒåˆ†æŽ¢ç´¢ã€ã®ãƒ¡ãƒ¢ã§ã™ã€‚ ä¸‰åˆ†æŽ¢ç´¢ ä¸‰åˆ†æŽ¢ç´¢ã¯å‡¸é–¢æ•°ã®æ¥µå€¤ã‚’æ±‚ã‚ã‚‹ãŸã‚ã«ä½¿ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯é–¢æ•°ãŒå¾®åˆ†ä¸å¯èƒ½ãªå ´åˆã«ã‚‚ä½¿ãˆã¾ã™ã€‚ã‚„ã‚Šæ–¹ã¯æŽ¢ç´¢é ˜åŸŸã‚’ä¸‰åˆ†å‰²ã—ã€çœŸã‚“ä¸äºŒæœ¬ã®å¢ƒç•Œã®ã†ã¡ã©ã¡ã‚‰ã®å€¤ãŒå¤§ãã„ã‹ã‚’èª¿ã¹ã€ãã‚Œã¨ã¯é€†ã®æ–¹ã®å¢ƒç•Œã‚’æ–°ãŸãªæŽ¢ç´¢é ˜åŸŸã®ç«¯ã«ã™ã‚‹ã¨ã„ã†ã‚‚ã®ã§ã™ã€‚ä¸€å›žã®ã‚¤ãƒ†ãƒ¬ãƒ¼ã‚·ãƒ§ãƒ³ã§é–¢æ•°ã®è¨ˆç®—ã‚’2å›žè¡Œã„ã€æŽ¢ç´¢é ˜åŸŸãŒ2/3ã«ãªã‚Šã¾ã™ã€‚ double search(double left, double right) { for (int loop = 0; loop < maxLoop; ++loop){ if (f((left * 2 + right) / 3) > f((left + right * 2) / 3)){ right = (left + right * 2) / 3; } else
eagletmt 2010/02/20
algorithm

search
ãƒªãƒ³ã‚¯
eomole blog Â» ç‚¹ã‚’å††ã§å›²ã‚€æ–¹æ³•ã®ã‚ã‚Œã“ã‚Œ
eagletmt 2010/02/20
algorithm

geometry
ãƒªãƒ³ã‚¯
How to Write a Spelling Corrector
One week in 2007, two friends (Dean and Bill) independently told me they were amazed at Google's spelling correction. Type in a search like [speling] and Google instantly comes back with Showing results for: spelling. I thought Dean and Bill, being highly accomplished engineers and mathematicians, would have good intuitions about how this process works. But they didn't, and come to think of it, wh
eagletmt 2010/02/11
algorithm

spellcorrection
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸