#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 1e5 + 100;
int n, d;
struct node
{int val, ord;
}arr[MAXN],lis[MAXN];int find(int l, int r, int key)
{if (l == r)return l;int mid = (l + r) >> 1;if (key>lis[mid].val)return find(mid + 1, r, key);else return find(1, mid, key);
}int main()
{while (scanf("%d %d", &n, &d) != EOF){        //注意是下标之差大于d，而不是值之差大于dmemset(arr, 0, sizeof(arr));for (int i = 1; i <= n; i++) {scanf("%d", &arr[i].val);arr[i].ord = i;}int len = 0;for (int i = 1; i <=n; i++){if (i == 1)lis[++len] = arr[i];else if (arr[i].val > lis[len].val) {if ((arr[i].ord - lis[len].ord) > d)lis[++len] = arr[i];}else{int j = find(1, len, arr[i].val);if (j != len){if (j == 1){if ((lis[2].ord - arr[i].ord) > d)lis[j] = arr[i];}else{if ((lis[j + 1].ord - arr[i].ord) > d && (arr[i].ord - lis[j - 1].ord) > d)lis[j] = arr[i];}}}    }printf("%d\n", len);}return 0;
}

View Code

#include<iostream>
#include<cstring>
#include<cstdio>
#include <algorithm>
#define maxn 100005
using namespace std;
int a[maxn], b[maxn], p[maxn];
int n, d;int find(int p)   //二分查找<=p的位置+1
{int l, r, mid;l = 1, r = n, mid = (l + r) >> 1;while (l <= r){if (p>b[mid]) l = mid + 1;else if (p<b[mid]) r = mid - 1;else return mid;mid = (l + r) >> 1;}return l;
}int LIS(){int i, j, ans = 0;for (i = 1; i <= n; i++){p[i] = find(a[i]);         //p[i]存的是a[i]在上升数组中的位置ans = max(ans, p[i]);j = i - d;if (j>0) b[p[j]] = min(b[p[j]], a[j]);}return ans;
}int main()
{int i, res;while (cin >> n >> d){for (i = 1; i <= n; i++){scanf("%d", &a[i]);b[i] = maxn;}res = LIS();printf("%d\n", res);}return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 100000 + 10;
int a[maxn], dp[maxn], g[maxn], n, k;int main()
{while (~scanf("%d%d", &n, &k)){int ans = -1;memset(dp, 0, sizeof(dp));memset(g, INF, sizeof(g));for (int i = 1; i <= n; i++)scanf("%d", &a[i]);for (int i = 1; i <= n; i++){                                                                   //延迟p位更新             //为什么我感觉i>k+1以后还是连续的，下标并没有相差k啊？？？搞不懂if (i - k - 1>0)  g[dp[i - k - 1]] = min(a[i - k - 1], g[dp[i - k - 1]]);        // i-p>1 是因为下标j范围为1<j<=mdp[i] = lower_bound(g + 1, g + 1 + n, a[i]) - g;       //先记录下a[i]在g数组中的位置       ans = max(ans, dp[i]);}cout << ans << endl;}return 0;
}