Duke10的博客

#include<stdio.h>#include<stdlib.h>int sort(const void *a, const void *b){ return *(int *)a - *(int *)b;}int min(int a, int b){ if (a < b) return a; else return b;}i

#include<stdio.h>struct Node{ int weight; int s; //根据s的值用来判断是否执行 int length;}a[5001];void quick_sort(struct Node *arr, int l, int r) //快速排序{ if (l < r) //进行判断，用来终止递归 {

方法1：--------------------------------------------------------------------------------#include<stdio.h>int sum; //计数void f(int *a, int w, int n){ int i = 0, j = 1, temp = 0, t, temp

方法一：（二分法）--------------------------------------------------------------------------------#include<stdio.h>#include<stdlib.h>int n, m, i, j;int sort(const void *a, const void *b){ return *(int

快速排序+贪心算法：--------------------------------------------------------------------------------#include<stdio.h>struct Node // 定义结构体，方便处理数据{ int start; //定义开始时间 int end; //定义结束时间}a[200];vo

#include<stdio.h>struct Node{ int start; int end;}a[10000];void quick_sort(struct Node *arr, int l, int r) //对结束时间进行排序{ if (l < r) //进行判断，用来终止递归 { int i = l, j = r, x

#include<stdio.h>#include<math.h>struct Node{ double start; // 横坐标 double end; //半径}a[10000];void quick_sort(struct Node *arr, int l, int r) //快速排序{ if (l < r)

#include<stdio.h>#include<math.h>void quick_sort(double s[], int l, int r){ if (l < r) { double x = s[l]; int i = l, j = r; while (i < j) { while(

#include<stdio.h>#include<string.h>#define MAX(a,b) (a > b ? a : b)int main(){ int n, v; while (~scanf("%d%d",&n, &v) && n + v != 0) { int i, j, volume, value, dp[v+1];