https://wiki.cvbbacm.com/ 2026-04-30T04:08:52+0800 https://wiki.cvbbacm.com/ https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico text/html 2020-05-10T01:34:01+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:wangzai_milk:weekly:poj_1191&rev=1589045641&do=diff POJ 1191 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<cstdlib> using namespace std; int n,a[9][9]; int f[9][9][9][9][16],pre[9][9]; int dp(int x1,int y1,int x2,int y2,int k) { if(k==0) f[x1][y1][x2][y2][k]=(pre[x2][y2]-pre[x2][y1-1]-pre[x1-1][y2]+pre[x1-1][y1-1])*(pre[x2][y2]-pre[x2][y1-1]-pre[x1-1][y2]+pre[x1-1][y1-1]); if(x1==x2&&y1==y2)f[x1][y1][x2][y2][k]=a[x1][y1]*a[x1][y1]; if(f[x1][y1][x2][y2][k]<0x3f3f3f3f)return f[x1][y1][x2][y2][k]; for(int i=x1… text/html 2020-05-10T01:32:21+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:wangzai_milk:weekly:poj_1947&rev=1589045541&do=diff POJ 1947 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<cstdlib> #define INF 0x3f3f3f3f using namespace std; int n,p,res,head[155],cnt,f[155][155]; struct Node{int nxt,to;}Edges[155*2]; void addedge(int u,int v) { Edges[++cnt].nxt=head[u]; head[u]=cnt,Edges[cnt].to=v; } void dfs(int u) { f[u][1]=0; for(int i=head[u];~i;i=Edges[i].nxt) { int v=Edges[i].to; if(f[v][1]!=INF)continue; dfs(v); for(int j=p;j;j--) { f[u][j]=f[u][j]… text/html 2020-05-10T01:33:07+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:wangzai_milk:weekly:poj_2057&rev=1589045587&do=diff POJ 2057 不太聪明的版本 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<cstdlib> #define INF 0x3f3f3f3f using namespace std; int n,f[1005],sz[1005],head[1005],mxlen[1005],cnt; bool worm[1005]; struct Node{int nxt,to;}Edges[1005*2]; void addedge(int u,int v) { Edges[++cnt].nxt=head[u]; head[u]=cnt,Edges[cnt].to=v; } int dfs(int u) { if(head[u]==-1){sz[u]=1;return f[u];} if(f[u])return f[u]; int son[8],top=0,p[8]={0,1,2,3,4,5,6,7}; for(int i=hea… text/html 2020-05-10T01:33:31+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:wangzai_milk:weekly:poj_2411&rev=1589045611&do=diff POJ 2411 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<cstdlib> using namespace std; int h,w; long long f[12][(1<<12)]; int read() { int x=0,f=1;char c=getchar(); while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();} while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();} return x*f; } int main() { h=read(),w=read(); while(h&&w) { if((h*w)%2){puts("0"),h=read(),w=read();continue;} memset(f,0,sizeof(f)); if(!h&&!w)break; for(int i=1;i<=h;i++) { for(int j… text/html 2020-05-10T01:32:37+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:wangzai_milk:weekly:poj_2486&rev=1589045557&do=diff POJ 2486 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<cstdlib> #define INF 0x3f3f3f3f using namespace std; int res,n,k,f[105][205][2],head[105],cnt,w[105],pa[105]; struct Node{int nxt,to;}Edges[105*2]; void addedge(int u,int v) { Edges[++cnt].nxt=head[u]; head[u]=cnt,Edges[cnt].to=v; } void dfs(int u) { f[u][0][0]=f[u][0][1]=w[u]; for(int i=head[u];~i;i=Edges[i].nxt) { int v=Edges[i].to; if(pa[u]==v)continue; pa[v]=u,dfs(v); fo… text/html 2020-05-10T01:33:42+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:wangzai_milk:weekly:poj_2948&rev=1589045622&do=diff POJ 2948 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<cstdlib> using namespace std; int n,m,dp[505][505],prea[505][505],preb[505][505]; int main() { while(~scanf("%d%d",&n,&m)) { if(!n&&!m)return 0; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { scanf("%d",&prea[i][j]); prea[i][j]+=prea[i][j-1]+prea[i-1][j]-prea[i-1][j-1]; } for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { scanf("%d",&preb[i][j]); preb[i][j]+=preb[i][j-1]+preb[i-1][j]… text/html 2020-05-10T01:33:22+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:wangzai_milk:weekly:poj_3034&rev=1589045602&do=diff POJ 3034 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<cstdlib> using namespace std; int read() { int x=0,f=1;char c=getchar(); while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();} while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();} return x*f; } int n,d,m,f[11][40][40]; bool mp[11][40][40]; int gcd(int a,int b){return b?gcd(b,a%b):a;} int main() { while(~scanf("%d%d%d",&n,&d,&m)) { if(!n&&!d&&!m)break; int ans=0; memset(mp,0,sizeof(mp)); memset(f,0,size… text/html 2020-05-10T01:33:50+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:wangzai_milk:weekly:poj_3280&rev=1589045630&do=diff POJ 3280 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<cstdlib> using namespace std; int n,m,ad[26],de[26],f[2005][2005]; char s[2005]; int main() { while(~scanf("%d%d",&n,&m)) { scanf("%s",s); for(int i=1;i<=n;i++) { char c; scanf(" %c",&c); scanf("%d%d",&ad[c-'a'],&de[c-'a']); } for(int k=1;k<=m;k++) { for(int i=0;i<m;i++) { int j=i+k-1; if(k==1)f[i][j]=0; else { f[i][j]=min(f[i+1][j]+de[s[i]-'a'],f[i][j-1]+de…