POJ 1836 Alignment
来源:互联网 发布:监控画面 分析软件 编辑:程序博客网 时间:2024/06/07 23:32
Alignment
Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 11450Accepted: 3647
1.86 1.86 1.30621 2 1.4 1 1.97 2.2
DP两遍LIS,
a1<a2<a3<.....<ai<=>ai+1>ai+2>ai+3>....a+n
Description
In the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied with the way his soldiers are aligned; it is true that the soldiers are aligned in order by their code number: 1 , 2 , 3 , . . . , n , but they are not aligned by their height. The captain asks some soldiers to get out of the line, as the soldiers that remain in the line, without changing their places, but getting closer, to form a new line, where each soldier can see by looking lengthwise the line at least one of the line's extremity (left or right). A soldier see an extremity if there isn't any soldiers with a higher or equal height than his height between him and that extremity.
Write a program that, knowing the height of each soldier, determines the minimum number of soldiers which have to get out of line.
Write a program that, knowing the height of each soldier, determines the minimum number of soldiers which have to get out of line.
Input
On the first line of the input is written the number of the soldiers n. On the second line is written a series of n floating numbers with at most 5 digits precision and separated by a space character. The k-th number from this line represents the height of the soldier who has the code k (1 <= k <= n).
There are some restrictions:
2 <= n <= 1000
the height are floating numbers from the interval [0.5, 2.5]
There are some restrictions:
2 <= n <= 1000
the height are floating numbers from the interval [0.5, 2.5]
Output
The only line of output will contain the number of the soldiers who have to get out of the line.
Sample Input
81.86 1.86 1.30621 2 1.4 1 1.97 2.2
Sample Output
4Source
Romania OI 2002DP两遍LIS,
a1<a2<a3<.....<ai<=>ai+1>ai+2>ai+3>....a+n
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int getLIS(int* a,int len)
{
int dp[1100],cnt=1;
dp[0]=a[0];
for(int i=1;i<len;i++)
{
if(dp[cnt-1]<a)
{
dp[cnt++]=a;
}
else
{
*lower_bound(dp,dp+cnt,a)=a;
}
}
return cnt;
}
int main()
{
int n;
int a[1100],b[1100],c[1100],ans=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
double x;
scanf("%lf",&x);
a=x*100000;
}
for(int i=0;i<n-1;i++)
{
for(int j=0;j<=i;j++)
b[j]=a[j];
for(int j=n-1;j>i;j--)
c[n-1-j]=a[j];
ans=max(getLIS(b,i+1)+getLIS(c,n-i-1),ans);
}
printf("%d\n",n-ans);
return 0;
}
* This source code was highlighted by YcdoiT. ( style: Codeblocks )#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int getLIS(int* a,int len)
{
int dp[1100],cnt=1;
dp[0]=a[0];
for(int i=1;i<len;i++)
{
if(dp[cnt-1]<a
{
dp[cnt++]=a
}
else
{
*lower_bound(dp,dp+cnt,a
}
}
return cnt;
}
int main()
{
int n;
int a[1100],b[1100],c[1100],ans=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
double x;
scanf("%lf",&x);
a
}
for(int i=0;i<n-1;i++)
{
for(int j=0;j<=i;j++)
b[j]=a[j];
for(int j=n-1;j>i;j--)
c[n-1-j]=a[j];
ans=max(getLIS(b,i+1)+getLIS(c,n-i-1),ans);
}
printf("%d\n",n-ans);
return 0;
}
0 0
- POJ 1836 Alignment
- POJ 1836 Alignment
- poj 1836 Alignment
- Poj 1836 Alignment
- poj 1836 Alignment
- POJ 1836-Alignment
- poj 1836 Alignment
- POJ 1836 Alignment
- POJ 1836 Alignment
- POJ 1836 Alignment
- POJ 1836 Alignment
- POJ 1836 Alignment
- POJ 1836 Alignment
- poj 1836 Alignment
- poj 1836 Alignment
- poj 1836 Alignment
- POJ - 1836 Alignment
- poj 1836 Alignment
- WinRT开发语言的功能和效率
- 2013 ACM/ICPC Asia Regional Chengdu Online 1004 Minimum palindrome
- Asp.Net MVC4入门指南(7):给电影表和模型添加新字段
- HDOJ 4731 Minimum palindrome
- Asp.Net MVC4入门指南(8):给数据模型添加校验器
- POJ 1836 Alignment
- android获得控件在屏幕中的绝对坐标 getLocationInWindow 和 getLocationOnScreen
- POJ 3267 The Cow Lexicon
- Asp.Net MVC4入门指南(9):查询详细信息和删除记录
- DataGuard小结--1
- POJ 1054 The Troublesome Frog
- Asp.Net MVC4入门指南(10):第三方控件Studio for ASP.NET Wijmo MVC4 工具应用
- POJ 3280 Cheapest Palindrome
- POJ 1191 棋盘分割
原创粉丝点击
热门IT博客
热门问题
老师的惩罚
人脸识别
我在镇武司摸鱼那些年
重生之率土为王
我在大康的咸鱼生活
盘龙之生命进化
天生仙种
凡人之先天五行
春回大明朝
姑娘不必设防,我是瞎子
生孩子准备物品清单
生二胎好不好
什么生孩子
生完孩子胸部
咋生孩子
女人为什么生不了孩子
生孩
生孩子的
生孩子了
要怎么样才能生孩子
生的
女人不能生孩子怎么办
哪家生孩子好
生孩子前的症状
孕妇生宝宝
生孩子要准备什么
生孩子方法
生孩子需要什么手续
生孩子花费
生孩子准备什么东西
生孩子的方法
生孩子前检查
咋样生孩子
生 孩子
怎么检查能不能生孩子
产妇生完孩子
生孩子带什么去医院
为什么生孩子
在哪生孩子好
生孩子怎么
生孩子去医院带什么
产妇生孩子
生孩子送什么
侍卫生子文
孕妇生孩子
生孩子过程
生完孩子送什么好
生孩子剖腹产
生孩子分娩
生孩子怎么生
生孩子的图片