SAMIR PAUL)

Dynamit hosawmnung

(DEndmed Reusion Tdenbi/y DPDChoicu Option laing

Rewgim
Pasunt ot DP i> Reunsior
askiny opkimal
manimwn/mayuin an talliny
Code D tn uut Rhmefi's
Recwnsin oudtom DP combe
DP ReewAion -Sbrese
Tabulan/ Matax
Memoizatton 3ottom-Up DP
Vaauiotiom o DP
0-1 Krap5ackusdtionj.
(c uestim) 2Subset
Egual Sum
Sum lnbtam

)tln hounoskd krap ack (5) Cownt of Subset

3) Fibonoei () 0-1 knap Sack habbm
4) Les (19 Minon chongs
sLIS () Subset Son
Pantrdbn
4 Kadane's Algouthm) ) Egual Sum

DP on hees (1) Cound t subsut Sa BF

1 Minimum Subset Sum Oiff
DP on hnid (a)
9Mati chain Mulkhplicat1orn
( 9)Tangt Sum
6 Numben Subsst Sum
0hens (
uith gican Daft
Knop Sack hablem
Wayt C1 3 4 5k
Value1 # 14 5 7»
Fracdional
1 knapsach nbounded W 10 K
knapsack knapsock
DP DP Copaty
maxPofit
2
pnoac

Top-Down DP ymdily Chae tnelneor

Memai ztion 9ptimal Tnelh
Tabular
Mahix DP ? Eotom UpP ma Paofit
 o/1 hap Sack Rewnaiom
maypnofi'E
outpat >
Tapak Wuighe:L1, 4,
3, , 5, 51
Vaues Ci, 47 F
tem 2
Copo W)
Recunsine Code
hp Choiee Picglam
ink ot Jhe W= Wme w,Wyhe
dek hpsnch Baes
Baeoa Smallest i
on not
B e condidion
valib imedde K ineluee X
ehoiee Dia4Am
Recunsi Code
n n(wait)
valuas, wne n)
de Knepsack (wkt, nutunn 0
'nutunn
o r Wne0 Value i inelude.
i (n=0
Wuisht[n-1 <=
Wme
volaus, Wme-Wgk (n-il
+ knapsack (nuigkt,
valuesCn-i)
sutunn max( ,n-1)
valu, Wme
knapsack (wigkt,
Value nat hehude
wugad(n-1] >Wme veluwn , Wme n-
knapsack j t ,
,

nkum
VL Manordsation

n
n, w

conan A
W1000
ekmend -1)
makematie (ench
dPTio2] ClooR1
D do the
Val, Wme ,n hese
def knapsock(wt,0 0 o n A r d du e o
Wme = =
0 i utunn )onkyda Ze
rtunn op[n]ng
at
op[n]Cn MINO

n
s P n ] [ ! = - 1 :
dunn e
no

i hnepsack(wt,val,
WnWt[n-]1-)
i W t [ n - = W m e

+
mar(valn-) Wne, n-))
huan
(dln1[wn.]=
Knepack ( t ,vals
i w t l n - )Wne
Tetuan. dr [nWne = nopsack (Wt, val Wne , n-1)
 Basecondition of feunane Sokbar)>|Inibaliotion Top-Dourn
yproach (Bt1o, 1olumn)_
Raeusine Cok Top-down Coda

W=# 0: notwm 0 o n rorge (nm):

ne 0 0
on 3 m me (wa49
dP[)[i -0

i w t n-11 <=W
witn-9 <=W:
utunn max(valn-]+kn«psack(wt,val,|
-wtn-1,, dP[iw =
mox( wl- ) +dP[n-1]
n-
Knapsck(w*, vel ,W, n-1 W-Wtn-
+P[n-Cw]
ali wtEn-i) >w:
u tusn knapsaek (wh, vnd,W, n- dP [nw1 = dp[h-i]1(w

r 3 n ong (w)
=0
d=o n jee0 : dPti)C

tn i n rerge(n 1, n+1)
Fn3 M rge (1, W*l)
de 1 = max(valCt-1] + de[i-1[3 -wtC-1],4f[K
se
deTC P[i-)[31

utum df[n][w]
Sutset Sum hable; eheck 4ue co pind h toygtJarn fnon he
Subat op dhe anna
a 3 7,8, /3)
togtsam -1l
-tangut sum
2
3 4 9 6 7 8 9 10 aUl = [ ) 6
Sans buue oTF|F
FFFEEFFEE

Flsa
ans [
San
Tue
siz

ann-C34,1,
toykan
Toun(EnpyShb omay)
 Symmileiso Subsed sum uuidh o% Knopsack
Subset Sum
o/1 knapsac k
wt[]avnc] w Tge
wAr
Yalt)>Inone
val 1 <= J:
annfi-)

i de[47[ = d-[-axus[7-7

dP[Ci7 max(val ri-11+

dp[i-3-tf-1
eCi-)il) = dr[i-1)[i]
elsa: dP[ri]
de: dP[il[i)
=
se[i-17[il
sum(anm) 7, 2 != 0 utuan
netuan
- li,3, 3, 3, 5,7| fabe
EualSumPendition ua
ast =sum(aan)I72
sum o n darget
Pply SubSit
Sm
Sukstt s um
r ageven Stum :
Empty
Cound
T D O O o g O o d a

ansr
Sum 0 SizeL
I sun
An [, 3,5, 4, 8, 10] o posstBL
,3,53, {2,8), {ro
ns 3
ot aubsctsum
>+ Jubsut
ast chomge ha on on soum =0 any
PasiKAe.
i ani-) <=j: se. empty subset is
dett) zdeli-1[3-anr[i-)| dp[i-17C11
+

neluide obnot incluidk

else: dPtit3) = dp[i-1(i]
Find mun (Sa-S)
MunuM Sub set Sarmbilfewrmce ann=3
siu suksaty. Smalltn
2 3 4 5 10 S tSg totalsum
S) subset
todolCom Sg tohlsum-S,
TTF FFFT7 T
T
possi
intokalsum-2 S
in Sulosatsum prob6lemm
2 34 5 7 8 9 10
TEPEAFPAF
Site
of

mn 3 hon Juht onu thu

&Com be 7 Con be posihla ike
3uhsut sums me p05Aibi
Swhsutsam& on3 a Suhst sam
am
 an lyR7
possilse auh st S n fpa
=

subsadsnms [o, ,2, 7, 8, 9,10 S{

=

n=len(subsuksm
mn minsubsutsumdiy= Hoat("i")
bn S1 im gubstksum
mh men (mn, blaksum - R.$1)
Jutunn mn)

Count tha numbern o Subsets uuldh agwn ditfanone ee

S-Sa dh -0 0+ blsunt
1 S,=
ar
-
[,,3,3] dik= = totalsum -
S +S2 odalsum +dVt
sum is dotolsum+okl
S, howe do find now coundo subsuts uwhoa 2
egunt ot sulsst sum 1
ssnt an bohore
lanst Sum a [1, 1,2,3] toget= (ann) ongut
subst ==
sueh h r t
hat sum
elcmen ot a n t such into tuug subst
a
EFR n i g y
kasionlly a yauin
| trgt
.

aguals
tfsunce b/ suks1dsums Pan
SuLe

posstha
S,,> a
S
.S-52tag numbn
namben
f- PO1sAka

+m(ann) Find
rand

= mt
S1 (nna)
t sum
ongt
S S
nbounded kropsock multplo oucunmce t on element
> -
pnocess MOna
2
M a x eepaeisy
3 5C

chaise not hfan Sia

onei his
st is dome po6euauT
then cal hon en
emaT(n-
O- I KnayoS ack Uhboundud knopsack
w t t i - 1 <=i:

pT1[i] max(vad[i-=
dp[s][ P[ ][ij =
movad i-3 JP[i1Ci-wt[s-il
J-wki-1]|
dPC-11i1)
#[i-11(4]) Takon eal H
s&me ton tuthan proey
lse )
else
umainer
eall ton
not kken so
 nbounged knepsak 0 Rod Cuttng C o i n ChongeT,
el
Coinchom T O Maximum ubon

wifë-1, + de[i-] (i7)

wei-<=i: op[£)[i-
Ci-op[
dpT&13)=
max(vad prociss t h esame.

else
copaody

(n-)
P Plac
lacina
i 3
Site ot arm

buu fan emyty

uruey nat
on tokj3,
oy alement Rrorit=0
pnies - ,5,8, 9, 1o, 17,
bo 1 };nl o n g t k n o Pnofit

Ro Cuttary h=8
oO00010

no

lngth= Li+) jan isnronge puuee)-

Waikt lcrgth[i-11<T de[i-17(j?)
de[i1[3-lnghta-0],
man(pien[i)+
dPT103]=
sinukich
lse de[1C31 = e [ i - 3 ) >posiible length Mue cen CUE
r a y hun, he r 0 ,
omay
knopack i's Jeryth
nbounded
uesghtot
ampeund> Unbowndaol knona
caans
any wmbe ot
Coinchong e: =0 SA no coin can be taken ®mbunasen
Maxum
O 00To 16 SI~e =o
Site 1 dodad no.of¬ombinaliom
Comburedsom
CDAny to Postble
tget 0
d l a t o t a l combtinaha
maka, an ho
eo-ins ne eood
tnget 1 mpdy
fom&e
dP[i][i-con[-7+ dp-I
r coin i-) <= j; dp[t1[s1 =
w
mutigle2 eombe oken
timeéneconl pruseni an dhy
eoblom
ese: dp[r]G1=+r[i-Jti1 No val nay y
SO not toking Val
 CoinChane >M}numum number o coi3 nequinus to moko the amot
toin- C1, 2,5)
amgunt = 11
Un bsundad Knapsackk com be tlen
) omy n0.casns
AmOunt fo make ament
3 avay Ati =0
t o n
nequinde
00 umbew ocoim

S
Tiltol =0,0Ki« n
dod s0 dp[i
no couMS
ame nee
amouni
=0
make
to
1rau ako
In this quion u hav do midialis ehnnk

+1): is multiph ot
kar jinaange (1, omount th
omound(i) oCouinfo7

coinro] ==0:
nieshd to make T
J%
no.ot Cauns
dP[11)= I / tainfo7
#king
*=1
jar
on i n harge (2, n): nsfead ot
Vall4-)
ewrwnf cauN

mounty
rat gin kange (1,
iConsi-] <= J de[i)Ti-cainufi-l],
dpri-7[i
derert)
= mint
else: p[ITG]
= dP[i-1][i?

Longst Common Suubsequence m-bn (

n bnCY)

x: e sh abdh
Y : 6 er 8 r

Recwrsive
hose grom
not mateh
mateh

1 Les( m- n /M

m
C- L n_
 d tsX, Y, m, n): B a s e Conkton
==0 : e twvm 0
i m-=0

xm-1)
==
Y[n-1]: neuwn 1+Le.S (X Y, m-i, n-i)
nom if
Cho'se
(LES(x, Y,m, n-), LCS (X, Y,m-1,h
dipam else: raturen Max

Top down dP.

0P
Iitalijot1 on of Top-brwm
B a Coa otr ne ewnaLOn - Y h

m =0 on n= a0: 1o ngh ot-ubujance

ubuwn 0
mx
n 0

=-Y[n-7
x[m-) -Y[n-): i rx [m-]
oP[m-1[n-11
ratum 1+ Les(x,Y, m-1, n-1)|- dP[m][n] = 1+
else else / dpTm1Cn-17,
Jutun moax(esY,m, n-1), oP Em-(n])
LCs
(XY,-1, 1))
Chorye m -> n>I

ron jin mse (1, n +1)

1 + Pti-1 Ci-1
- i ==Y[3-17: dPC1(47
=

tse: p1(] =
may (JP[*](3-17, e[i-0Ci1)
ctan dem)(n]
y
onaa Common Subatiug
nk thung.
xab Cont nuo
comon

Y= (a bjt =bnla - m

Zeo yh
o n Yo
Digordinas pat 0 10 ongn subatruj
ix[i-1 =YG-1: rey =
max ,oPLil3)
P[Ci= 1 t dr[i-1ti-11 ;
 Lengrh o Shortmat Commom Supaa Se quonce
X A&&TAS m elemunate Common Subsaquuea
ongh(Le s) = 4
(n) LCS = TAB
Y: &XTXA YB (x+Y -LCS)
AGCTA6+GXTXA Y8 -

GTAB
m + - den(ies)

+T-4 9
to cwn Kent sting Xzodhuy Y
Insertion onod dehton
Munimum nuUmberrof add: 1
X: heap ) P ea dulste: 2
scamoad
(n) LeS = ea ullba
Y: Peo inaet and eraiug
honeetans
Les
emam
X, LS l
sos"eon be faund uslng
In DP
subsiguaney s0 optimal
)Les iy Commom p e a

heae heop
Y LCS pea S1odd
Dhlebion ea
du l Ta
LeS
(via) knlL.ei)
len (Y
-

insution
=

len(LC
en(Lc.s) s)
Len (x)
--

Tumbero
len
u m berotle
trom =

inpnt X= a bc b a
> omby stn
LOngest Palingonie Subseguanee
Symdanuth'y betmen A s md Les 2 «ubsiguence (LCs))
How o Fnd lgt
commom

Subse suanca (L D3)

Lmgoat Palindaomie
Tngut: 1 StNng PAabsm: Longat (optimal)
Aaslem: Logexf (opbmal)
Budpud umaa (md)
d pe: lomgh ( int) hiddon!
ashn sbunamay be eNa{X)=asebga

the
agbcb
. y
X= aC6g>Les=
a
=
>LeS=
b
abeha'

X bCb
o n y a tpalindhom

Y=

LPS) = LCS(x, uyar)

.

VUNnTIT on OGEuIOUY a YYY

 /UnsArtib

Minnuam at peletior
no. in a staing mke itapakndrome:

inpu= "agbe ba ot paánohom

longth
maxuntum
lan (LPs)
dabtiom from Anput =
lan(irprd)-
dalebon
Miniw no. mo.f
= "abe bo lnagbeb)-
man len palndrom 1
L PS . lern(abcba")
no.f dele tion
ngth ot
6 5 1
dletion kninput)- LPS
Miniwn no. =

m)
lypense ulnee inpue:X=acbe
Y=ab c dar, (n) A
irint Shar tut Com»mn
mhch bath x ond y me Rsant lsmen
SuNSnca a astaumg n
thet oecuns nt Jome h'mu
ult ple valuy
beday
X a
ac bc
b c d a f 2 p u p u e n c e
= ac

Se S
Y=
mnating 1
Les ue t
Rfimas ,so ele
X+Y,
4NAt LeS
In
tes temiuo
.

Lsa pant d
O

2 2 2
= a ber
LCS
b 3 Les
=

23 3 S 9
LeS
Ma dRensegutsnce
im;j=n (nding
This poth
whill i> 0 pnd j>0 X ond Y
wich contains bdh
iyx[i- = Y[j-9:
uy+= XCl-1) #or Y[i-) uhilh i>0:
-=1 J-#1
else eti1ti-) >op [i-lli7: -= 1

Ju t= Y[i-0 rup + = Y (T-1)

j-1
i-1
else: us+ = X[i-11
retwrn [!:-1{
i -= 1

Í:0 t Ken
ony o izz0
adko
Lhae 10 ad semeing
h a e fo a Xond Yelsment
 input S = "AA 13E BCDP
Loneat Rapering Jsbsegumce

S A8D

tondtion
i !=J
uih 1 axha
LcS
X = AABE BCDD use
P
Y AABE BCD J 7
Xe 3

X
«nd i !=J:
i x[i-== Y(i-}
dP[ll5=1 + dp[i-9[i-1
dp

E els
PTi][i] =
max(so[Ti-1,
el:-}[71)

Ten de-il- arhen an mat

ofhn or
staung is aubsiguunce ot Hus
eck in a aun a one

dn min bn(A), lon(6). aiem inpal B/aing|

A1RAl daus
s t n 1qua
o u s
it o
t of gonn
A and 6
k bnl)< bn(i)
Ataunai
Annad

Juun rasu Te nb se(uLnece

RAablo
i bn():
:+:1
A 1 = 6[i1
i
e l &POp(i
8[: bn(a)}
Jatnam AT:1
Matrex Cham Muttijzhleatio a n t 7 =40, 20, 30, 10, 3 07
thue uill be n-1 matix
Fn Aayot bngh n,
o-0Mla

n n0.
Coot
= * 3 X6

m u u l i p l i i h o n .

metux
samu/m
10XIO
10X30
m u r tbe ,
x10,
0xI0
d i m u n t o n y

40xR0,
4 0x0, R0
20 x30, 30
X30, 3 D
dimanthbn
V T 1
moluesy A B

Moat coat ektuetuni nny (A (8*))D

 nCBe))*D
10)10x30
10x20 20130 30 x
20 30 10
10)10x30
+ 40xR020 x
x30
40 20 10 o)10
(10x
40 10*30/ 10 x3 0

K
a6000 at ABTCD
SoLe(amsk+l, J)
Recunsi Ftnd i, J
(arvr, i i);
dey salwe
i i > =J;
utuwn 0
in srge(i, i):
rt K
temp Salye (ar, i,k)+
Sole (au,
K+l, T) +
avr[k?
*
arvYI7
at[i-i] *

ans = mn(oms, tmp

rutwn anb
O n c e _uwe e a l e n d a t s

Mengizstion -1- -
thus fumetim

S o m e

el100] [io0 01 Call

u n c á o n

AnS Int Miax 6o stpung

sdu onr, i, i): n c t i v r n

i>=j: neturm 0 Stoncd valtu

utwnewAe
-1 ;
!=
dPCi7T]

rutwm drG1[i]
ae

K+!, J)
+
on K in aonge (i, 1): slve (anm,
Salye (am, i, K) +
temp =

ns muntnp, cuns)
dpTi7[i] =ams
return d[:][s]|
 R

N
BooLean Tavtnthei zation odal n0 w a ) 20 make S = Tue

orr, A>xOR
inpt S= TAFF
ovtpnd (T)1F) (T(C1P)

S TIF TF
K
i(G1rR) (F)X
K Cam
tome
An

So
OpenaTang
0 J= lon(s)-1 K k+ the index o
only
i , j at mduees
F Tomd F
m d

xOR
i t K-1)
TT>F

FAP F
TAF T
FAT T
 rativn Taue or false
Scxamblad String: s, greet,S="nyaat"
S cn bi scambls
Sa
eat 5
reat
o 2 3
èat
e a 4
z
at
at

satuea, b)
alao a k e
8tna- arleulotag values
Con
MemgiEation: do
hoakmep modux to skne2
mp= 3 op
hen
slve (ak): snbstung
frlse I f n a t egual
ben(8): ne=buwn naT be
sergmglig
r kent) ecm

a = b : rutiun Thu ehauehior md nol

en =t ngle
K=1 : ulum abe egal o empIy
i Lonlc)
vales. m mep.
a+ ""+b # m shu
Key =

# pe ebsly
enbenlaten tor So
n
p:relum mpkey7 &o doht
Key hat in storag r mp
g Frbe need to caleulnte ogaun
n = em (
tor m onge (1, n): (o[i:7, b [':7)
naM=spdne(at:i1, 6/::7) ond splne
Swep Sle (a[:il, bn-i:))
= ard sckua (ali:7,bE:n-i7)

A nosuP o Suep: # ary one lnu

gdeg Taue
break
mp[kes) Klog
rtotwun mP[key]

return solne (1,a)

 e -)
noot

Soke(e, )
noRpene
Sabvee, -k) bnesk ban
3oluele-1,K-)
atk hun
uill ot
hon hnak ppan btnny
brcak at k it ot 'ttinpt m ot K
i Lowmenloong.
so

chack fam k-t

rlonny s o hun nea 0ilinps
is )
Ese Cope. (i) 1f no.of tlart alnph.
so
all floors
ehoack (on
dp=-) * (tool) an in hange(ie0u)
ot Sobvee, ): r
m fa=1:sutwm
-=o
enleulatd
e ==1:r e l u n F Rren awmly
# at AE,)
rutum ople7(t) v (e, v)
Sale
i derel) = 1 :
2veny
maxiI
1 to loor, dtop
Sy3.
ry prom essn ( max)jor6 F
ans =
#
f+):
roa k in sango(1, ond fund uuort
Kloor all 1
Find m n of
temp = 1+max( that kloo;
solae-, K-),- kloons e-1
uehre
Solve(e,-K) bnak,nauw
63 ond K-1to,
umarnuny 413
nl ay)
ans = mi'n (ans, tmp becune above k floo
uiu bnk. Aue
hoW
dp[elr= Ans # stoning an
4g nat
bra,
e end R A 0 0
uman 43
(ineludal)
retm Soku (e6) brcass afore k
4 g uill samaln
all
- Oxk6)
Time Connpérity
Comalexiy
= O(kxn)
sfece
 DP on bree, Gengnal Shuetue o Coge
us):
da Solw node
netun
B Case- n o d e =a None:

Salv (nodk 4t , mo)

(node nght, to)
Hypothe sis
Sol
I+max(I+T)
tmp eakwete tmp ems
Indsebion . ans =
mox(tenp, elotaom 1+147t
n
max te , m
Aman
have s rdonsomita
railm ry
u liwn tp b e s u hen

Diameto &inany ue:

Se tup=0

BL ot root;utun 0
H
3alve(ruoot bf)
9olenoot ngnk)
tanp 1 +meux(L,r end bft,
ewront roat
uding Ha
ans= max(temp, 1+l+)
loh the orgssbpecth..
o
selk ans max(slf-ans,ans
=

ssterhfmthan
eturn tempit kongak path

Sleno
utwm Sal{. e5.7
Pathsum:
Bina boe max

Slf. ruy rat.val

shaightt l
=

de Salne (noat): mayinge cuwenkkA m

Cotanuy
rutum 0
8 i n a t root; max SUUm
-sola (roat uf4) m or
Sub u e a t
onky noas
htt
H p l
(root. niy
max(1,),
natval)
aukhe
tomp o r átal
m a x ( r a t - v a l t

+l+n) eihen

tmp= val
(temp,xoot,
= max
(Sulp res, ans)
ans

may
Self. res
=

rutin tinp Sal (noak

netiun l f , r e )

*** euurra Tuuy

coTucreum T799-Z0UU ana published in Joutnal of Nutrition:22(2006)S1-S88 FRmRaring micranutrient
 Maximum t h um o Binay true Knom leaf node to lcap node
nont. vol
Bul. Suy =

ok sialwe (srod): o)
sutun
8 i mtrat: 25
Salye (1oot. lej4)
sple (vnt.tight Swm 23
not.val

max(l,
r)+
tmp= +
N9ot-yol
tenp, t
ons =m a x (
ey =
Max (ons, silf. us)
el.
yutun domp
o(noot)
sutuwm sel.nes

SAMIR PAUL