排序
兜率工
XJTU 硕士研究生在读
展开
-
UVA 156 (map+vector)字典匹配
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<map>#include<vector>using namespace std;typedef long原创 2018-04-28 00:38:09 · 120 阅读 · 0 评论 -
POJ1318(map)字典
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<map>#include<vector>using namespace std;int main(){原创 2018-04-29 00:29:38 · 128 阅读 · 0 评论 -
POJ 1002(打表+排序)
/*由于电话号码的数字在int范围内,所以采用了查表并且采用将电话号码转换为数字进行排序。*/#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<map>#incl...原创 2018-04-29 08:33:37 · 203 阅读 · 0 评论 -
UVA 299 交换次数(冒泡)+(归并)
归并排序#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<map>#include<vector>using namespace std;int a[5原创 2018-04-29 10:04:39 · 161 阅读 · 0 评论 -
UVA 400 (UNIX ls) (字符串模拟)
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<map>#include<vector>#include<cmath>usin原创 2018-04-29 12:10:59 · 106 阅读 · 0 评论 -
UVA 10905 (Children's Game)
求拼接后数字最大 采用字符串进行处理更加方便。#include <iostream>#include <cstdio>#include <algorithm>#include<cmath>#include<string>using namespace std;bool cmp(const string& ...原创 2018-04-29 13:21:16 · 164 阅读 · 0 评论 -
POJ 1007 DNA Sorting
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<map>#include<vector>using namespace std;struct node原创 2018-04-30 01:51:58 · 103 阅读 · 0 评论 -
POJ 1094 (拓扑排序)
这道题在我看来之所以采用拓扑排序,是因为数据所构成的图中存在环,而拓扑排序正好能巧妙解决这个问题, 再谈谈这个题的思想:将两个节点构成的边存入一个图中,并且记录每一个节点的入度,进行拓扑排序: 将入度为0的节点先加入队列中,如果队列中节点数大于一,则说明存在节点无法判断其大小关系,取队首节点,并将该节点压入vector中,(因为要计算最后结果),删除队首节点,并删除与该节点相连接的节点...原创 2018-06-02 18:24:32 · 502 阅读 · 0 评论 -
归并排序(迭代)
/* 归并排序(迭代实现)*/#include<stdio.h> #include<stdlib.h> #define MAXSIZE 10 void MergeSort(int k[],int n) { int i,next,left_min,left_max,right_min,right_max; //开辟一...原创 2018-04-27 21:51:07 · 843 阅读 · 0 评论 -
POJ 2299(归并排序)计算移动次数
/* 归并排序。*/#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;typedef long long LL;const int N=500005;LL a[N],cnt,t[N],n;...原创 2018-04-27 19:07:26 · 2733 阅读 · 0 评论 -
快速排序
//快速排序。#include <iostream>#include <stdio.h>using namespace std;int n,a[101];void quicklysort(int left,int right){ int i,j,t,temp; if(left>right) return; //递归结束条件。...原创 2018-02-11 10:01:47 · 197 阅读 · 0 评论 -
堆排序
参考啊哈算法第七章第三节与快速排序一样,堆排序时间复杂度也是O(N*logN)由小到大排序:(最小堆)#include &lt;stdio.h&gt;int h[101];int n;void swap(int x,int y){ int t; t=h[x]; h[x]=h[y]; h[y]=t; return;}void sif...原创 2018-03-02 11:42:26 · 132 阅读 · 0 评论 -
UVA 630 (multimap)
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<map>#include<vector>#include<cmath>#inclu原创 2018-05-01 18:01:12 · 224 阅读 · 0 评论 -
POJ 1877(模拟)
#include<iostream>#include<cmath>#include<string.h>#include<algorithm>#include<iomanip>#include<cstdio>typedef long long ll;using namespace std;int main()...原创 2018-05-02 14:21:29 · 645 阅读 · 0 评论 -
UVA 10698 (Football Sort) (排序模拟)
#include<iostream>#include<cmath>#include<string.h>#include<algorithm>#include<iomanip>#include<cstdio>#include<string>#include<map>#inc原创 2018-05-02 20:45:02 · 233 阅读 · 0 评论 -
POJ 2379
#include<iostream>#include<map>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;struct judge{ int c; //队号 int p; //题号 ...原创 2018-04-26 20:20:05 · 211 阅读 · 0 评论 -
Codeforces Round #486 (Div. 3) B. Substrings Sort
第一次做的时候傻逼了。用了ac自动机,虽然刚开始ac了,但最后却被hack了,今天在早上醒来,看见别人写的代码,突然恍然大悟,原来这么简洁,stl就是强大,还是自己水平有限。#include<bits/stdc++.h>using namespace std;int main(){ vector<pair<int,string> > v;...原创 2018-06-02 09:26:21 · 237 阅读 · 0 评论