摘要：
#include#include#include#include#define MAX 999999using namespace std;int temp[1010],map[1005][1005],minnum[1005];bool flag[1005];int t,n,m,p,q,a,b,c,i,j;void Dijkstra();int main(){ scanf("%d",&t); while(t--) { memset(map,MAX,sizeof(map)); memset(flag,0,sizeof(flag)); m... 阅读全文
摘要：
#include#include#include#includeusing namespace std;int temp[1010];int find(int n){ return temp[n]==n?n:temp[n]=find(temp[n]);}int main(){ int n,m,i,a,b; while(scanf("%d",&n),n) { scanf("%d",&m); for(i=0;i<=n;i++) temp[i]=i; for(i=0;i<m;i++) { ... 阅读全文
摘要：
#include#include#include#includeusing namespace std;int c[1010][1010];char a[1010],b[1010];int main(){ int n,i,j; scanf("%d",&n); while(n--) { scanf("%s%s",a,b); int len1=strlen(a),len2=strlen(b); memset(c,0,sizeof(c)); for(i=1;i=c[i-1][j]) ... 阅读全文