Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

download Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

of 18

Transcript of Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    1/18

    V]KHW EOFE\EF]

    HAKCREVNH FHO WVR]JV]R FHVH

    RMW]NM NMVCFM KRMMFU FHO FUOHNEG

    PRCKRHNEOK

    OHNH 9 DHRFEHOVE DHLEF

    OEN9 D828882

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    2/18

    H/ Hakcrevnh Krmmfu

    Hakcrevnh krmmfu nmr}phjho whahd whv} hakcrevnh uhok fhphv

    nmoumamwhejho bmrnhghn.nhghn pmrnhwhahdho vmrnhw}j pmrnhwhahdho

    nmokcpvenhajho $neoen}n hvh} nhjwen}n% dhwea uhok fefhphv/ Hakcrevnh

    krmmfu nmomrhpjho nmvcfm pmoghreho vmrjcovrca fmokho nmahj}jho peaedho uhok

    nmnbmrejho dhwea cpvenha wmnmovhrh/ Nmneaed oeahe cpvenha $nhjwen}n hvh}

    neoen}n% fhre wmj}np}aho peaedho nmr}phjho jcowmp fhwhr fhre hakcrevnh

    krmmfu/

    Pmrwchaho cpvenhwe$cpveneyhveco prcbamnw%9Pmrwchaho nmoghre wca}we cpven}n/

    Dhouh hfh f}h nhghn pmrwchaho cpvenhwe98/ Nhjwenhwe$nhteneyhveco%

    2/ Neoenhwe$neoeneyhveco%

    Gcovcd pmrwchaho cpvenhwe9

    $ Nhwhahd Pmo}jhrho ]hok%9

    Febmrejho }hok wmoeahe H/ V}jhr H fmokho jceo.jceo }hok uhok hfh/ Bmrhph

    i}nahd neoen}n jceo uhok fepmra}jho }ov}j pmo}jhrho vmrwmb}v3

    Pmrwchaho neoenhwe

    Gcovcd 89 vmrwmfeh bhouhj jceo 8! =! 80! 2=

    ]hok wmoeahe H> 72 fhphv fev}jhr fmokho bhouhj ghrh bmrej}v972 > 8 * 8 * * 8 $72 jceo%

    72 > = * = * = * = * 80 * 8 * 8 $; jceo%

    72 > 80 * 80 * 80 * 8 * 8 $= jceo%

    Neoen}n9 72 > 2= * = * 8 * 8 $6 jceo%

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    3/18

    Hakcrevnh krmmfu nmnbmov}j wca}we ahokjhd pmr ahokjhd$wvmp bu wvmp%/ Phfh wmvehp ahokjhd! vmrfhphv bhouhj peaedho uhok pmra} femjwpacrhwe/ Camd jhrmoh ev}! phfh wmvehp ahokjhd dhr}w feb}hv jmp}v}who uhok vmrbhej

    fhahn nmomov}jho peaedho/

    Phfh wmvehp ahokjhd! jevh nmnb}hv peaedho cpven}n acjha $acgha cpven}n%Fmokho dhrhpho bhd{h ahokjhd wewhouh nmokhrhd jm wca}we cpven}n

    kacbha $kacbha cpven}n%/

    Hakcrevnh krmmfu hfhahd hakcrevnh uhok nmnmghdjho nhwhahd ahokjhdpmr ahokjhd! phfh wmvehp ahokjhd9

    8/ nmokhnbea peaedho uhok vmrbhej uhok fhphv fepmrcamd phfh whhv ev} vhoph

    nmnpmrdhvejho jcowmj}mowe jm fmpho $preowepvhjm {dhv uc} gho kmv

    oc{(%

    2/ bmrdhrhp bhd{h fmokho nmneaed cpven}n acjha phfh wmvehp ahokjhd

    hjho bmrhjder fmokho cpven}n kacbha/

    Jmambedho }vhnh fhre hakcrevnh krmmfu hfhahd 9. N}fhd feenpamnmovhwejho! hakcrevnh krmmfu whokhv n}fhd }ov}j

    feenpamnmovhwejho phfh pmrwchaho.pmrwchaho uhok hfh/

    . Mlewemo! hakcrevnh krmmfu nmr}phjho hakcrevnh uhok whokhv mlewemo jhrmoh

    hakcrevnh eoe wmaha} bmr}whdh nmneaed dhwea cpvenha/

    Veoih} nhwhahd pmo}jhrho }hok9Wvrhvmke Krmmfu

    Phfh wmvehp ahokjhd! peaedahd jceo fmokho oeahe vmrbmwhr fhre denp}oho

    jceo uhok vmrwewh/

    Newha9 H > 72! jceo uhok vmrwmfeh9 8! =! 80! fho 2=

    Ahokjhd89 peaed 8 b}hd jceo 2= $Vcvha > 2=%

    Ahokjhd29 peaed 8 b}hd jceo = $Vcvha > 2= * = > 70%

    Ahokjhd79 peaed 2 b}hd jceo 8 $Vcvha > 2=*=*8*8> 72%

    Wca}we9 I}nahd jceo neoen}n > 6 $wca}we cpvenha(%

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    4/18

    Gcovcd9 Fmokho nmokk}ohjho nmvcfm krmmfu! ewe bhok}o bmrej}v fmokho

    nmneaed fhre 6 bhok}o uhok fewmfehjho

    7= gn

    8= gn

    A}hw Bhok}o H> 8= gn t 7= gn > =2= gn2

    6 bhok}o uhok hjho fenhw}jjho uhev}9

    Bhok}o E> A}hw Bhok}o> 82 gn

    Bhok}o EE>

    A}hw Bhok}o>86 gn

    Bhok}o EEE> A}hw Bhok}o>4 gn

    Bhok} E\> A}hw Bhok}o> 8

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    5/18

    Fmokho Nmvcfm Krmmfu 9 Hnbea bhok}o uhok nmneaeje a}hw uhok phaeok bmwhr

    uhev} bhok}o E\ hkhr wca}we nmoihfe cpven}n uhev} nmneaeje wewh phaeok jmgea/

    Z ^ > 72 gn2

    72 gn t 8< gn > =82 gn2

    =2=gn2=82 gn

    2> 87 gn

    2

    Wewh 87 gn

    Z ^ > 8 gn

    Ahokjhd.ahokjhd Krmmfu9

    8/ Nmokkhb}okjho 2 bhok}o EEE fho 2 bhok}o E\ wmdeokkh vhnphj wmpmrve febh{hd eoe

    2/ Nmou}w}o bhok}o vmrwmb}v nmoihfe bmbmrhph bhkeho! wmdeokkh vhnphjwmpmrve fe bh{hd eoe

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    6/18

    7/ Nmohnbhdjho bmbmrhph bhok}o phfh bhkeho uhk jcwcok }ov}jnmneoenhaewhwejho wewh/Wmdeokkh vhnphj wmpmrve fe bh{hd eoe

    6/ Nmnbhvhwe bhkeho uhok jcwcok }ov}j nmokdev}ok wewh wmdeokkh vhnphjwmpmrve khnbhr fe bh{hd eoe/

    =/ Nmokdev}ok wewh bhok}o uhev}H> 8 t 7= > 7=

    B> 8 t 82 > 82

    G> 7 t 2 >

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    7/18

    I}nahd wewh> A}hw H * A}hw B * A}hw G >

    7= * 82 * < > =7 gn

    Ihfe wewh bhok}o hfhahd =7 gn fhre a}hw bhok}o =2= gn fmokho

    nmokkhb}okjho 67 bhok}o

    Nmvcfm Krmmfu eoe fek}ohjho }ov}j nmnpmrcamd wca}we uhok cpvenha fhre

    w}hv} nhwhahd

    uhok nmnp}ouhe 2 eofejhvcr uhev}9 hfhouh l}okwe v}i}ho , pmnbhvhw

    $Gcowvrheo%/

    PRCGMF]RM KRMMFU $H!o%

    Wca}we 0 $wca}we h{ha%

    LCR E 8 VC o FC

    T WMAMGV$H%

    EL LMHWEBAM $Wca}we! t%

    VDMO Wca}we ]OECO $wca}we! t%

    MOFEL

    RMPMHV

    RMV]RO $Wca}we%

    MOF KRMMFU

    Jmvmrhokho 9

    H$89o% nmokhof}ok o eop}v fhvh/

    LMHWEBAM nmr}phjho l}okwe uhok bmroeahe bccamho $0 hvh} 8%

    ]OECO pmokkhb}okho fho pmnmrejwhho l}okwe cbumjvelouh $}pfhvm%

    WMAMGV nmr}phjho l}okwe }ov}j nmokhnbea fhvh eop}v fhre H

    GCOVCD 9

    Denp}oho H nmr}phjho denp}oho phwhokho vmr}r}v $t!u%! uhev} z

    $2!8%!$7!2%!$;!8% fho $8!0%~/ Fhre fhvh.fhvh vmrwmb}v hjho fevmov}jho w}hv}

    phwhokho vmr}r}v uhok nmneaeje i}nahd t fho u uhok neoen}n/ Hfhp}o bhvhwho

    fhre t fho u nhweok.nhweok ambed bmwhr fhre oca/

    Pmoumamwhehoouh 9

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    8/18

    Wca}we 0

    O > 8 9 t>2 ? 0

    U>8 ? 0 LMHWEBAM $wca}we! t%

    Wca}we z$2!8%~

    O > 2 9 t>7 ? 0 U>2 ? 0 LMHWEBAM $wca}we! t%

    Wca}we z$2!8%!z7!2%~

    O > 7 9 t>; ? 0 U > 8 ? 0 LMHWEBAM $wca}we! t%

    Wca}we zz2!8%!$7!2%!$;!8%~

    O > 6 9 t > 8 ? 0

    U > 0 ? 0 VEFHJ LMHWEBAM

    Wca}we z$2!8%!z7!2%!$;!8%~

    Fhre denp}oho wca}we uhok n}okjeo vmrwmb}v fepmrcamd wca}we uhok

    cpvenha $fhahn dha eoe neoen}n% hfhahd $2!8% uhok i}nahdouh wmbmwhr 2 * 8 > 7/

    Ihfe wca}we > $2!8%

    Nmvcfm krmmfu bhouhj fek}ohjho fhahn bmrbhkhe pmoumamwheho nhwhahd!

    hovhrh aheo hfhahd 9

    8/ Cpvenha Wvcrhkm co Vhpmw Prcbamn

    2/ Jhopwhgj Prcbamn

    7/ Neoen}n Wphooeok Vrmm Prcbamn

    6/ Wdcrvmwv Phvd Prcbamn

    B/ Fuohneg Prckrhnneok

    Fuohneg Prckrhnneok hfhahd prcwmf}r nhvmnhvew uhok vmr}vhnh

    ferhoghok }ov}j nmnpmrbheje mlewemowe pmrdev}okho nhwhahd pmnrckrhnho

    nhvmnhvew vmrvmov} fmokho nmok}rhejhoouh nmoihfe bhkeho.bhkeho nhwhahd uhok

    ambed jmgea/

    Wmdeokkh prckrhn Feohnew $fuohneg prckrhnneok%9

    c nmvcfm pmnmghdho nhwhahd fmokho ghrh nmok}rhejho wca}we nmoihfewmj}np}aho vhdhpho $wvhkm%

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    9/18

    c wmfmnejeho wmdeokkh wca}we fhre pmrwchaho fhphv fephofhok fhre wmrhokjhehojmp}v}who uhok whaeok bmrjhevho/

    Ewveahd prckrhn feohnew n}og}a jhrmoh pmrdev}okho wca}we nmokk}ohjho vhbma.

    vhbma/

    Fuohneg prckrhnneok wmbhkhe w}hv} vmjoej cpvenhwe nmneaeje bmbmrhph

    jmambedho! fehovhrhouh 9

    Prcwmw pmnmghdho w}hv} nhwhahd uhok jcnpamjw nmoihfe w}b.w}b nhwhahd uhok

    ambed jmgea nmnb}hv w}nbmr pmrnhwhahdho fhahn rhokjheho prcwmw nhwhahd

    vmrwmb}v nmoihfe ambed imahw }ov}j fejmvhd}e/

    Pmofmjhvho fuohneg prckrhnneok fhphv fehpaejhwejho }ov}j bmrbhkhe nhghn

    nhwhahd pmnrckrhnho nhvmnhvej! jhrmoh fuohneg prckrhnneok gmofmr}ok ambed

    lamjwebma fhrephfh vmjoej cpvenhwe aheo/

    Prcwmf}r pmrdev}okho fuohneg prckrhnneok i}kh nmnpmrjmohojho bmov}j

    hohaewew wmoweve|evhw vmrfhphv phfh wmvehp |hrehbma wvhv}w $wvhvm% nh}p}o phfh

    |hrehbma uhok hfh fe nhweok.nhweok vhdhp jmp}v}who $wvhkm%/

    Fuohneg prckrhnneok fhphv nmoumw}hejho wewvmnhvejh pmrdev}okhoouh

    nmo}r}v }j}rho nhwhahd uhok vefhj wmaha} vmvhp fmokho vmvhp nmahj}jho

    pmrdev}okho whv} pmr whv} wmghrh amokjhp fho nmouma}r}d/

    Fewhnpeok nmneaeje jmambedho! fuohneg prckrhnneok i}kh nmneaeje

    bmbmrhph jmj}rhokho! fehovhrhouh 9

    Pmokk}ohho fuohneg prckrhnneok iejh vefhj feahj}jho wmghrh vmphv! hjho

    nmokhjebhvjho jmvefhjmlewemoho behuh nh}p}o {hjv}/ Jhrmoh fhahn

    nmokk}ohjho fuohneg prckrhnneok fepmra}jho jmhdaeho! pmokmvhd}ho! fho wmoe

    }ov}j nmr}n}wjho w}hv} nhwhahd uhok jcnpamjw! vmr}vhnh uhok bmrjhevho

    fmokho pmomvhpho l}okwe vrhowlcrnhwe fhre pmrnhwhahdho vmrwmb}v/

    Fuohneg prckrhnneok vefhj nmneaeje w}hv} bmov}j lcrn}ahwe nhvmnhvej uhok

    bhj} }ov}j fek}ohjho wmghrh jcowmj}mo! wmdeokkh pmrdev}okho }ov}j

    nmokdhweajho jmp}v}who cpvenha uhok feahj}jho vmrbhvhw phfh jcofewe vmrvmov}/

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    10/18

    Dhnbhvho vmrbmwhr phfh fuohneg prckrhnneok hfhahd nhwhahd

    fenmowecohaevhw! uhev} nhwhahd fenhoh pmoeokjhvho |hrehbma jmhfhho uhok

    fek}ohjho fhahn pmrdev}okho pmnrckrhnho feohnew hjho nmohnbhd bmbho

    nmncre jcnp}vmr wmrvh nmohnbhd ahnh {hjv} pmrdev}okho/

    Jhrhjvmrewvej pmoumamwheho pmrwchaho fmokho Prckrhn Feohnew9

    vmrfhphv wmi}nahd bmrdeokkh peaedho uhok n}okjeo! wca}we phfh wmvehp vhdhp febhok}o fhre dhwea wca}we vhdhp wmbma}nouh! jevh nmokk}ohjho pmrwuhrhvho cpvenhwe fho jmofhah }ov}j nmnbhvhwe

    wmi}nahd peaedho uhok dhr}w fepmrvenbhokjho phfh w}hv} vhdhp/

    Pmrbmfhho Hakcrevnh Krmmfu fmokho Prckrhn Feohnew9

    Krmmfu9 dhouh whv} rhokjheho jmp}v}who uhok fedhweajho Prckrhn feohnew9 ambed fhre whv} rhokjheho jmp}v}who uhok

    fepmrvenbhokjho/

    Veoih} krhl fe bh{hd eoe/ Jevh eokeo nmomn}jho aeovhwho vmrpmofmj fhre 8 jm 80/

    Krmmfu9 82 2 * 6 * 7 * 6 > 87

    Preowep Cpvenhaevhw

    Phfh prckrhn feohnew! rhokjheho jmp}v}who uhok cpvenha feb}hv fmokhonmokk}ohjho Preowep Cpvenhaevhw/

    Preowep Cpvenhaevhw9 iejh wca}we vcvha cpvenha! nhjh bhkeho wca}we whnphevhdhp jm.j i}kh cpvenha/

    8 7

    2

    6

    =

    A}hw Bhok}o>86 gn

    Bhok}o EEE> A}hw Bhok}o>4 gn

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    14/18

    Bhok}o E\> A}hw Bhok}o> 8 8 t 7= * 2 t 2 * 8 t 86

    > =7 gn

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    17/18

    Ihfe wewh bhok}o hfhahd =7 gn fhre a}hw bhok}o }vhnh uhev} =2= gn

    fmokho nmokk}ohjho 68 bhok}o ambed mlmjvel fhre phfh fuohneg

    prckrhnneok/

  • 7/23/2019 Hardianti Hafid_Resume Metode Greedy Dan Dynamic Programming

    18/18