记录编号	122435	评测结果	AAAAAAAAAA
题目名称	[RQNOJ 167] 免费午餐	最终得分	100
用户昵称	HouJikan	是否通过	通过
代码语言	C++	运行时间	0.038 s
提交时间	2014-09-23 15:59:05	内存使用	0.70 MiB

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <set>
#include <list>
#include <iterator>
#include <ctime>
#include <queue>
#include <stack>
#include <vector>
#include <functional>
#include <deque>
#define For(i,j,k) for(int i=(j);i<=(k);i++)
using namespace std;
typedef long long LL;
typedef unsigned int Uint;
const int INF=0x7fffffff;
const double eps=1e-6;
using namespace std;
//================struct declaration======================

//================var declaration=-========================
const int MAXN=101000;
int g[MAXN],n,w;
//================function declaration====================
bool cmp(int a,int b){return a>b;}
//================main code===============================
int main()
{
  string ProgrammeName="lunch";
  string FloderName="COGS";
  freopen((ProgrammeName+".in").c_str(),"r",stdin);
  freopen((ProgrammeName+".out").c_str(),"w",stdout);
#ifdef DEBUG
  clock_t Start_Time=clock();
  system(("copy C:\\Users\\abc\\Desktop\\HouJikan\\"+FloderName+"\\standard.cpp C:\\Users\\abc\\Desktop\\HouJikan\\"+FloderName+"\\submit.txt").c_str());
#endif 
  g[0]=INF;
  int ans=0;
  scanf("%d",&n);
  For(i,1,n)
  {
    scanf("%d",&w);
    if (w==0) continue;
    int p=lower_bound(g,g+1+n,w,cmp)-g;
    g[p]=w;
    ans=max(ans,p);
  }
  cout<<ans<<endl;
#ifdef DEBUG
  clock_t End_Time=clock();
  printf("\n\nTime Used :%.6lf Ms\n",double(Start_Time-End_Time)/(-CLOCKS_PER_SEC));
#endif
  return 0;
}
//================function code===========================