rattles的专栏

//实验一：FCFS 、SJF/*    static int MaxNum=100;int  ArrivalTime[MaxNum];//到达时间    int  ServiceTime[MaxNum];//服务时间    int  FinishTime[MaxNum];//完成时间    int  WholeTime[MaxNum];//周转时间    double

//练习队列的使用#include#includeusing namespace std;struct ps{  int a;  int b;};void add(ps pb[],int n){  queueq;  for(int i=0;i    {      pb[i].a=i;      pb[i].b=i+1;      q.pu

//创建树#include#include#define MAX 100using namespace std;typedef struct node{  char data;  struct node *right,*left;}btree;void createTree(btree *&b,string s){  int top=-1;  b

//树#include#includeusing namespace std;#define MAX 100typedef struct bnode{  char data;  struct bnode *left,*right;}btree;void createTree(btree *&b,string s){  int j=0;  ch

//堆排序#include#define MAX 100using namespace std;void display(int a[],int n);void silt(int a[],int n,int m){  int t;  t=a[m];  int j=2*(m+1)-1;  //  display(a,n);  while(j    {

//还是未能成功#include#include//#include#includeusing namespace std;  char book[105];  int count=0;int input(int &count){  ifstream cin("g.in");  int m,n;  cin>>m>>n;  string cmd;

1.图论2.数据结构3.搜索4.动态规划5.模拟6.数学7.计算几何8.博弈论9.字符串＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝初期:一.基本算法:(1)枚举. (poj1753,poj2965)(2)贪心(poj1328,poj2109,poj2586)(3)递归和分治法.(4)递推.(5)

//快速排序法#includeusing namespace std;void split(int a[],int low,int high,int &i){//a[]为2 8 3 6 9 5 1 4 0 7   i=low;  int j=high;  int x=a[i];  while(i    {//目标：x=2, a[]=2 8 3 6 9 5

  //I did it!!#include#include#include#define maxSize 1020using namespace std;struct node{  double sum;  string s;};int  m,n;node array[maxSize];bool cmp(const node &a,co

//插入排序/*#include#define MAX 1010void simsort(int a[],int n){  int key;  for(int i=1;i    {      key=a[i];      int j;      for( j=i-1;j>=0;j--)    {      if(key        {

//链表//这个有问题。#include#includetypedef int datatype;typedef struct node{  datatype data;  struct node *next;}linklist;//头插入法linklist *createList(){  char ch;  linklist *head

包含文件：os2.in50 1 2 3 46 2 5 9 8 4(时间片的大小)#include#include#include#include#define MAX 100using namespace std;struct ps{  bool Finished;  char c;  int ArrivalTime;  int Serv

<br /><br />//杨辉三角<br />#include<stdio.h><br />#define MAX 1024<br />int a[MAX][MAX];<br />void yanghui(int n)<br />{<br />  for(int i=0;i<n;i++)<br />    {   <br />      a[i][0]=1;<br />      a[i][i]=1;<br />    }<br />  for(int i=

//快速排序#include#define MAX 1024int a[MAX];void init(int b[],int n){  for(int i=0;i    a[i+1]=b[i];}//4,1,2,6,2,3,5,9,0void qsort(int a[],int low,int high){  int i,j;  if(low    {      i=low;      j=high;      a[0]=a[i];  wh

<br />//旋转矩阵<br /><br />#include<stdio.h><br />#define MAX 1000<br />int a[MAX][MAX];<br /><br />int matrix(int a[MAX][MAX],int low,int size,int number)<br />{<br />  int i=low;<br />  int j=low;<br />  if(size==1) <br />    {<br />    

1010.Number TrianglesTime Limit: 1000 MS         Memory Limit: 65536 K <br />Total Submissions: 849 (377 users)         Accepted: 490 (361 users) <br />[ My Solution ]<br /> Description<br />Considerthe number triangle shown bel

#include#include#include#define MAX 1002typedef struct node{  char data;  struct node *next;struct node *prior;}dlinklist;/*void create_dlink_h(dlinklist *l){  //  dlinklis

#include#include#define MAX 20  int queen[MAX];  int count=0;  int quen[MAX];void print(int n){  //  count++;  // printf("%d/n",count);  //     if(count>2) exit(1);  int k=0;

<br />#include<stdio.h><br />#include<stdlib.h><br />#define MAX 10<br />typedef struct <br />{<br />  int  data[MAX];<br />  int front;<br />  int rear;<br />}rqueue;<br />void create_queue(rqueue *q)<br />{<br />  q->front=q->rear=0

