今天做了几道Dp题。一道枚举,两道线性Dp,一道Dp的优化。总结如下:
1、注意数据范围,有时对答案取模时,在递推的时候仍有可能超出范围,需注意。
2、尽量用更少的维数表示状态,否则有时状态转移起来会更麻烦,能用线性的绝不用二维三维。
3、注意特殊情况的特殊处理,注意题述细节。
4、Dp的优化可以从减少决策数和减少维数方面考虑。减少决策数时可以考虑改变递推方向,减少维数时要充分利用题意。
ProblemSetter.cpp_code:
#include<iostream>
using namespace std;
const int MXN=50;
int main()
{
freopen("ProblemSetter.in","r",stdin);
freopen("ProblemSetter.out","w",stdout);
int n,i,j,k,x=0,y=0,z=0,a[MXN];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
sort(a,a+n);
for(i=0;i<n;i++)
for(k=n-1;k>=i+2;k--)
for(j=i+1;j<k;j++)
if (x+y+z==0||abs(a[i]+a[k]-2*a[j])<abs(a[x]+a[z]-2*a[y])) {
x=i;
y=j;
z=k;
}
printf("%d %d %d\n",a[x],a[y],a[z]);
return 0;
}
SegmentDisplay.pas_code:
const
MM=1000000007;
var
n,i:longint;
f:array[-6..500010] of qword;
Begin
assign(input,'SegmentDisplay.in'); reset(input);
assign(output,'SegmentDisplay.out'); rewrite(output);
readln(n);
fillchar(f,sizeof(f),0);
f[0]:=1;
for i:=1 to n do
f[i]:=(f[i-2]+f[i-3]+f[i-4]+3*f[i-5]+3*f[i-6]+f[i-7])mod MM;
if n>6 then writeln((f[n]-f[n-6]+MM)mod MM)
else if n>0 then writeln(f[n]) else writeln(0);
close(input); close(output);
end.
combination.pas_code:
const
MM=987654321;
var
f:array[0..1000] of longint;
prime,vis:array[0..1000000] of boolean;
n,i,j:longint;
a,sum:array[0..1000] of longint;
function isP(t:longint):boolean;
var i:longint;
begin
if vis[t] then exit(prime[t]);
if t<2 then exit(false);
if t=2 then exit(true);
vis[t]:=true;
for i:=2 to trunc(sqrt(t)) do
if t mod i=0 then begin
prime[t]:=false;
exit(false);
end;
prime[t]:=true;
exit(true);
end;
Begin
assign(input,'combination.in'); reset(input);
assign(output,'combination.out'); rewrite(output);
readln(n);
for i:=1 to n do begin
read(a[i]);
sum[i]:=sum[i-1]+a[i];
end;
fillchar(vis,sizeof(vis),false);
f[0]:=1;
for i:=1 to n do begin
f[i]:=0;
for j:=0 to i-1 do
if isP(sum[i]-sum[j]) then f[i]:=(f[i]+f[j])mod MM;
end;
writeln(f[n]);
close(input); close(output);
end.
service.cpp_code:
#include<iostream>
using namespace std;
const int MXL=210;
const int MXN=1010;
const int MX=10000000;
int c[MXL][MXL],s[MXN];
int f[MXL][MXL],g[MXL][MXL];
int main()
{
freopen("service.in","r",stdin);
freopen("service.out","w",stdout);
int l,n,i,j,k;
scanf("%d%d",&l,&n);
for (i=1;i<=l;++i)
for (j=1;j<=l;++j) scanf("%d",&c[i][j]);
for (i=1;i<=n;++i) scanf("%d",&s[i]);
s[0]=1;
memset(f,1,sizeof(f));
memset(g,1,sizeof(g));
f[2][3]=0;
for (i=0;i<n;++i) {
for (j=1;j<=l;++j)
for (k=j+1;k<=l;++k) if (f[j][k]<MX) {
if (j!=s[i+1] && k!=s[i+1])
g[j][k]=min(g[j][k],f[j][k]+c[s[i]][s[i+1]]);
if (s[i]!=s[i+1] && k!=s[i+1])
if (s[i]<k) g[s[i]][k]=min(g[s[i]][k],f[j][k]+c[j][s[i+1]]);
else g[k][s[i]]=min(g[k][s[i]],f[j][k]+c[j][s[i+1]]);
if (s[i]!=s[i+1] && j!=s[i+1])
if (s[i]<j) g[s[i]][j]=min(g[s[i]][j],f[j][k]+c[k][s[i+1]]);
else g[j][s[i]]=min(g[j][s[i]],f[j][k]+c[k][s[i+1]]);
}
for (j=1;j<=l;++j)
for (k=j+1;k<=l;++k) f[j][k]=g[j][k],g[j][k]=MX;
}
int ans=MX;
for (j=1;j<=l;++j)
for (k=j+1;k<=l;++k) ans=min(ans,f[j][k]);
cout<<ans<<endl;
}