D - ABS:
f
[
i
]
[
0
/
1
]
f[i][0/1]
f[i][0/1]表示后手值为
a
[
i
−
1
]
a[i-1]
a[i−1]时,结果的最大/最小值是多少
直接转移即可。
code:
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int n,a[2010],f[2010][2],z,w;
int main()
{
scanf("%d %d %d",&n,&z,&w);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
a[0]=w;
for(int i=n;i>=1;i--)
{
f[i][0]=abs(a[i-1]-a[n]);
f[i][1]=abs(a[i-1]-a[n]);
for(int j=i+1;j<=n;j++)
{
f[i][0]=min(f[i][0],f[j][1]);
f[i][1]=max(f[i][1],f[j][0]);
}
}
printf("%d",f[1][1]);
}
E - MUL:
最大全闭合子图裸题
经典建图
code:
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstdlib>
#define LL long long
using namespace std;
const LL inf=1LL<<60;;
struct node{
LL y,next,c;
}a[1000010];LL len=1,last[10010];
LL h[10010],st,ed;
queue<int> q;
void ins(LL x,LL y,LL c)
{
//printf("%lld %lld %lld\n",x,y,c);
a[++len].y=y;a[len].c=c;
a[len].next=last[x];last[x]=len;
a[++len].y=x;a[len].c=0;
a[len].next=last[y];last[y]=len;
}
bool bt_h()
{
memset(h,0,sizeof(h));
h[st]=1;q.push(st);
while(!q.empty())
{
LL x=q.front();q.pop();
for(LL i=last[x];i;i=a[i].next)
{
LL y=a[i].y;
if(a[i].c&&h[y]==0) h[y]=h[x]+1,q.push(y);
}
}
return h[ed]!=0;
}
LL findflow(LL x,LL f)
{
if(x==ed) return f;
LL ans=0,t;
for(LL i=last[x];i;i=a[i].next)
{
LL y=a[i].y;
if(ans<f&&h[y]==h[x]+1&&a[i].c)
{
ans+=(t=findflow(y,min(f-ans,a[i].c)));
a[i].c-=t;a[i^1].c+=t;
}
}
if(ans==0) h[x]=0;
return ans;
}
LL n,b[110];
int main()
{
scanf("%lld",&n);
for(LL i=1;i<=n;i++) scanf("%lld",&b[i]);
LL tot=0;st=0;ed=n+1;
for(LL i=1;i<=n;i++)
{
if(b[i]>0) tot+=b[i],ins(i,ed,b[i]);
else
{
ins(st,i,-b[i]);
for(LL j=i;j<=n;j+=i) if(b[j]>0) ins(i,j,inf);
}
}
while(bt_h()) tot-=findflow(st,inf);
printf("%lld",tot);
}
F - NRE:
题解+官方题解
这个dp状态有点难想,转移也较复杂,挺好的一道题。
code:
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int inf=1<<28;
struct trnode{
int lc,rc,c;
}tr[400010];int tot=0;
struct node{
int l,r;
}c[200010];
int n,m,a[200010];
int bt(int l,int r)
{
int x=++tot;
if(l==r) tr[x].c=(l==0)?0:inf;
if(l!=r)
{
int mid=(l+r)/2;
tr[x].lc=bt(l,mid);
tr[x].rc=bt(mid+1,r);
tr[x].c=min(tr[tr[x].lc].c,tr[tr[x].rc].c);
}
return x;
}
void change(int x,int l,int r,int k,int c)
{
if(l==r) {tr[x].c=min(tr[x].c,c);return;}
int mid=(l+r)/2;
if(k<=mid) change(tr[x].lc,l,mid,k,c);
else change(tr[x].rc,mid+1,r,k,c);
tr[x].c=min(tr[tr[x].lc].c,tr[tr[x].rc].c);
}
int findans(int x,int l,int r,int fl,int fr)
{
if(fl==l&&r==fr) return tr[x].c;
int mid=(l+r)/2;
if(fr<=mid) return findans(tr[x].lc,l,mid,fl,fr);
if(fl>mid) return findans(tr[x].rc,mid+1,r,fl,fr);
return min(findans(tr[x].lc,l,mid,fl,mid),findans(tr[x].rc,mid+1,r,mid+1,fr));
}
bool cmp(node a,node b) {return a.l==b.l?a.r>b.r:a.l<b.l;}
int main()
{
scanf("%d",&n);
int ans=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
ans+=1-a[i];
}
bt(0,n);
scanf("%d",&m);
for(int i=1;i<=m;i++) scanf("%d %d",&c[i].l,&c[i].r);
sort(c+1,c+m+1,cmp);
int p=1;
for(int i=1;i<=n;i++)
{
while(c[p].l==i) change(1,0,n,c[p].r,findans(1,0,n,c[p].l-1,c[p].r)),p++;
change(1,0,n,i,findans(1,0,n,i-1,i-1)+2*a[i]-1);
}
printf("%d",ans+findans(1,0,n,n,n));
}