Evolution Game
题意:
一只怪物长有很多角和眼睛,可以变换成不同的形态,每种形态有不同的角和眼睛。变化的规则是后一次有的角个数比前一次的角的个数多,然后规定一个数m,后一次的眼睛个数和前一个眼睛个数差的绝对值要小于等于m。
首先给出n和m,n代表n次变身,m代表变身之后角个数的变化最大限度值。然后给出每次变身的角的个数。问这只怪物最多能够变化几次。
解题思路
将怪物的角个眼睛存到一个结构体里。因为数组下标代表的是怪物每次变身的眼睛数,把结构体按角的个数从大到小进行排序,然后用dp最长上升子序列的思想,从前到后遍历即可。
代码:
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
//#include <tr1/unordered_map>
#include <bits/stdc++.h>
#include <cmath>
//#include <unordered_map>
using namespace std;
#define sfd(i) scanf("%d", &i)
#define sfl(i) scanf("%I64d", &i)
#define sfs(i) scanf("%s", (i))
#define prd(i) printf("%d\n", i)
#define prl(i) printf("%I64d\n", i)
#define sff(i) scanf("%lf", &i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mst(x, y) memset(x, y, sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
// const int maxn = 3e5;
#define PI acos(-1.0)
#define lowbit(x) ((x) & (-x))
#define fl() printf("flag\n")
#define MOD(x) ((x % mod) + mod) % mod
#define endl '\n'
#define pb push_back
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define FAST_IO \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
//-----------------------------------------------
const int N = 5050;
int dp[N];
struct node {
int horn, eyes;
} a[N];
bool cmp(node a, node b) { return a.horn < b.horn; }
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i].horn;
a[i].eyes = i;
}
sort(a + 1, a + n + 1, cmp);
int max1 = -1, cnt;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (a[j].horn > a[i].horn && abs(a[i].eyes - a[j].eyes) <= m)
dp[j] = max(dp[j], dp[i] + 1);
}
}
for(int i = 1; i <= n; i++)
{
max1 = max(dp[i], max1);
}
cout << max1 << endl;
}