nylg-haozi

摘要： #include#include#include#includeusing namespace std;int main(){ int a[71]={220,1184,2620,5020,6232,10744,12285,17296,66928,67095,63020,69615,79750,122368,100485,122265,141664,142310,171856,176272,196724,185368,280540,308620,356408,319550,437456,469028,503056,522405,643336,600392,609928,624184,635... 阅读全文

摘要： //我的prim算法#include#include#include#include#define MAX 0x0fffffffusing namespace std;int map[501][501],minnum[501];int prim(int n){ int sum=0,i,j; for(i=1;ia?a:min; } printf("%d\n",min+prim(v)); } return 0;}//prim算法解决 图论同学的代码#include #include #include using namespace std;#d... 阅读全文

摘要： #include#include#include#includeusing namespace std;long long a[1000010];int main(){ int t,n,i,j,sum; scanf("%d",&t); while(t--) { sum=0; scanf("%d",&n); for(i=0;ia[j+1]) { long long k=a[j]; a[j]=a[j+1]; ... 阅读全文

摘要： #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]) ... 阅读全文

摘要： #include#include#include#include#includeusing namespace std;int main(){ stack s1; int n,i,wet[50]; char a1[25],a2[25]; while(scanf("%d",&n)!=EOF) { scanf("%s%s",a1,a2); memset(wet,0,sizeof(wet)); int flag=0,temp=0; for(i=0;i<n;i++) { s1.p... 阅读全文

摘要： #include#include#include#include#include#includeusing namespace std;int main(){ int t,n,s,p,a,sum,i; scanf("%d",&t); for(i=1;i=p*3-2) sum++; if(a>=p*3-4&&a<=p*3-3&&s) { sum++; s--; } } printf("Case #%d: ... 阅读全文

摘要： #include#include#include#include#include#includeusing namespace std;int a,dp[100010],top;int find(int l,int r,int temp){ while(ldp[top]) dp[++top]=a; else dp[find(1,top,a)]=a; } printf("%d\n",top); } return 0;} 阅读全文

摘要： #include#include#include#include#include#includeusing namespace std;int a[25],dp[30];int main(){ int n,m,i,j; scanf("%d",&n); while(n--) { scanf("%d",&m); scanf("%d",&a[0]); dp[0]=1; int max=dp[0]; for(i=1;it&&a[j]>a[i]) t=dp[j]; ... 阅读全文