Kapalı

algorithm design

You are given a schedule of video game tournaments, sorted by the date on which they will

occur. Each tournament i has a difficulty level d[i] and a prize amount p[i]. You feel confident

you can win any tournament, however the organizers do not allow anyone who has won a more

difficult tournament to participate (so if you won a tournament with difficulty 2, from this point

on, you can only participate in tournaments with difficulty level 2 or greater. Design and

implement in Java a Dynamic Programming algorithm to select which tournaments you should

participate in if you want to maximize your profit

Notes - You plan to win all the tournaments in which you participate!

- Include in your answer the Java code that would initialize and fill in the DP array.

Beceriler: Java, JavaFX, JavaScript, Yazılım Mimarisi, C Programlama

Müşteri Hakkında:
( 0 değerlendirme ) Cairo, Egypt

Proje NO: #34396972

Bu iş için 10 freelancer ortalamada $20 teklif veriyor

neernab

Hi, We are a team of programmers having experience in wide varierty of skills ranging from HTML, CSS, Javascript, React js, React Native, MEAN Stack, Java, J2EE, JSP, Spring, Servelets,Kotlin, Python, Tkiniter, PyQT, Daha Fazla

$30 USD in 5 gün içinde
(68 Değerlendirme)
5.6
theatasolution1

Hello, I'm an expert Java developer with experience in object-oriented, data structure, swing, JavaFX and more advanced. I can help you to finish this project with great quality. We can negotiate on price/Budget Regard Daha Fazla

1 gün içinde %bids___i_sum_sub_32%%project_currencyDetails_sign_sub_33% USD
(75 Değerlendirme)
5.5
patrickNo10

I am a PhD in computer science. Main areas of scientific interests are discrete mathematics, combinatorics and graph theory. I also have an 5-year-experience of working in a huge international company as a Java develo Daha Fazla

$20 USD in 7 gün içinde
(3 Değerlendirme)
4.2
carusox

Hello I'm a computer science student, who really likes algorithms (this is my codeforces page [login to view URL]) My solution has complexity O(n ^ 2) in time and O(n ^ 2) in space (if considering n Daha Fazla

1 gün içinde %bids___i_sum_sub_32%%project_currencyDetails_sign_sub_33% USD
(3 Değerlendirme)
2.1
xBoSsZz

Hello! I have experience working in Java and this is a task I can do perfectly in a short period of time. I can start working right away and I'm sure you'll be pleased with the result. Hope to hear from you!

1 gün içinde %bids___i_sum_sub_32%%project_currencyDetails_sign_sub_33% USD
(4 Değerlendirme)
2.1
samylacha

i am a cyber security engineer, i have experience with multiple programming languages aspecially java, because it is the good language to use in networking. but this problem you posted reminds me of competitive program Daha Fazla

$20 USD in 2 gün içinde
(0 Değerlendirme)
0.0
devastatingram

Hello I understood your requirement but I have few doubts, text me so I can clear all my doubts right away, I can help you and i am ready for work. Thank you.

$20 USD in 7 gün içinde
(1 Yorum)
0.0
TabatadzeD

Hello. This is a very simple task and I guarantee that I can do it in at most an hour or two. I've solved countless number of problems like this. Could you provide sample input and output?

1 gün içinde %bids___i_sum_sub_32%%project_currencyDetails_sign_sub_33% USD
(0 Değerlendirme)
0.0
a46134038

This problem is similar to the knapsack problem, that's can using the exhaustive method to do DP, but I am not proficient with JAVA, If it can be solve with C, we will cooperate great

$20 USD in 7 gün içinde
(0 Değerlendirme)
0.0
lohiyasatyam

Hello, I have experience working in Java and have a good knowledge of dynamic programming, I have seen your problem it is very clear to me, I have already solved this problem with quality code. My code takes O(N log N) Daha Fazla

$10 USD in 7 gün içinde
(0 Değerlendirme)
0.0