项目安排

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

class Project {
private int start = 0;
private int end = 0;
private int value = 0;

public Project(int start, int end, int value) {
super();
this.start = start;
this.end = end;
this.value = value;
}

public int getStart() {
return start;
}

public void setStart(int start) {
this.start = start;
}

public int getEnd() {
return end;
}

public void setEnd(int end) {
this.end = end;
}

public int getValue() {
return value;
}

public void setValue(int value) {
this.value = value;
}

@Override
public String toString() {
return "Project [start=" + start + ", end=" + end + ", value=" + value
+ "]";
}

}

public class Main {

private static void init(int a[]) {
for (int i = 0; i < a.length; i++) {
a[i] = 0;
}
}

public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
List<Project> list = new ArrayList<Project>();
while (cin.hasNext()) {
int n = cin.nextInt();
int dp[] = new int
;
init(dp);
for (int i = 0; i < n; i++) {
int start = cin.nextInt();
int end = cin.nextInt();
int value = cin.nextInt();
list.add(new Project(start, end, value));
}
Collections.sort(list, new Comparator<Project>() {

@Override
public int compare(Project o1, Project o2) {
return o1.getEnd() - o2.getEnd();
}
});
// dp[i]表示前i个项目的最大价值
dp[0] = list.get(0).getValue();
for (int i = 1, length = list.size(); i < length; i++) {
int start = list.get(i).getStart();
int value = list.get(i).getValue();
//第i个项目做还是不做
dp[i] = Math.max(value, dp[i-1]);
for (int j = i - 1; j >= 0; j--) {
int pre_end = list.get(j).getEnd();
if (pre_end <= start) {
//前j个加上第i个
dp[i] = Math.max(dp[i], dp[j] + value);
break;
}
}
}
System.out.println(dp[n-1]);
}
}
}