石头的摆放与被砍的树

1.石头的摆放

python版

# 石头的摆放（浪潮）
"""
算例：
5
4 1 2 5 3

2
---------
6
3 2 1 4 6 5

3
"""
n = int(input())
stones = [int(i) for i in input().split()]
if n ==0 or n ==1:
    print(0)
else:
    alist = [1 for _ in range(n)]
    for i in range(1, n):
        for j in range(i):
            if stones[i] == stones[j]+1:
                alist[i] = max(alist[j]+1, alist[i])
    print(alist)
    print(n - max(alist))

C/C++版

#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include "algorithm"

/*
算例：
5
4 1 2 5 3

2
---------
6
3 2 1 4 6 5

3
 */
void placeStone(){
    // 摆放石头排序（浪潮集团）
    int n;
    cin >> n;
    int stones[n], nums[n];
    for (int i=0;i<n;i++){
        cin >> stones[i];
        nums[i] = 1;
    }
    if (n==0 or n==1){
        cout << 0;
    }
    else
    {
        for (int i=1;i<n;i++)
        {
            for (int j=0;j<i;j++){
                if (stones[i] == stones[j]+1){
                    nums[i] = nums[i]>nums[j]+1?nums[i]:nums[j]+1;//计算两个数字最大值
                    //nums[i] = max(nums[i], nums[j]+1);
                }
            }
        }
    }
    int max=nums[0];
    for (int i=0;i<n;i++){
        if (nums[i] > max){
            max = nums[i];
            }
    }
    cout << n - max;
}

int main(int argc, char **argv){
    placeStone();
    return 0;
}

2.被砍的树

python版

"""
被砍掉的树
5
9 15 27 35 6

8 47
"""
n = int(input())
nums = [int(i) for i in input().split()]
odd = list(range(1, 100, 2))
even = list(range(2, 101, 2))
for i in range(n):
    if nums[i] in odd:
        odd.remove(nums[i])
    if nums[i] in even:
        even.remove(nums[i])

# 计算奇数组区间最大值
oddMax = 1
oddStart = odd[0]
length = 1
for i in range(1, len(odd)):
    if odd[i-1]+2 == odd[i]:
        length += 1
        oddMax = length
    else:
        oddStart = odd[i]
        length = 1
        if length > oddMax:
            oddMax = length

# 计算偶数组区间最大值
evenMax = 1
evenStart = even[0]
length = 1
for i in range(1, len(even)):
    if even[i-1]+2 == even[i]:
        length += 1
        evenMax = length
    else:
        evenStart = even[i]
        length = 1
        if length > evenMax:
            evenMax = length
if oddMax > evenMax:
    print(oddStart, oddMax)
elif oddMax == evenMax:
    if oddStart < evenStart:
        print(oddStart, oddMax)
    else:
        print(evenStart, evenMax)
else:
    print(evenStart, evenMax)

C/C++版

#include <stdio.h>

int in(int v, int n, int arr[]){
    /* 判断某个数据是否在数组中
     * v -- 判断的单个数据
     * n -- 数组长度
     * arr -- 数组
     * return -- 0：不在   1：在
     */
    //int n = sizeof(arr) / sizeof(arr[0]);
    for (int i=0; i<n; i++){
        if (arr[i] == v){
            return 1;
        }
    }
    return 0;
}

/*
被砍掉的树
5
9 15 27 35 6

8 47
 */
void cutTree(){
    //数据获取
    int n;
    scanf("%d", &n);
    int nums[n];
    int cutOdd = 0, cutEven=0;
    for (int i=0;i<n;i++){
        scanf("%d", &nums[i]);
        if (nums[i]%2==0){
            cutEven++;
        } else{
            cutOdd++;
        }
    }
    //奇数、偶数、砍树
    int odd[50-cutOdd], even[50-cutEven];
    int a=0, b=0;
    for (int i=1; i<101; i++){
        int isIn = in(i, n, nums);
        if (i % 2 == 0 && isIn == 0) {
            even[a++] = i;
        }
        else if (i % 2==1 && isIn==0){
            odd[b++] = i;
        }
    }
    //计算奇数区间最大值
    int oddMax=1, length=1, oddStart=odd[0];
    int n1 = sizeof(odd) / sizeof(odd[0]);
    for (int i=1;i<n1;i++){
        if (odd[i-1]+2==odd[i]){
            length ++;
            oddMax = length;
        } else{
            oddStart = odd[i];
            length = 1;
            if (length>oddMax) oddMax = length;
        }
    }
    //计算偶数区间最大值
    int evenMax=1, evenStart=even[0];
    length = 1;
    int n2 = sizeof(even) / sizeof(even[0]);
    for (int i=1;i<n2;i++){
        if (even[i-1]+2==even[i]){
            length ++;
            evenMax = length;
        } else{
            evenStart = even[i];
            length = 1;
            if (length>evenMax) evenMax = length;
        }
    }
    //输出结果
    if (oddMax>evenMax){
        printf("%d %d\n",oddStart, oddMax);
    } else if(oddMax==evenMax){
        if (oddStart<evenStart){
            printf("%d %d\n",oddStart, oddMax);
        } else{
            printf("%d %d\n",evenStart, evenMax);
        }
    } else{
        printf("%d %d\n",evenStart, evenMax);
    }
}

void test(){
    int r[] = {1, 2, 3, 4 , 5, 6};
    int *p;
    p = delete(4, 6, r);
    for (int i=0;i<5;i++)
    {
        printf( "*(p + %d) : %d\n", i, *(p + i));
    }
}

int main(int argc, char **argv)
{
    cutTree();
    return 0;
}