Welcome to the Java Programming Forums


The professional, friendly Java community. 21,500 members and growing!


The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.


>> REGISTER NOW TO START POSTING


Members have full access to the forums. Advertisements are removed for registered users.

Results 1 to 2 of 2

Thread: There is an exercises about find the shortest day to solve all the problems

  1. #1
    Junior Member
    Join Date
    Mar 2013
    Posts
    2
    Thanks
    0
    Thanked 0 Times in 0 Posts

    Post There is an exercises about find the shortest day to solve all the problems

    The ex given n ( number of problems), L (time of one day) , C ( a cont to calculate thi DIs).
    The input given us n, L, C, and an timeArr[] included the time need to solve the problem i.
    For example.
    The input
    10
    120 10
    80 80 10 50 30 20 40 30 120 100
    That mean we have n=10 prolble have to solve, L=120, C=10, and an array mean , we need 80 time to solve problem 1, 80 to solve probem 2, 10 to solve problem 3....
    All the problem need to solve step by step
    We need to find out the shortest day to solve all the problem and the DI must be minumun.
    The DI is the rest time of one day...
    lớp bằng giá trị DI như sau:
    DI=0 when t=0
    DI=-C when 1<=t<=10
    DI=(t-10)^2 when t>10
    t = the rest time of one day.

    In that example, we must calculate that need minimux 6 day to solve all the problem, and group that (80) (80) (10,50,30) (20,40,30) (120) (100)
    t1=120-80=40
    t2=120-80=40
    t3=120-10-50-30=30
    .....

    So the result of this example is 6 day and minDI is 2700.

    ================================================== ====================================
    I could not have any algorthym for this ...
    Can you help me!!!!
    Thanks alot


  2. #2
    Member Chris.Brown.SPE's Avatar
    Join Date
    May 2008
    Location
    Fort Wayne, Indiana
    Posts
    190
    Thanks
    1
    Thanked 31 Times in 31 Posts

    Default Re: There is an exercises about find the shortest day to solve all the problems

    Your explanation of the project is poor. I really have no idea what it is supposed to be doing. Either way, this forum is not here to do your homework for you. Start working through it and we'll be glad to help you along the way.

Similar Threads

  1. having problem on creating this shortest job first nonpreemptive algorithm
    By morphling18 in forum Java Theory & Questions
    Replies: 10
    Last Post: September 29th, 2012, 12:57 PM
  2. Inheritance & Hierarchy Exercises?
    By Beacon in forum Object Oriented Programming
    Replies: 2
    Last Post: September 21st, 2012, 11:34 AM
  3. [SOLVED] I somehow can't find problems with a few lines
    By SOG in forum What's Wrong With My Code?
    Replies: 8
    Last Post: May 10th, 2012, 09:12 PM
  4. CHALLENGE - find the shortest path
    By ice in forum Algorithms & Recursion
    Replies: 13
    Last Post: January 20th, 2011, 12:30 PM
  5. Exercises - CRITICAL HELP NEEDED
    By Maximillian in forum Java Theory & Questions
    Replies: 5
    Last Post: November 17th, 2009, 05:55 PM