URAL 1105（WA中……搞不定啊！！）

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<set>
#include<map>
#include<list>
#include<queue>
#include<vector>
#define tree int o,int l,int r
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define lo o<<1
#define ro o<<1|1
#define ULL unsigned long long
#define LL long long
#define UI unsigned int
#define inf 0x3fffffff
#define eps 1e-7
#define N 10009
using namespace std;
int T,n,m,k;
int minv[N<<4],num[N<<4],ql,qr;
double t1[N],t2[N];
double x[N<<3];
double l,r,time;
double t[N];
int sub[N];
int dcmp(double x)
{
    if(fabs(x)<eps)return 0;
    return x>0?1:-1;
}
void maintain(tree)
{
    if(l==r)
        minv[o]=num[o];
    else
    {
        minv[o]=min(minv[lo],minv[ro])+num[o];
    }
}
void update(tree,int v)
{
    if(ql<=l&&qr>=r)
    {
        num[o]+=v;
    }
    else
    {
        int mid=(l+r)>>1;
        if(ql<=mid)
            update(lson,v);
        if(qr>mid)
            update(rson,v);
    }
    maintain(o,l,r);
}
int query(tree,int add)
{
    if(ql<=l&&qr>=r)
    {
        return minv[o]+add;
    }
    else
    {
        int mid=(l+r)>>1;
        int ans=inf;
        if(ql<=mid)
            ans=min(ans,query(lson,add+num[o]));
        if(qr>mid)
            ans=min(ans,query(rson,add+num[o]));
        return ans;
    }
}
void init()
{
    memset(minv,0,sizeof(minv));
    memset(num,0,sizeof(num));
}
void read()
{
    scanf("%lf%lf",&l,&r);
    scanf("%d",&n);
    m=0;
    for (int i=0; i<n; ++i )
    {
        scanf("%lf%lf",&t1[i],&t2[i]);
        x[m++]=t1[i]-1;
        x[m++]=t1[i];
        x[m++]=t1[i]+1;
        x[m++]=t2[i]-1;
        x[m++]=t2[i];
        x[m++]=t2[i]+1;
    }
    x[m++]=l;
    x[m++]=r;
    sort(x,x+m);
    m=unique(x,x+m)-x;
}
void salve()
{
    for (int i=0; i<n; ++i )
    {
        ql=lower_bound(x,x+m,t1[i])-x;
        qr=lower_bound(x,x+m,t2[i])-x-1;
        if(ql<=qr)
            update(1,0,m,1);
    }
    int top=0;
    for (int i=0; i<n; ++i )
    {
        ql=lower_bound(x,x+m,t1[i])-x;
        qr=lower_bound(x,x+m,t2[i])-x-1;
        int v=0;
        if(ql<=qr)
            v=query(1,0,m,0);

        if(v>1)
        {
            update(1,0,m,-1);
        }
        else
        {
            sub[top]=i+1;
            t[top++]=t2[i]-t1[i];
        }
    }

    double a=0.0,b=0.0;
    for(int i=0; i<top; i++)
    {
        if(i&1)
            b+=t[i];
        else
            a+=t[i];
    }
    int s[2]= {0,0};
    time=((r-l)/3.0)*2.0;
    if(dcmp(a-time)>=0)
    {
        s[0]=1;
        printf("%d\n",top-top/2);
    }
    else if(dcmp(b-time)>=0)
    {
        s[1]=1;
        printf("%d\n",top/2);
    }
    else
    {
        s[0]=1,s[1]=1;
        printf("%d\n",top);
    }
    for(int i=0; i<top; i++)
    {
        if(s[i&1])
        {
            printf("%d\n",sub[i]);
        }
    }
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("ex.in","r",stdin);
#endif
    init();
    read();
    salve();
    return 0;
}