题目大意:先给出一张卡片的长和宽, 现在有n张信封, 每张信封都有一定的长和宽, 现在要求从这些信封中选出最多信封, 从左到右排列, 右边的信封的长宽都分别大于左边的, 且卡片能装入最左边的信封中。
思路:对信封排个序后, 转化为求最长单调递增子序列。 和HDOJ 1069思路相差不多
code:
#include <iostream>
#include <algorithm>
#define N 5002
#define inf -1234567890
using namespace std;
int n = 0, w = 0, h = 0, dp[N], pre[N];
struct node
{
int x, y, id;
bool operator <(const node &s) const
{
if(x != s.x)
return x<s.x;
return y<s.y;
}
}p[N];
void print(int k)
{
if(pre[k] == -1)
{
cout<<p[k].id+1<<" ";
return ;
}
print(pre[k]);
cout<<p[k].id+1<<" ";
}
int main()
{
int i = 0, j = 0, k = 0, Max = 0, cnt1 = 0, cnt2 = 0;
while(cin>>n>>w>>h)
{
cnt1 = cnt2 = 0;
for(i = 0; i<n; i++)
{
cin>>p[i].x>>p[i].y;
p[i].id = i;
dp[i] = 1;
}
sort(p, p+n);
for(i = 0; i<n; i++)
{
if(p[i].x<=w || p[i].y<=h)
dp[i] = inf;
else
{
for(pre[i] = -1, j = 0; j<i; j++)
if(p[i].x>p[j].x && p[i].y>p[j].y)
if(dp[i]<dp[j]+1)
{
dp[i] = dp[j]+1;
pre[i] = j;
}
}
}
Max = inf;
for(i = 0; i<n; i++)
if(Max<dp[i])
{
k = i;
Max = dp[i];
}
if(Max != inf)
{
cout<<Max<<endl;
print(k);
cout<<endl;
}
else
cout<<0<<endl;
}
return 0;
}
网上看到的用dfs思路写的代码,贴一贴
code:
#include <iostream>
#define N 5002
using namespace std;
struct node
{
int x, y;
}p[N];
int n = 0, w = 0, h = 0, dp[N], next[N];
int dfs(int c)
{
int i = 0, k = 0;
if(dp[c]) return dp[c];
for(i = 0; i<=n; i++)
{
if(p[i].x>p[c].x && p[i].y>p[c].y)
{
k = dfs(i);
if(dp[c]<=k)
{
dp[c] = k+1;
next[c] = i;
}
}
}
return dp[c];
}
int main()
{
int i = 0, j = 0, k = 0;
cin>>n;
for(i = 0; i<=n; i++)
{
cin>>p[i].x>>p[i].y;
next[i] = 0;
dp[i] = 0;
}
k = dfs(0);
cout<<k<<endl;
if(k)
{
i = 0;
while(next[i])
{
cout<<next[i]<<" ";
i = next[i];
}
}
return 0;
}