HDOJ 1257 最少拦截系统
2015-05-11 22:53
281 查看
题意:一个导弹拦截系统拦截导弹的高度必须不低于前一次的高度,求拦截所有的导弹需要多少套拦截系统
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1257
思路:求包含所有数的LIS的最少个数,通过数组维护每个LIS的最大值判断
注意点:无
以下为AC代码:
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1257
思路:求包含所有数的LIS的最少个数,通过数组维护每个LIS的最大值判断
注意点:无
以下为AC代码:
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
11354059 | 2014-08-07 12:51:02 | Accepted | 1257 | 46MS | 376K | 958 B | G++ | luminous11 |
#include <iostream> #include <cstdio> #include <string> #include <cstring> #include <iostream> #include <cstring> #include <cstdio> #include <string> #include <vector> #include <deque> #include <list> #include <map> #include <set> #include <queue> #include <stack> #include <cmath> #include <ctime> #include <cctype> #include <climits> #include <iomanip> #include <cstdlib> #include <algorithm> //#include <unordered_map> //#include <unordered_set> #define ll long long #define ull unsigned long long #define all(x) (x).begin(), (x).end() #define clr(a, v) memset( a , v , sizeof(a) ) #define pb push_back #define RDI(a) scanf ( "%d", &a ) #define RDII(a, b) scanf ( "%d%d", &a, &b ) #define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c ) #define RS(s) scanf ( "%s", s ) #define PI(a) printf ( "%d", a ) #define PIL(a) printf ( "%d\n", a ) #define PII(a,b) printf ( "%d %d", a, b ) #define PIIL(a,b) printf ( "%d %d\n", a, b ) #define PIII(a,b,c) printf ( "%d %d %d", a, b, c ) #define PIIIL(a,b,c) printf ( "%d %d %d\n", a, b, c ) #define PL() printf ( "\n" ) #define PSL(s) printf ( "%s\n", s ) #define rep(i,m,n) for ( int i = m; i < n; i ++ ) #define REP(i,m,n) for ( int i = m; i <= n; i ++ ) #define dep(i,m,n) for ( int i = m; i > n; i -- ) #define DEP(i,m,n) for ( int i = m; i >= n; i -- ) #define repi(i,m,n,k) for ( int i = m; i < n; i += k ) #define REPI(i,m,n,k) for ( int i = m; i <= n; i += k ) #define depi(i,m,n,k) for ( int i = m; i > n; i += k ) #define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k ) #define READ(f) freopen(f, "r", stdin) #define WRITE(f) freopen(f, "w", stdout) using namespace std; const double pi = acos(-1); template <class T> inline bool RD ( T &ret ) { char c; int sgn; if ( c = getchar(), c ==EOF )return 0; //EOF while ( c != '-' && ( c < '0' || c > '9' ) ) c = getchar(); sgn = ( c == '-' ) ? -1 : 1; ret = ( c == '-' ) ? 0 : ( c - '0' ); while ( c = getchar() , c >= '0' && c <= '9' ) ret = ret * 10 + ( c - '0' ); ret *= sgn; return 1; } inline void PD ( int x ) { if ( x > 9 ) PD ( x / 10 ); putchar ( x % 10 + '0' ); } const double eps = 1e-10; const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 }; struct node{ int x, y, cnt; node(){} node( int _x, int _y ) : x(_x), y(_y) {} node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {} }; int num[100005]; int main() { int n; while ( RDI ( n ) != EOF ){ int k; int cnt = 0; int m = 0; rep ( i, 0, n ){ RDI ( k ); int j = 0; for ( j = 0; j < m; j ++ ){ if ( num[j] > k ){ num[j] = k; break; } } if ( j == m ){ num[m++] = k; cnt ++; } } PIL ( m ); } return 0; }
相关文章推荐
- HDOJ 1257 最少拦截系统 贪心算法
- hdoj 1257 最少拦截系统
- HDOJ-1257 最少拦截系统
- HDOJ.1257 最少拦截系统 (贪心)
- hdoj1257_最少拦截系统(dp)
- HDOJ 最少拦截系统 JAVA 1257
- hdoj1257最少拦截系统
- hdoj 1257 最少拦截系统【贪心】
- HDOJ 1257 最少拦截系统
- HDOJ 1257 最少拦截系统(LIS)
- hdoj1257 最少拦截系统
- hdoj 1257 最少拦截系统
- HDOJ 1257 最少拦截系统
- 【动态规划】HDOJ 1257 最少拦截系统
- HDOJ-1257 最少拦截系统
- hdoj--1257--最少拦截系统(动态规划)
- HDOJ 题目1257最少拦截系统(贪心。动态规划)
- HDoj-1257-最少拦截系统
- hdoj 1257 最少拦截系统
- hdoj 1257最少拦截系统