代码1: 用到的知识多
//#include <bits/stdc++.h> //poj中不能用这个头文件
#include<iostream>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<vector>
using namespace std;
int q[1000010];
int cow[1000010];
struct mmp
{
int x;
int y;
bool operator<(const mmp &r) const
{
return y>r.y;
}
mmp(int xx=0,int yy=0):x(xx),y(yy) {}
};
priority_queue <mmp> p;
int main()
{
int n,l,a,b,i,y,num,x;
//memset(q,127,sizeof(q));
scanf("%d %d",&n,&l);
scanf("%d %d",&a,&b);
a<<=1;
b<<=1;
for(i=1; i<=n; ++i)
{
scanf("%d %d",&x,&y);
cow[x+1]++;
cow[y]--;
}
for(i=1,num=0; i<=l; ++i)
{
q[i]=(1<<30);
num+=cow[i];
if(num>0)
cow[i]=1;
else
cow[i]=0;
}
for(i=a; i<=b; i+=2)
{
if(cow[i]==0)
{
q[i]=1;
if(i+a<=b+2)
p.push(mmp(i,1));
}
}
for(i=b+2; i<=l; i+=2)
{
if(cow[i]==0)
{
mmp z;
while(p.empty()==0)
{
z=p.top();
if(z.x<i-b)
p.pop();
else
break;
}
if(p.empty()==0)
q[i]=z.y+1;
}
if(q[i-a+2]!=(1<<30))
{
p.push(mmp(i-a+2,q[i-a+2]));
}
}
if(q[l]==(1<<30))
printf("-1\n");
else
printf("%d\n",q[l]);
return 0;
}
代码2: 这个代码的思想比较优秀,有点儿难懂,我要看好久才能看懂,,大佬的杰作
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int N,L,A,B,s,e;
int q[1000001],head,tail;
int p[1000001],t;
int f[1000001];//f[i]表示当覆盖长度为i时最少的喷灌器数目
bool l[1000001];
int main()
{
scanf("%d%d",&N,&L);
scanf("%d%d",&A,&B);
for( int i=1; i<=N; i+=1)
{
scanf("%d%d",&s,&e);
for( int j=s+1; j<=e-1; j+=1)
l[j]=true;
}
memset(f,127,sizeof(f));
t=0;
f[0]=0;
p[++t]=0;
head=1,tail=0; //这2个变量都是q数组上的
for( int i=2,h=1; i<=L; i+=2) //h,t是p数组上的
{
if(l[i]==true)
continue;
while(h<=t&&(i-p[h])>=2*A)
{
while(head<=tail&&f[q[tail]]>=f[p[h]])
tail--;
q[++tail]=p[h];
h++;
}
while(head<=tail&&(i-q[head])>2*B)
head++;
if(head<=tail)
{
f[i]=f[q[head]]+1;
p[++t]=i;
}
}
if(f[L]!=2139062143) //与之前的memset函数对应
printf("%d\n",f[L]);
else
printf("-1\n");
return 0;
}