// LIS
// O(nlogn)
#include <stdio.h>
#define MAX_N 500005
int n; // number of roads plan to build
int road[MAX_N]; // road[p]=r, means a road from city p to city r, city start from 1
int dp[MAX_N]; // dp[i] means the length of LIS from 1 to i
int b[MAX_N]; // b[j] means the minimum value of the last element of the LIS whose length is j
int max(int a, int b)
{
return a > b ? a : b;
}
int binary_search(int a[], int size, int value)
{
int lo = 1;
int hi = size;
while (lo < hi)
{
int mid = (lo + hi) / 2;
if (a[mid] < value)
{
lo = mid + 1;
}
else
{
hi = mid;
}
}
return lo;
}
int lis()
{
int i = 1;
int sz = 1;
b[1] = road[i];
dp[1] = 1;
for (i = 2; i <= n; i++)
{
if (road[i] < b[1])
{
b[1] = road[i];
dp[i] = 1;
}
else if (road[i] > b[sz])
{
sz++;
b[sz] = road[i];
dp[i] = sz;
}
else
{ // find the k, which b[k-1]<road[i]<b[k]
int k = binary_search(b, sz, road[i]);
b[k] = road[i];
dp[i] = k;
}
}
int ret = 0;
for (i = 1; i <= n; i++)
{
if (ret < dp[i])
ret = dp[i];
}
return ret;
}
// O(n^2)
int dp_lis()
{
int i, j;
dp[1] = 1;
for (i = 2; i <= n; i++)
{
dp[i] = 1;
for (j = 1; j < i; j++)
{
if (road[i] > road[j])
{
if (dp[i] < dp[j] + 1)
dp[i] = dp[j] + 1;
}
}
}
int ret = 0;
for (i = 1; i <= n; i++)
{
if (ret < dp[i])
ret = dp[i];
}
return ret;
}
int main()
{
freopen("hdu1025_input.txt", "r", stdin);
int tc = 0;
int i;
int p, r; // city start from 1
int ans; // at least can build one road
while (scanf("%d", &n) != EOF)
{
tc++;
for (i = 0; i < n; i++)
{
scanf("%d %d", &p, &r);
road[p] = r;
}
//ans = lis();
ans = dp_lis();
if (ans == 1)
printf("Case %d:\nMy king, at most %d road can be built.\n\n", tc, ans);
else
printf("Case %d:\nMy king, at most %d roads can be built.\n\n", tc, ans);
}
return 0;
}
hdu1025 - LIS
最新推荐文章于 2016-06-30 21:12:56 发布