//伯乐在线编程  第一期 呼叫转移系统
#include <stdio.h>
#include <stdlib.h>
#include <string.h>typedef struct
{char szSrcNum[5];char szDstNum[5];int nStartDay;int nPeriod;
}PERSON;PERSON *p;
int nPerson;  //总人数
int nDay;  //计算天数int onHoliday(PERSON *p);  //判断是否在度假
int totalCount(); //求当天呼叫转移的总次数
int Depth();
int Calc(char *s);
int Match(char *s);int main()
{int i,n = 0;int nMax = 0; //最长的呼叫转移次数int nCount = 0; //呼叫转移总次数FILE *fp;fp = fopen("in.txt","r");if (fp == NULL){printf("FOPEN ERROR\n");return 0;}fscanf(fp,"%d",&nPerson);p = (PERSON *)malloc(nPerson * sizeof(PERSON));if (p == NULL){printf("MALLOC ERROR\n");return 0;}while (n < nPerson){fscanf(fp,"%s%s%d%d",(p+n)->szSrcNum,(p+n)->szDstNum,&(p+n)->nStartDay,&(p+n)->nPeriod);n++;}fscanf(fp,"%d",&nDay);for (i = 0; i < nPerson; i++){printf("Person %d: %s %s %d %d.\n",i,(p+i)->szSrcNum,(p+i)->szDstNum,(p+i)->nStartDay,(p+i)->nPeriod);}nCount = totalCount();nMax = Depth();printf("第 %d 天共有 %d 个呼叫转移设置\n",nDay,nCount);printf("第 %d 天最长的呼叫转移是 %d 次\n",nDay,nMax);　　free(p);return 0;
}int onHoliday(PERSON *p)
{int tmp = p->nStartDay + p->nPeriod - 1;if (p->nStartDay < nDay && tmp >= nDay) return 1;if (p->nStartDay == nDay) return 1;return -1;
}int totalCount()
{int i,nCount = 0;for (i = 0; i < nPerson; i++){if (1 == onHoliday(p+i)) nCount++;}return nCount;
}int Depth()
{  //求最大的呼叫转移次数int i,nRet,nMax = 0;for (i = 0; i < nPerson; i++){if (1 == onHoliday(p+i)){nRet = Calc((p+i)->szDstNum);}nMax = nMax > nRet ? nMax : nRet;}return nMax;
}int Calc(char *s)
{int nRet;if ((nRet = Match(s)) > 0)  {return Calc((p+nRet)->szDstNum) + 1;}else return 1 ;
}int Match(char *s)
{int i;for (i = 0; i < nPerson; i++){if (0 == strcmp((p+i)->szSrcNum,s) &&   //找到目的地址并且也在度假1 == onHoliday(p+i)){return i;}}return 0;
}

2013/6/16 16:02