SL_World的博客

Description Suppose you will recruit a group of volunteers for a coming event. It is estimated that this event will take N days to complete, and the i(th) day needs at least Ai volunteers. The number ...

问题描述： n个作业{1，2，…，n}要在由2台机器M1和M2组成的流水线上完成加工。每个作业加工的顺序都是先在M1上加工，然后在M2上加工。M1和M2加工作业i所需的时间分别为ai和bi。 流水作业调度问题要求确定这n个作业的最优加工顺序，使得从第一个作业在机器M1上开始加工，到最后一个作业在机器M2上加工完成所需的时间最少。 分析： 直观上，一个最优调度应使机器M1没

Problem Description Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you...

Problem Description Given an array of size n that has the following specifications: Each element in the array contains either a monkey or a banana. Each monkey can eat only one banana. A monkey cannot ...

Problem description: Some people want to cross a river by boat. Each person has a weight, and each boat can carry a maximum weight of limit. Each boat carries at most 2 people at the same time, provid...

Description Given a rope whose length is n(1<=n<=501<=n<=50), please cut the rope to m parts to get the maximum product of the length of each part ∏l1+l2+…+lm=nl1∗l2∗…∗lm∏l1+l2+…+lm=nl1∗l2...

Description: There are nn(1<=n<=1051<=n<=105) distinct jobs, labeled J1,J2,…,JnJ1,J2,…,Jn, which can be performed completely independently of one another. Each jop consists of two stages: ...

Problem description: There are N Monkeys and N bananas are placed in a straight line. Each monkey want to have a banana, if two monkeys want to own the same banana, there will be a fight! A monkey can...