区间调度 + 优先从后往前种 #include <iostream> using namespace std; #include <vector> #include <algorithm> struct suggestion {     int start;     int end;     int tree; }; bool cmp(suggestion s1, suggestion s2) {     return s1.end &l...

#include <iostream> #include <algorithm> using namespace std; int l[30005], ans; struct sug { int b, e, t; } su[5005]; bool cmp(sug a, sug b) { return a.e < b.e; } int main() { int n, h; cin >> n >> h; for (int i = 1; i <= h; i++)...