runxinzhi.com
首页
百度搜索
priority_queue POJ 3253 Fence Repair
#include <iostream> #include <queue> using namespace std; int main(void) { priority_queue<double> q; q.push(66.6); q.push(22.2); q.push(44.4); cout << q.top() << ' '; q.pop(); cout << q.top() << endl; q.pop(); q.push(11.1); q.push(55.5); q.push(33.3); q.pop(); while (!q.empty()) { cout << q.top() << ' '; q.pop(); } cout << endl; return 0; }
http://poj.org/problem?id=3253
1、O(n^2):for+Select()
超时
#define _CRT_SECURE_NO_WARNINGS #include <iostream> using namespace std; struct Node { long long weight; unsigned int parent; unsigned int lchild; unsigned int rchild; }; Node HT[40005] = {0}; long long Sum(const int &n) { long long sum = 0; for (int i = n + 1; i <= 2 * n - 1; i++) { sum += HT[i].weight; } return sum; } void Select(const int &len, int &a, int &b) { // 在HT[1..len]中选择parent为0且weight最小的两个结点, // 其序号分别为a和b。 for (int i = 1; i <= len; i++) { if (HT[i].parent == 0) { a = i; break; } } for (int i = a + 1; i <= len; i++) { if (HT[i].parent == 0) { b = i; break; } } if (HT[a].weight > HT[b].weight) // 保持a的始终小于b的,有序 swap(a, b); for (int i = max(a, b) + 1; i <= len; i++) { if (HT[i].parent == 0) { if (HT[i].weight > HT[b].weight) continue; else if (HT[i].weight < HT[a].weight) { b = a; a = i; } else b = i; } } if ( !(HT[a].parent == 0 && HT[b].parent == 0) ) { cerr << "Error!" << endl; exit(1); } } void CreatHuffmanTree(const int &n) { // weight存放n个字符的权值(均>0),构造哈夫曼树HT, // 并求出n个字符的哈夫曼编码HC for (int i = 1; i <= n; i++) cin >> HT[i].weight; for (int i = n + 1; i <= 2 * n - 1; i++) { // 在HT[1..i-1]中选择parent为0且weight最小的两个结点, // 其序号分别为s1和s2。 int s1 = 0; int s2 = 0; Select(i - 1, s1, s2); HT[s1].parent = i; HT[s2].parent = i; HT[i].lchild = s1; HT[i].rchild = s2; HT[i].weight = HT[s1].weight + HT[s2].weight; } } int main(void) { // freopen("cin.txt", "r", stdin); int n; cin >> n; if (n <= 1) cout << 0 << endl; else { CreatHuffmanTree(n); cout << Sum(n) << endl; } return 0; }
2、选k个最小值的算法用优先队列
参考:
#include <iostream> #include <queue> using namespace std; typedef long long ll; // 便于移植 int main(void) { priority_queue< ll, vector<ll>, greater<ll> > q; int N; cin >> N; for (int i = 0; i < N; i++) { ll x; cin >> x; q.push(x); } ll cost = 0; for (;;) { ll a = q.top(); q.pop(); if (q.empty()) break; ll b = q.top(); q.pop(); cost += a + b; q.push(a + b); } cout << cost << endl; return 0; }
相关阅读:
scrapy爬虫爬取小姐姐图片(不羞涩)
scrapy爬虫登录edusrc查看漏洞列表
代码审计【根据功能点定向审计】BugFree ZSWin重装案例
645-2007协议解析
最近总结
防爆zigbee模块
物联网卡余额管理软件更新
激光+紫外催化控制器
modbus转edp协议
modbus转mqtt工具
原文地址:https://www.cnblogs.com/jjtx/p/2533474.html
最新文章
Django:视图views(二)
Django:视图views(一)
AtomicReference、AtomicStampedReference 和 AtomicMarkableReference
Flume-Spooling Directory Source 监控目录下多个新文件
Flume-Exec Source 监控单个本地文件
Flume-安装与 NetCat UDP Source 监控端口
Flume-概述
No hash for parcel CDH-XXX.parcel.torrent
CentOS7 上搭建 CDH(6.3.0)
Java-CAS 与原子类
热门文章
网络协议分层
mysql语句
控制反转依赖倒置通俗解释
jdk1.8源码阅读
OAuth2.0摘要
文件包含和文件读取漏洞代码审计
74CMS3.0储存型XSS漏洞代码审计
Leetcode学习笔记(1)
CTFHub Web题学习笔记(Web前置技能+信息泄露题解writeup)
FOFA链接爬虫爬取fofa spider
Copyright © 2020-2023
润新知