#include#includetypedef struct node{  char data;  struct node *next;}rlinklist;void create_rlink(rlinklist *l,int n){  rlinklist *p;  for(int i=0;i    {      p=(rlinklist *)mal

<br />//汉诺塔<br />#include<stdio.h><br /><br />void move(int n,char a,char b)<br />{<br />  printf("第%d个从%c移向%c/n",n,a,b);<br />}<br />void hanoi(int n,char a,char b,char c)<br />{<br />  if(n==1) move(1,a,c);<br />  else<br />    {<br /

//线性表#include#include#include#define maxsize 1024typedef int datatype;typedef struct {  datatype data[maxsize];  int last;}sequenlist;void init(sequenlist *L){  //  L=(sequenli

//树的操作#include#include#include#define MAXN 100using namespace std;typedef struct node{  char data;  struct node *left,*right;}BTree;int create_tree(BTree *&b,string str){

//ACM程序设计/*//vector向量容器#includeusing namespace std;int main(){  vectorv;  v.push_back(2);  v.push_back(7);  v.push_back(9);  return 0;}*//*

//ACM程序设计/*//vector向量容器#includeusing namespace std;int main(){  vectorv;  v.push_back(2);  v.push_back(7);  v.push_back(9);  return 0;}*//*//用迭代器访问vector元素#include#

#include int get_text(int x) {   int a,b;   char s[10],t;   sprintf(s,"%d",x);//ת»»Îª×Ö·ûŽ®   int len=sizeof(x);   for(int i=0;i     {       for(int j=0;j     {       if(s[j]

//第四章/*//Quicksum#include#includeusing namespace std;int main(){  ifstream cin("4-1.in");  char c[256];    int n=0;  int sum=0;    while(cin.getline(c,256))    {     

//深度优先和广度优先#include#include#define Vnum 20using namespace std;typedef struct arcnode{  int adjvex;  struct arcnode *nextarc;}arcnode;typedef struct vexnode{  int vervex;  arc

/*//图#include#include#define Vnum 20using namespace std;typedef struct arcnode{  int adjvex;   //结点的编号  struct arcnode *nextarc;//指向下一结点的指针}arcnode;typedef struct vexnode{  i

回溯法horspool动态规划 

//最贵的贝壳#include#include#include#define MAXN 1020#define MAXM 120using namespace std;typedef struct{  int data[MAXN];  char cs[MAXN];}cost;int *b_table(char pat[],int p_size)

最終的結果是输入完所有的情况后，没有退出程序。。。/*//回溯法#define N 100#define M 100#includeint com_back(int m,int n){  int a[N];  int i=0;  a[i]=1;do  {     if(a[i]-i     

最終的結果是输入完所有的情况后，没有退出程序。。。/*//回溯法#define N 100#define M 100#includeint com_back(int m,int n){  int a[N];  int i=0;  a[i]=1;do  {     if(a[i]-i      {    if(i==n-1)     

//练习引用//#include//#include#include//using namespace std;void rr(int &a,int &b){  int t=0;  t=a;  a=b;  b=t;  return ;}int main(){  int m=1;  int n=2;    printf("%d

//最贵的贝壳#include#include#include#define MAXN 1020#define MAXM 120using namespace std;typedef struct{  int data[MAXN];  char cs[MAXN];}cost;int *b_table(char pat[],int p_size)

#include#include#include int n;char word[2000][10],sorted[2000][10];int cmp_char(const void* _a,const void* _b){  char *a=(char *)_a;  char *b=(char *)_b;  return *a-*b;}int cmp_

/*#includeint main(){  int a,b,c;  int t;  scanf("%d%d%d",&a,&b,&c);    if(a>=b)      {    t=a;    a=b;    b=t;      }  if(a>=c)    {      t

/*//计算n=1000的阶乘。 #include#include#define MAXN 3000int a[MAXN];int main(){  int i,j,n;  int s=0;  scanf("%d",&n);  memset(a,0,sizeof(a));  a[0]=1;  for(i=2;i    {     

/*#include//#include//#include//#includeusing namespace std;int a[5010],b[5010],c[5000];int main(){  //ifstream cin("aa.in");  int j=0,k=0;  int n;  cin>>n;  int i,maxi=0;

做了一个很粗糙的实验，比较了几种字符串匹配算法的性能。程序用-O3进行编译优化。以下为待查找的文本长度为434018字节，模式串长度为4时的典型实验结果。可以看到，horspool算法最快，表现最差的为KMP系的shift_and算法（实验结果与《柔性字符串匹配》一书中的结果一致）。strstr（C库函数）　time:743　微秒horspool: 　　time:642　微秒s