第一章（mooc课程pta题）

数据结构

1.1 最大子列和问题 (20分)

算法：二分法

#include <iostream>
//#include <bits/c++io.h>
#include <queue>
#include <stdio.h>
#include <utility>
#include <string.h>
#include <cstring>
#include <cstdio>
#include <stack>
#include <string>
#include <map>
#include <algorithm>
#include <list>
//const int INF=0x3f3f3f3f;
typedef long long ll;
using namespace std;
int k;
//二分法

int find(int a[],int lef, int rig ){

	if(lef == rig) {
		return a[lef];
	}
	int mid = (lef + rig) /2;
	double maxl = find(a,lef,mid);
	double maxr = find(a, mid + 1,rig);

	double sum =a[mid]+a[mid+1] ;
	double tem = sum;

	for(int i = mid -1;i >=lef ;i--){
		tem+=a[i];
		if(tem > sum) sum = tem;
	}tem = sum;
	for(int i = mid +2 ;i<=rig;i++)
	{
		tem +=a[i];
		if( tem > sum) sum = tem;
	}
	if( maxl > sum) sum = maxl;
	if( maxr > sum) sum = maxr;
	return sum;

}
int b[1000000]={};

int main()
{

	int k;
	cin >> k;
	for(int i =0;i < k;i++){
		cin >> b[i];
	}
	int ans = find(b,0,k-1);
	cout << ans;
	//1.3 p17

}

注意在递归之后的数值边界

for(int i = mid -1;i >=lef ;i--){
		tem+=a[i];
		if(tem > sum) sum = tem;
	}tem = sum;
	for(int i = mid +2 ;i<=rig;i++)
	{
		tem +=a[i];
		if( tem > sum) sum = tem;
	}

算法：在线搜索，是一种动态规划

#include <stdio.h>
#include <stdlib.h>//??? stblib.h
#define Maxsize 100000//MAXSIZE

int onlinesearch(int p[],int b);

int main()
{
    int b,i,j,maxadd;
    //scanf("%d",&b);
    int a[Maxsize];
    scanf("%d",&b);
    for(i=0;i<b;i++)
    scanf("%d",&a[i]);
    maxadd=onlinesearch(a,b);
    printf("%d",maxadd);
    return 0;
}

int onlinesearch(int p[],int b){
    int max=0;
    int i;
    int thissum=0;
    for(i=0;i<b;i++){
        thissum+=p[i];
        if(thissum>max)
            max=thissum;
        else if (thissum<0)//如果加上这个数是负数则跳过
            thissum=0;
    }
    return max;
}

1.2

#include <iostream>
#include <algorithm>
#define N 10005
using namespace std;
 
int main()  {
    int i,n,a[N],low=0,x=0,max=-1,sum=0,y=0,flag=0;
    scanf("%d",&n);
    for (i=0;i<n;i++)   {scanf("%d",&a[i]);}
    for (i=0;i<n;i++)   {
        sum+=a[i];
        if (sum > max)    { 
            x=i;         
            max=sum;
            low = y;          
            flag=1;
        }
        if (sum<0)  {
            sum=0;
            y=i+1;         
        }
    }
    if (flag==0)           
        printf("%d %d %d\n",0,a[0],a[n-1]);
    else
        printf("%d %d %d\n",max,a[low],a[x]);
    return 0;
}

1.8 二分题

/* 你的代码将被嵌在这里 */
Position  BinarySearch(List L, ElementType X)
{
	int mid,l = 1,r,flag = 0; 
	r=L->Last;
	while(l <= r){
		mid = (l+r)/2;
		if(L->Data[mid] > X) r = mid-1;
		else if(L->Data[mid]< X) l = mid +1;
		else {
			 return mid;
		}
	}
	  return NotFound;
}

注意点

return NotFound;
while(l <= r)
L->Data[mid] > X