1、8.29 测试-题号 题目 杭电对应题号1001 彼岸 2569（递推）1002 Eddys picture 1162（最小生成树）1003 Sort it 2689（求逆序数）1004 Common Subsequence 1159（最长公共子序列 简单 DP）1005 Move Move Look 1295（算是递推。额，这个水了吧？）1006 Fruit 2152（母函数）1007 Wooden Sticks 1051（典型贪心，结构体排序）1008 How Many Tables 1213（简单并查集）1009 最短路 2544（最短路径，两种算法均可以过）1010 Nightmare
2、 1072（搜索，题目长了些）-HDOJ2569 ( 彼岸 ) 【递推公式】f(n)=2*f(n-1)+f(n-2)f1=3f2=9f3=21f4=51#include int main()int cas,n,i;int seq50;seq1=3;seq2=9;seq3=21;for (i=4;i#include #include #include using namespace std;const int N=10005;double lefttN,righttN;int fatherN,rN;struct pointint x,y;double value;aa10005;int cmp(
3、const int i,const int j)return aai.valueusing namespace std;int main()int arr1005;int n;while(scanf(“%d“,for(i=0;i!=n;+i)scanf(“%d“,for(i=1;i!=n;+i)for(j=0;j!=n-i;+j)if(arrjarrj+1)int temp=arrj;arrj=arrj+1;arrj+1=temp;sum+;cout#include #define INF 0x7f7f7f7f#define MAXSIZE 1010int n ;int treeMAXSIZE
4、 ;int lowbit (int x)return x void add (int pos, int val)while (pos 0)sum += treepos ;pos -= lowbit (pos) ;return sum ;int main ()int i, j ;int x, sum ;while (scanf (“%d“, sum = 0 ;for (i = 1 ; i #includeusing namespace std;int data500500;string str1,str2;int main()int i,j,n,m;while(cinstr1str2)memse
5、t(data,0,sizeof(data);n=str1.length();m=str2.length();for(i=0;idataij-1?datai-1j:dataij-1;coutusing namespace std ;int main()int n ;while(cin n)cout using namespace std;const int lmax=10000; int c1lmax+1,c2lmax+1,low10000,high10000;int main() int n,i,j,k,N,S,sh;while (cinNS)for (i=0;ilowihighi;for (
6、i=low0;iusing namespace std;struct Woodenint length;int weight;sticks5001;bool flag5001;int cmp(const void *a,const void *b)struct Wooden *c=(Wooden *)a;struct Wooden *d=(Wooden *)b;if(c-length!=d-length)return c-length-d-length;elsereturn c-weight-d-weight;int main()int T,n;int i,j;int minutes,m;ci
7、nT;while(T-)minutes=0;memset(flag,false,sizeof(flag);cinn;for(i=0;isticksi.lengthsticksi.weight;qsort(sticks,n,sizeof(sticks0),cmp);/qsort 哦for(i=0;i=m)flagj=true;m=sticksj.weight;for(i=0;i using namespace std;int parent1001;int find(int a)if(parenta0)parenta=find(parenta);return parenta0?parenta:a;void union_set(int x,int y)x=find(x);y=find(y);if(x!=y)if(parentxNM;int i=0;int a=0,b=0;for(i=0;iab;union_set(a,b);int num=0;for(i=1;i#include int set1005,s,num;void MergeSet(int a,int b)int i;s-;for (i=0;i#define MAX_N 105int mapMAX_NMAX_N;int main()/ freopen(“in.txt“,“r“,stdin);
