P1868 饥饿的奶牛(线性dp)

P1868 饥饿的奶牛https://www.luogu.com.cn/problem/P1868

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)


int n;
vector<int> v[MAXN];
int dp[MAXN];
int mx;
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		int x, y;
		scanf("%d %d", &x, &y);
		v[y].push_back(x - 1);
		mx = max(mx, y);
	}
	for (int i = 1; i <= mx; i++) {
		dp[i] = dp[i - 1];
		for (int j = 0; j < v[i].size(); j++) {
			dp[i] = max(dp[i], dp[v[i][j]] + i - v[i][j]);
		}
	}
	printf("%d", dp[mx]);
	return 0;
}