C++ deque::clear方法代码示例

int fun(){
	d.clear();
	int i,ret =0;
	for(i=player*card;i>0;i--){
		if(mask[i] ==0){
			d.push_back(i);
		}
	}
	sort(cards,cards+card,greater<int>());
	for(i=0;i<card;i++){
		if(cards[i] > d[0]){
			ret++;
			for(int j=1;j<player;j++){
				d.pop_back();
			}
		} else {
			d.pop_front();
			for(int j=2;j<player;j++){
				d.pop_back();
			}
		}
	}
	return ret;
}

void solve()
{
    int n,k,A,B ; scanf("%d%d%d%d%s",&n,&k,&A,&B,s+1) ;
    for(int i=1;i<=n;i++) scanf("%d",&val[i]) ;
    fill(dp[0],dp[0]+n+1,-INF) ; dp[0][0]=0 ;
    for(int i=1;i<=k;i++)
    {
        fill(dp[i],dp[i]+n+1,-INF) ;
        dq.clear() ;
        for(int j=A;j<=n;j++)
        {
            while(!dq.empty() && dq.back().id<j-B)
                dq.pop_back() ;
            while(!dq.empty() && dq.front().val<=dp[i-1][j-A])
                dq.pop_front() ;
            dq.push_front((P){j-A,dp[i-1][j-A]}) ;
            dp[i][j]=dq.back().val+i*val[j] ;
            last[i][j]=dq.back().id ;
        }
    }
    printf("Case #%d:\n",++tc) ;
    if(dp[k][n]<0) printf("Sorry, you're milk cheese.\n") ;
    else printf("%d\n",dp[k][n]) , print(k,n) ;
}

int get_partition_from_file_tp_format(string S, deque<deque<int> > & M, bool anyway) {


	// if anyway = true il also takes the homeless
	
	M.clear();
	
	char b[S.size()+1];
	cast_string_to_char(S, b);
	
	ifstream inb(b);
	
	string st;
	while(getline(inb, st)) {
	
		deque<string>  vv;
		separate_strings(st, vv);
		if(st.size()>0 && (vv[0]=="#module" || vv[0]=="#group") ) if(cast_string_to_double(vv[5])<1 || anyway) {
			
			getline(inb, st);

			deque<int> v;
			cast_string_to_doubles(st, v);
			sort(v.begin(), v.end());
			if(!v.empty())
				M.push_back(v);
		}
		
		
	}

	
	return 0;


}

void parse_cmd_line(const deque<wstring>& params, deque<FileNamePair>& files, wstring& header_file) {
  CHECK_CMD(params.size());
  unsigned idx = 0;
  CHECK_CMD(params[idx] == L"-in");
  idx++;
  files.clear();
  FileNamePair fnp;
  while ((idx < params.size()) && (params[idx] != L"-out")) {
    fnp.in = params[idx];
    files.push_back(fnp);
    idx++;
  }
  CHECK_CMD(files.size());
  CHECK_CMD(idx != params.size());
  idx++;
  CHECK_CMD(idx != params.size());
  header_file = params[idx];
  idx++;
  for (unsigned i = 0; i < files.size(); i++) {
    CHECK_CMD(idx != params.size());
    files[i].out = params[idx];
    idx++;
  }
}

void ELAS::clear_buffers() {
	esqBuffer.clear();
	esqBufferRejeitados.clear();
	dirBuffer.clear();
	dirBufferRejeitados.clear();
}

