做图网站地图/谷歌chrome安卓版

已经不打了，这些东西放到草稿箱里也没啥意义了，那就发出来吧，说不定某些正在努力的同学喜欢看这种代码风格

括号匹配
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;const int maxn=100+7;
int d[maxn][maxn];
char s[maxn];int main(){while(~scanf("%s",s+1)){if(s[1]=='e')return 0;memset(d,0,sizeof d);int n=strlen(s+1);for(int len=2;len<=n;len++){for(int i=1;i<=n;i++){int j=i+len-1;if(j>n)break;if((s[i]=='('&&s[j]==')')||(s[i]=='['&&s[j]==']'))d[i][j]=d[i+1][j-1]+2;for(int k=i;k<j;k++)d[i][j]=max(d[i][j],d[i][k]+d[k+1][j]);}}printf("%d\n",d[1][n]);}return 0;
}

合并石子

#include<cstdio>
#include<algorithm>
using namespace std;const int maxn=100+7;
int a[maxn];
int d[maxn][maxn];
const int inf=0x3f3f3f3f;int main(){int n;scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);for(int i=1;i<=n;i++)a[i]=a[i-1]+a[i];for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){if(i==j)d[i][j]==0;else d[i][j]=0;}}for(int len=2;len<=n;len++){for(int i=1;i<=n;i++){int j=len-1+i;if(j>n)break;int sum=a[j]-a[i-1];for(int k=i;k<j;k++)d[i][j]=max(d[i][j],d[i][k]+d[k+1][j]+sum);}}printf("%d\n",d[1][n]);return 0;
}

矩阵链乘

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;const int maxn=100;
int d[maxn][maxn];
struct node{int x,y;
};
node a[maxn];
const int inf=0x3f3f3f3f;int main(){int n;cin>>n;for(int i=1;i<=n;i++)cin>>a[i].x>>a[i].y;for(int i=0;i<=n+10;i++){for(int j=0;j<=n+10;j++){if(i==j)d[i][j]=0;else d[i][j]=inf;}}for(int len=2;len<=n;len++){for(int i=1;i<=n;i++){int j=i+len-1;if(j>n)break;for(int k=i;k<j;k++)d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+a[i].x*a[k].y*a[j].y);}}cout<<d[1][n]<<endl;return 0;
}

穿衣服

#include<cstdio>
#include<algorithm>
using namespace std;const int maxn=100+7;
int d[maxn][maxn];
int a[maxn];
const int inf=0x3f3f3f3f;int main(){int T;scanf("%d",&T);for(int cas=1;cas<=T;cas++){for(int i=1;i<=103;i++){for(int j=1;j<=103;j++){if(i==j)d[i][j]=1;else d[i][j]=0;}}int n;scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);for(int len=2;len<=n;len++){for(int i=1;i<=n;i++){int j=i+len-1;if(j>n)break;d[i][j]=d[i][j-1]+1;for(int k=i;k<j;k++){if(a[j]==a[k])d[i][j]=min(d[i][j],d[i][k]+d[k+1][j-1]);}}}printf("Case %d: %d\n",cas,d[1][n]);}return 0;
}