顺序表应用6：有序顺序表查询

这道题目就是一个查找顺序表中一个元素的题目，但是题目中给出的数据量已经达到了100000，而且查询次数最大也到了100000，
如果是遍历顺序表的话，就会超时，注意到题目中给的是一组有顺序的数据，所以可以采用二分查找的方法，时间明显缩短，就不
会出现超时的情况。\

#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
#define maxsize 100001
typedef struct
{
    int *elem;
    int listsize;
    int length;
}Lis;
void creat(Lis &L,int len)
{
    L.elem = new int[maxsize];
    L.length = len;
}
void sca(Lis &L)
{
    for(int i=0;i<L.length;i++)
        scanf("%d",&L.elem[i]);
}
//二分查找
int search(Lis &L,int s,int t,int key)
{
    int l = s,h = t,mid;
    if(s<=t)
    {
        mid = l + (h - l) / 2;
        if(L.elem[mid]==key)
            {
                return mid;
            }
        if(L.elem[mid]>key)
            return search(L,l,mid-1,key);
        else
            return search(L,mid+1,h,key);
    }
    return -1;
}
int main()
{
    Lis L;
    int n,t,m;
    scanf("%d",&n);
    creat(L,n);
    sca(L);
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&m);
        int j = search(L,0,n-1,m);
        if(j==-1)
        printf("No Found!\n");
        else
	     printf("%d\n",j+1);
    }
    return 0;
}

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAX = 50000+10;
int a[MAX],cnt,i,n,maxx;
int maxsum(int l, int r)
{
    int sum = 0;
    cnt++;
    if(l == r)
    {
        if(a[l] >= 0)sum = a[l];
        else sum = 0;
    }
    else
    {
        int mid = (l+r)/2;
        int leftsum = maxsum(l,mid);
        int rightsum = maxsum(mid+1,r);
        int s1,ss,s2;
        s1 = ss = 0;
        for(i = mid;i>=l;i--)
        {
            ss+=a[i];
            if(ss > s1)s1 = ss;
        }
        s2 = ss = 0;
        for(i = mid + 1; i<=r;i++)
        {
            ss+=a[i];
            if(ss>s2)s2 = ss;
        }
        sum = s1 + s2;
        sum = max(sum,leftsum);
        sum = max(sum,rightsum);
    }
    return sum;
}
int main()
{

    scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%d",&a[i]);
    cnt = 0;
    maxx = maxsum(0,n-1);
    printf("%d %d\n",maxx,cnt);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

void sumlist(int a[], int n)
{
    int i;
    int max = 0;
    int maxsum = 0;
    for(i=0;i<n;i++)
    {
        maxsum += a[i];
        if(maxsum < 0)
        {
            maxsum = 0;
        }
        if(maxsum > max)
        {
            max = maxsum;
        }
    }
    printf("%d\n",max);
}
int main()
{
    int n,i, a[100000];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);
    sumlist(a,n);



    return 0;
}