HDU4302(map的用法)

来源：互联网发布：python字典转换为列表编辑：程序博客网时间：2024/06/05 20:52
题目：Holedox Eating
#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <map>using namespace std;const int oo=1000000;int main(){    map<int,int>mymap;    int t,l,n,co,a,b,ca=0;    map<int,int>::iterator it1,it2;    scanf("%d",&t);    while(t--)    {        mymap.clear();        mymap[oo]=1,mymap[-oo]=1;        scanf("%d%d",&l,&n);        co=0;        int ans=0,dir;        while(n--)        {            scanf("%d",&a);            if(a)            {                it1=mymap.lower_bound(co);                if(it1->first==co)                {                    it1->second--;                    if(it1->second==0) mymap.erase(it1);                }                else                {                    it1--;                    it2=mymap.upper_bound(co);                    if(it1->first==-oo&&it2->first==oo) continue;                    if(co-it1->first==it2->first-co)                    {                        if(dir==1)                        {                            it2->second--;                            ans+=it2->first-co;                            co=it2->first;                            if(it2->second==0) mymap.erase(it2);                        }                        else                        {                            it1->second--;                            ans+=co-it1->first;                            co=it1->first;                            if(it1->second==0) mymap.erase(it1);                        }                    }                    else if(it2->first-co<co-it1->first)                    {                        dir=1;                        ans+=it2->first-co;                        co=it2->first;                        it2->second--;                        if(it2->second==0) mymap.erase(it2);                    }                    else                    {                        dir=0;                        ans+=co-it1->first;                        co=it1->first;                        it1->second--;                        if(it1->second==0) mymap.erase(it1);                    }                }            }            else            {                scanf("%d",&b);                mymap[b]++;            }        }        printf("Case %d: %d\n",++ca,ans);    }    return 0;}