Alex

The Sports Association of Bangladesh is in great problem with their latest lottery ‘Jodi laiga Jai’. There are so many participants this time that they cannot manage all the numbers. In an urgent meet

We say a sequence of characters is a palindrome if it is the same written forwards and backwards. For exam- ple, ‘ racecar ’ is a palindrome, but ‘ fastcar ’ is not. A partition of a sequenc

任意两个切割点之间无法再分割 所以如果设dp[i][j] 表示从i位置切到j位置其实没有多大意义,亲测这样会TLE dp[i][j]表示切割第i个切割点开始的位置到第j个切割点的位置结束的木棍的最小花费 时间复杂度O(n3)O(n^3)/************************************************************************* >

Description Download as PDFA couple of years ago, a new world wide crisis started, leaving many people with economical problems. Some workers of a particular company are trying to ask for an increase

dp[i][j]dp[i][j]表示时刻i,在车站j,等待的最少时间 有3中方案: 等一分钟 往左搭车 往右搭车/************************************************************************* > File Name: uva1025.cpp > Author: ALex > Mail: zchao1

dp[i][j]dp[i][j]表示在1~max(i,j)都已经被走过的情况下,第一个人在i点,第二个人在j点时,走完剩下的点还需要的最短距离 规定第一个人领先第二个人 所以dp[i][j]dp[i][j]可以转移到dp[i+1][j]dp[i + 1][j]和dp[i+1][i]dp[i + 1][i](等价于dp[i][i+1]dp[i][i + 1])/******************