10131 - Is Bigger Smarter?(简单动规)

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define M 1005
int n, ans, ansx, w[M], s[M], sor[M], dp[M], pa[M];
int cmp(const int a, const int b) { return w[a]<w[b]; }
void solve()
{
for(int i = 0; i < n; i++) {dp[i] = 1; pa[i] = -1;}
for(int i = 1; i < n; i++)
for(int j = 0; j < i; j++)
{
int x1 = sor[j], x2 = sor[i];
if(s[x1]>s[x2]&&w[x1]<w[x2]) { if(dp[i]<dp[j]+1) {dp[i] = dp[j]+1; pa[i] = j;}}
}
ans = 0;
for(int i = 0; i < n; i++) if(ans<dp[i]) {ans = dp[i]; ansx = i;}
}
void print_ans(int cur)
{
if(cur == -1) return;
else {print_ans(pa[cur]); printf("%d\n",sor[cur]+1);}
}
int main ()
{

n = 0;
while(~scanf("%d %d",&w
,&s
)) n++;
for(int i = 0; i < n; i++) sor[i] = i;
sort(sor,sor+n,cmp);
solve();
printf("%d\n",ans);
print_ans(ansx);
return 0;
}