![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
排序 枚举 递归 分治 贪心 模拟
zhenggy_
爱生活,爱编程
展开
-
hdu 1263 水果
#include #include #include #include #include using namespace std;typedef map > mapp;int main(){ int t, n, i, k; string fruit, place; mapp a; mapp::iterator ite; map::ite原创 2015-03-08 11:14:25 · 679 阅读 · 0 评论 -
快速排序详解
import java.util.Scanner; public class Main{ public static void main(String[] args){ int n = (int)(Math.random() * 100); int a[] = new int [n]; for(int i=0; i<n; i++){ a[i原创 2016-03-10 13:01:51 · 518 阅读 · 0 评论 -
归并排序详解
public class MergeSort { public static void main(String[] args){ debug(); } public static void debug(){ int n = (int)(Math.random() * 100); int a[] = new int [n]; for(int i=0; i<n; i原创 2016-03-11 11:32:42 · 667 阅读 · 0 评论 -
堆排序详解
public class HeapSort { public static void main(String[] args) { int n = (int)(Math.random()*100); int a[] = new int[n]; for(int i=0; i<n; i++){ a[i] = (int)(Math.random()*200); } he原创 2016-03-13 16:36:00 · 449 阅读 · 0 评论 -
UVA 11292 Dragon of Loowater
#include #include using namespace std;#define MAX 25000int main(){ int n, m, i, j, val; int q[MAX], l[MAX]; while(scanf("%d%d", &n, &m) != -1 && n && m) { val = 0;原创 2015-02-27 11:53:41 · 460 阅读 · 0 评论 -
6.1.1卡片游戏
#include #include using namespace std;queue q;int main(){ int i, n, a; scanf("%d", &n); for(i=1; i<=n; i++) q.push(i); while(q.size() >= 2) { printf("%d ", q.fro原创 2014-12-07 16:15:42 · 533 阅读 · 0 评论 -
Product //大数相乘
#include #include #define N 1000void yiwei(char *ch, int a);void add(char *ch1, char *ch2);void rev(char *ch);int main(){ char ch1[N], ch2[N], ch3[N], ch4[N]; int i, j, k; while(sca原创 2014-12-07 15:24:11 · 486 阅读 · 0 评论 -
hdu 1075 What Are You Talking About
#include #include #include #include using namespace std;int main(){ mapth; string a, b; string::size_type i, len; map::iterator ite; getline(cin, a); th.clear(); w原创 2015-03-08 11:13:52 · 625 阅读 · 0 评论 -
5.4.2 因子和阶乘
#include #include #include void get_prime( int a[] ){ int b[105]; memset(b, 0, sizeof(b)); for(int i=2; i<=100; i++) { if(b[i]==0) { for(int j=i+i; j<=1原创 2014-12-02 20:12:20 · 521 阅读 · 0 评论 -
归并排序求逆序数模板
#include #define N 1500int num;void merge(int l, int r, int *a, int *b);int main(){int a[N], b[N];int n, i;while( scanf("%d", &n) != -1 ){num = 0;for(i=0; iscan原创 2014-11-15 17:03:19 · 693 阅读 · 0 评论 -
hdu 1029 Ignatius and the Princess IV //map的使用
#include #include #include #include using namespace std;int main(){ int n, i, k; mapa; while(scanf("%d", &n) != -1){ for(i=0; i<n; i++){ scanf("%d", &k);原创 2015-03-08 11:14:20 · 419 阅读 · 0 评论 -
UVA 11729 Commando War
#include #include using namespace std;typedef struct pp{ int bi, ji;}pp;bool cmp(pp a, pp b){ return a.ji > b.ji;}int main(){ int n, i, c=0; pp p[1500]; while(scanf("原创 2015-02-27 12:56:39 · 412 阅读 · 0 评论 -
作业调度问题
import java.util.Collections;import java.util.Comparator;import java.util.PriorityQueue;import java.util.Scanner;import java.util.Vector;public class JobScheduling2 { static class Job implements原创 2016-05-17 20:17:37 · 687 阅读 · 0 评论