Giter Club home page Giter Club logo

Comments (1)

GoogleCodeExporter avatar GoogleCodeExporter commented on June 3, 2024 
首先通过引入附加符号，把所有规则都改成A->BC这样的形式，
设f(i,L)表示初始为一个i, 通过规则得到一个长度为L的串, 
这个串字典序最小为多少, f(j,p)+f(k,L-p)转移到f(i,L), 
对应于规则i->jk, 
0<=p<=L。注意到p可以等于L，实际计算的时候得用类似dijkstra的
写法做状态转移

Original comment by [email protected] on 19 May 2013 at 2:08

  • Changed state: Accepted

from aoapc-book.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.