#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <cctype>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef struct _datalog
{
int st;
int ed;
} datalog;
int cmp(datalog a, datalog b)
{
return a.ed < b.ed;
}
int main()
{
int dp[100] = {0};
int n;
cin >> n;
vector<datalog> p;
datalog q;
for (int i = 0; i < n; i++)
{
cin >> q.st >> q.ed;
p.push_back(q);
}
sort(p.begin(), p.end(), cmp);
int j = 0;
int maxtmp = 0;
int ans = 0;
for (int i = 1; i <= n; i++)
{
maxtmp = 0;
for (int j = i -1; j < i; j++)
{
if (dp[j] > maxtmp && p[i].st >= p[j].ed )
{
maxtmp = dp[j];
}
}
dp[i] = maxtmp + 1;
cout << "dp[i] :" << dp[i] << endl;
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
网易-时间任务最优分配
最新推荐文章于 2022-06-12 16:01:21 发布