int main(){
	int width;
	int indexinfo=-1;
	int indexans=0;
	int j;

	while(1){
		scanf("%d",&width);
		printf("%d\n",width);
		if(width==0)
			break;
		indexinfo=-1;
		indexans=0;
		pr tmp;

		int nowpos=width;

		tmp.first=0;tmp.second=width;
		zero.clear();zero.push_back(tmp);

		while(1){
			scanf("%d%d",&p1,&p2);
			if(p1==p2&&p2==0)
				break;

			while(p2!=0){
				if(nowpos==width){
					nowpos=0;
					indexinfo++;
					info[indexinfo].floors=p2/width;
					info[indexinfo].list.clear();
					if(p2>=width){
						//we can store more than 1 floor in an struct info.
						tmp.first=p1;
						tmp.second=width;
						info[indexinfo].list.push_back(tmp);
						p2%=width;
						nowpos=width;
					}else{
						tmp.first=p1;
						tmp.second=p2;
						info[indexinfo].list.push_back(tmp);
						nowpos+=p2;
						p2=0;
					}
				}else{
					if(nowpos+p2>width){
						tmp.first=p1;
						tmp.second=width-nowpos;
						p2-=width-nowpos;
						nowpos=width;
						info[indexinfo].list.push_back(tmp);
					}else{
						tmp.first=p1;
						tmp.second=p2;
						nowpos+=p2;
						p2=0;
						info[indexinfo].list.push_back(tmp);
					}
				}
			}
		}//Input finished

		for(i=0;i<=indexinfo;i++){
			if(i==0)
				tmpanstop=zero;
			else{
				tmpanstop=compare1(-1,i,1);
				tmpanstop=combine(compare1(0,i,0),tmpanstop);
				tmpanstop=combine(compare1(1,i,-1),tmpanstop);
			}

			if(info[i].floors){
				tmpansmid=zero;
			}else{
				tmpansmid=compare2(i);
			}

			if(i==indexinfo)
				tmpansbot=zero;
			else{
				tmpansbot=compare1(-1,i+1,-1);
				tmpansbot=combine(compare1(0,i+1,0),tmpansbot);
				tmpansbot=combine(compare1(1,i+1,1),tmpansbot);
			}

			if(info[i].floors<=1){
				tmpansbot=combine(tmpansbot,tmpansmid);
				tmpansbot=combine(tmpansbot,tmpanstop);
				ans[indexans].floors=0;
				ans[indexans].list=tmpansbot;
				indexans++;
			}else{
				ans[indexans].floors=0;
				ans[indexans].list=tmpanstop;
				indexans++;

				if(info[i].floors>2){
					ans[indexans].floors=info[i].floors-2;
					ans[indexans].list=zero;
//.........这里部分代码省略.........

int main()
{
	int n,b,maxm,minm,minidx,maxidx;
	int a[100001];
	lli p=1;
	n = readInt();
	for(i = 0;i < n;i++)
	{
		a[i] = readInt();
	}
	for(i = 2;i <= n;i++)
	{
		//minm = INF;
		//maxm = 0;
		dmin.clear();
		dmax.clear();
		dmin.push_front(mp(a[0],0));
		dmax.push_front(mp(a[0],0));
		for(j = 1;j < i;j++)
		{
			while(!dmin.empty())
			{
				if((a[j] <= dmin.back().first)|| ((j - dmin.back().second) >= i))
				{
					dmin.pop_back();
				}
				else
				{
					break;
				}
			}
			while(!dmin.empty())
			{
				if(a[j] <= dmin.front().first ||  ((j - dmin.front().second) >= i))
				{
					dmin.pop_front();
				}
				else
				{
					break;
				}
			}
			dmin.push_front(make_pair(a[j],j));
			
			
			while(!dmax.empty())
			{
				if((a[j] >= dmax.back().first)|| ((j - dmax.back().second) >= i))
				{
					dmax.pop_back();
				}
				else
				{
					break;
				}
			}
			while(!dmax.empty())
			{
				if(a[j] >= dmax.front().first ||  ((j - dmax.front().second) >= i))
				{
					dmax.pop_front();
				}
				else
				{
					break;
				}
			}
			dmax.push_front(make_pair(a[j],j));		
		}
		p = (p*(dmax.back().first-dmin.back().first))%MOD;
		for(j = j;j < n;j++)
		{
			while(!dmin.empty())
			{
				if((a[j] <= dmin.back().first)|| ((j - dmin.back().second) >= i))
				{
					dmin.pop_back();
				}
				else
				{
					break;
				}
			}
			while(!dmin.empty())
			{
				if(a[j] <= dmin.front().first ||  ((j - dmin.front().second) >= i))
				{
					dmin.pop_front();
				}
				else
				{
					break;
				}
			}
			dmin.push_front(make_pair(a[j],j));
			
			
			while(!dmax.empty())
			{
				if((a[j] >= dmax.back().first)|| ((j - dmax.back().second) >= i))
//.........这里部分代码省略.........

 void reset(int n)
 {
     q.clear();
     maxMicroOps = n;
 }

const bigint bigint::operator=(const bigint& a){
    _digits.clear();
    for(int i=0;i<a._digits.size();i++)_digits.push_back(a._digits[i]);
    return *this;
}

void convertToDeque(const string& str, deque<unsigned int>& d){
  d.clear();
  for (string::const_iterator itr = str.begin(), endItr = str.end(); itr != endItr; itr++)
    if ((*itr) >= 48 && (*itr) <= 57)
      d.push_back((int) (*itr) - 48);
}

int main()
{
    long i=0,j=0,nsc=0,temp;
    scanf("%ld",&n);
    long N1[MAX*MAX][2]={0,-1};
    //long Ns[MAX][2];
    //long NS[51][3]={0,0,0};
    for(i=0;i<n*n;i++)
    {
      scanf("%ld", &N[i]);
      if(i/n!=i)
      {
        N1[i][0]=N[i];
        N1[i][1]=i;
       }
    }
    
    for(i=0;i<MAX;i++)
     {
        for(j=0;j<n*n;j++)
        {
            //if(j/n!=j||!(i*j))
            {
                if(N1[j][0]<N1[j+1][0])
                {
                    temp=N1[j][0];
                    N1[j][0]=N1[j+1][0];
                    N1[j+1][0]=temp;
                    
                    temp=N1[j][1];
                    N1[j][1]=N1[j+1][1];
                    N1[j+1][1]=temp;
                    
                    
                }
            }
        }
     }
     int px,py;
     for(i=0;i<MAX;i++)
     {      
            //long st=0;
            //long sm=0;
            px=N1[i][1]/n;
            py=N1[i][1]%n; 
            a.push_front(px);
            a.push_back(py);
            for(j=0;j<n;j++)
            {   if(j!=px&&j!=py)
                {
                    if(N[pos(j,px)]>N[pos(py,j)])
                    {
                        a.push_front(j);  
                    }
                    else
                    {
                        a.push_back(j);  
                    }
                }
            }
            if(b.empty()==true)
            {
                b=a;
            }
            else
            {
                if(sum(a)>sum(b))
                {
                    b=a;
                }
            }
            a.clear();
     }          
 
        
         while(b.empty()==false)
        {   
            cout<<b.front()<<" ";
            b.pop_front();
           
         }
       
    return 0;
}

			void clear() {
				list.clear();
			}

	void clear() 
	{
		logLock.lock();
		stream.clear();
		logLock.unlock();
	}

 void clear() {
     points.clear();
 }

//.........这里部分代码省略.........
	AppState* as;
	gFPS = 0;

	gLog("[World of Warcraft Studio - Editor] - Creating Menu\n");
	Menu* m = new Menu();
	as = m;

	gStates.push_back(as);

	if(glExtGetGLProcs_VertexProgram_1_0_ARB() == 0)
	{
		gLog("[World of Warcraft Studio - Editor] - Unable to load ARB Vertex Program Code\n");
		return 0;
	}
	loadWaterShader();

	bool done = false;
	t = SDL_GetTicks();
	gLog("[World of Warcraft Studio - Editor] - Entering Main Loop\n");
	while(gStates.size() > 0 && !done)
	{
		last_t = t;
		t = SDL_GetTicks();
		Uint32 dt = t - last_t;
		time += dt;
		ftime = time / 1000.0f;

		as = gStates[gStates.size()-1];

		SDL_Event event;
		while(SDL_PollEvent(&event))
		{
			if(event.type == SDL_QUIT)
				done = true;
			else if(event.type == SDL_MOUSEMOTION)
			{
				if(SDL_GetAppState()&SDL_APPMOUSEFOCUS)
					as->mousemove(&event.motion);
			}
			else if((event.type == SDL_MOUSEBUTTONDOWN || event.type == SDL_MOUSEBUTTONUP) && (SDL_GetAppState()&SDL_APPINPUTFOCUS))
			{	
				if(event.button.type == SDL_MOUSEBUTTONUP)
					as->mouseclick(&event.button);
				else if(SDL_GetAppState()&SDL_APPMOUSEFOCUS)
					as->mouseclick(&event.button);
			}
			else if(event.type == SDL_KEYDOWN || event.type == SDL_KEYUP)
			{
				if(SDL_GetAppState()&SDL_APPINPUTFOCUS)
					as->keypressed(&event.key);
			}
			else if(event.type == SDL_VIDEORESIZE)
				video.resize(event.resize.w, event.resize.h);
		}

		if(SDL_GetAppState()&SDL_APPACTIVE)
		{
			as->tick(ftime, dt / 1000.0f);
			as->display(ftime, dt / 1000.0f);
		}

		if(gPop) 
		{
			gPop = false;
			gStates.pop_back();
			delete as;
		}

		frames++;
		fcount++;
		ft += dt;
		
		if(ft >= 1000)
		{
            float fps = (float)fcount / (float)ft * 1000.0f;
			gFPS = fps;
			char buf[32];
			sprintf_s(buf, APP_TITLE " - %.2f fps", fps);
			SDL_WM_SetCaption(buf, NULL);
            ft = 0;
			fcount = 0;
		}

		video.flip();
	}
	gLog("[World of Warcraft Studio - Editor] - Exited Main Loop\n");

	deleteFonts();
	
	video.close();

	for(deque<MPQArchive*>::iterator it = archives.begin(); it != archives.end(); ++it)
        (*it)->close();
		
	archives.clear();

	gLog("\n[World of Warcraft Studio - Editor] - Exiting.\n");

	return 0;
}