TRONGCAY Trồng cây

Điểm: 3,00 (OI)

Giới hạn thời gian: 1.0s

Giới hạn bộ nhớ: 1G

Input: stdin

Output: stdout

Dạng bài

Ngôn ngữ cho phép

C, C#, C++, Java, Javascript, Kotlin, Pascal, PyPy, Python, Scratch

Sample Input 1

5 2
7 3 4 2 6

Sample Output 1

Tạo trang chấm online

https://www.chuyentin.pro/2024/11/tao-trang-cham-online-rieng-cho-giao.html

Bình luận

-1

dona16cuong_dnq

đã bình luận lúc 20, Tháng 7, 2025, 15:20

Online Python - IDE, Editor, Compiler, Interpreter

def sum(a, b): return (a + b)

a = int(input('Enter 1st number: ')) b = int(input('Enter 2nd number: '))

print(f'Sum of {a} and {b} is {sum(a, b)}')

-1

hoangthaiha_026

đã bình luận lúc 22, Tháng 2, 2025, 15:03

include <iostream>

include <vector>

include <algorithm>

include <cmath>

using namespace std;

int calculatedifference(const vector<int>& arrangement, int k, int ak) { int totaldifference = 0; int prev_height;

// Handle trees before position k
for (int i = k - 1; i >= 0; --i) {
    if (i == k - 1) {
        prev_height = ak;
    } else {
        prev_height = arrangement[i];
    }
    total_difference += abs(arrangement[i] - prev_height);
}

// Handle trees after position k
for (int i = k; i < arrangement.size(); ++i) {
    if (i == k) {
        prev_height = ak;
    } else {
        prev_height = arrangement[i - 1];
    }
    total_difference += abs(arrangement[i] - prev_height);
}

return total_difference;

}

int main() { int n, k; cin >> n >> k; k--; // Adjust k to be 0-indexed

vector<int> a(n);
for (int i = 0; i < n; ++i) {
    cin >> a[i];
}

vector<int> remaining_trees;
int ak = a[k];
for (int i = 0; i < n; ++i) {
    if (i != k) {
        remaining_trees.push_back(a[i]);
    }
}

sort(remaining_trees.begin(), remaining_trees.end()); // Start with sorted order
int min_difference = -1;

do {
    int current_difference = calculate_difference(remaining_trees, k, ak);
    if (min_difference == -1 || current_difference < min_difference) {
        min_difference = current_difference;
    }
} while (next_permutation(remaining_trees.begin(), remaining_trees.end()));

cout << min_difference << endl;

return 0;

}

-2

baocan2014

đã bình luận lúc 8, Tháng 1, 2025, 12:21

aio