STL练习题

hdu_2717

//map 一对多映射，基于关键字快速查找，不允许重复值
//queue 队列 先进先出 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<map>
using namespace std;
struct node{
    int x,step;
};
int main(){
    int n,m;
    while(scanf("%d%d",&n,&m) != EOF ){
        queue<node>qu;
        map<int,int>mp;
        mp.clear();
        node ad,tmp;
        ad.x=n, ad.step=0;
        mp[ad.x]=1;
        qu.push(ad);
 while(!qu.empty()){
            tmp=qu.front();
            qu.pop();
            if(tmp.x==m) break;
            ad.x=tmp.x+1, ad.step=tmp.step+1;
            if(ad.x>=0 && ad.x<=200000 && !mp[ad.x]){
                mp[ad.x]=1;
                qu.push(ad);