【题解】LuoGu2085：最小函数值

最新推荐文章于 2022-02-10 23:57:21 发布

丰川样子小孩姐

最新推荐文章于 2022-02-10 23:57:21 发布

阅读量219

点赞数 1

分类专栏：题解 LuoGu 优先队列（堆）文章标签：题解 LuoGu 堆

本文链接：https://blog.csdn.net/ModestCoder_/article/details/108080314

版权

题解同时被 3 个专栏收录

435 篇文章

订阅专栏

LuoGu

255 篇文章

订阅专栏

优先队列（堆）

8 篇文章

订阅专栏

原题传送门
 做法跟这道题目差不多

Code：

#include <bits/stdc++.h>
#define maxn 10010
using namespace std;
struct heap{
	int x, val;
	bool operator < (const heap &x) const{ return x.val < val; }
};
priority_queue <heap> q;
int n, m, a[maxn], b[maxn], c[maxn], pos[maxn];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

int calc(int id, int x){ return a[id] * x * x + b[id] * x + c[id]; }

int main(){
	n = read(), m = read();
	for (int i = 1; i <= n; ++i){
		a[i] = read(), b[i] = read(), c[i] = read();
		q.push((heap){i, calc(i, pos[i] = 1)});
	}
	for (int i = 1; i <= m; ++i){
		heap tmp = q.top(); q.pop();
		printf("%d ", tmp.val);
		q.push((heap){tmp.x, calc(tmp.x, ++pos[tmp.x])});
	}
	return 0;
}