单调队列的习题有:
POJ 2823 3017
hdu 3415 3474
斜率优化的习题有:
POJ 1180 3709
hdu 3507 3669 4258
//单调队列模板
struct node{
int a,b;
bool operator<(const node&oth)const
{
return a<oth.a;
}
};
struct NonIncQueue{//类似可定义NonDecQ,IncQ,DecQ
int o,p;
node a[N];
void clear() {o=0; p=1;}
void add(int newa,int newb)
{ int i=o+1;
while (newa>a[i-1].a&&i>p) i--;
a[i].a=newa; a[i].b=newb;
o=i;
}
}niq;
//斜率优化模板
typedef LL type;
struct Q{
int o,p;
int a[N];
type g(int j,int k)
{
return dp[j]-dp[k]-sum[j]+sum[k]+LL(j)*v[j+1]-LL(k)*v[k+1];
}
type s(int j,int k)
{ return v[j+1]-v[k+1];
}
bool ok(int j,int k,type t)
{
if (g(j,k)<=s(j,k)*t) return 1;
return 0;
}
void clear()
{ o=0; p=1;
}
void add(int x,type t)
{ bool flag;
o++;a[o]=x;
if (o-p>=2) flag=g(a[o-2],a[o-1])*s(a[o-1],a[o])>=g(a[o-1],a[o])*s(a[o-2],a[o-1]); else flag=0;
while (flag)
{a[o-1]=a[o]; o--;
if (o-p>=2) flag=g(a[o-2],a[o-1])*s(a[o-1],a[o])>=g(a[o-1],a[o])*s(a[o-2],a[o-1]); else flag=0;
}
if (o-p>=1) flag=ok(a[p+1],a[p],t);else flag=0;
while (flag)
{p++;
if (o-p>=1) flag=ok(a[p+1],a[p],t);else flag=0;
}
}
}q;
void doit()
{ //……
q.clear();
q.add(0,ggg(1));
for (int i=1;i<=n;i++)
{ int j=q.a[q.p];
dp[i]=dp[j]+……;
q.add(i,ggg(i+1));
}
//……
}