1370：最小函数值(minval)

伟大的拜线段树jjh

于 2022-10-08 11:17:24 发布

阅读量853

点赞数 2

分类专栏：队列文章标签： c++ 算法

本文链接：https://blog.csdn.net/weq2011/article/details/127204594

版权

队列专栏收录该内容

5 篇文章 0 订阅

订阅专栏

1.BUG版本1

每输入一个a[i],b[i],c[i]就计算函数值（枚举x从1~m ),再push进优先队列中(从小到大）,最后输出m次队列顶部就好了！

时间复杂度:O(n * m)

代码:

#include <bits/stdc++.h>
using namespace std;
int n,m;
struct p
{
  int a,b,c;
} f[1000001];
priority_queue<int,vector<int>,greater<int>> q;
int main()
{
  cin>>n>>m;
  for(int i = 0; i < n; i++)
  {
    cin>>f[i].a>>f[i].b>>f[i].c;
    for(int x = 1; x < m; x++)
    {
      int t = f[i].a * pow(x,2) + f[i].b * x + f[i].c;
      q.push(t);
    }
  }
  for(int i = 0; i < m; i++)
  {
    cout<<q.top()<<" ";
    q.pop();
  }
  return 0;
}

2,BUG版本二

上面大部分都是内存超限,所以要限制一下优先队列的大小,不过这里要注意,这里优先队列的规则要从greater<int>改成less<int>，因为队列在这里只能弹出大的,不能弹出小的（前m个的）,最后还要逆序输出。

时间复杂度:O(n * m)

代码:

#include <bits/stdc++.h>
using namespace std;
int n,m;
struct p
{
  short a,b,c;
} f[1000001];
int a[1000001];
priority_queue<int,vector<int>,less<int>> q;
int main()
{
  cin>>n>>m;
  for(int i = 0; i < n; i++)
  {
    scanf("%d%d%d",&f[i].a,&f[i].b,&f[i].c);
    for(int x = 1; x < m; x++)
    {
      int t = f[i].a * pow(x,2) + f[i].b * x + f[i].c;
      q.push(t);
      while(q.size() > m) q.pop();
    }
  }
  for(int i = 0; i < m; i++)
  {
    a[i] = q.top();
    q.pop();
  }
  for(int i = m - 1; i >= 0; i--) cout<<a[i]<<" ";
  return 0;
}

3.BUG版本三

后来发现可以剪枝，即在枚举x事如果q.top() < 函数值,则说明队列中的最大值都小于m了,那此时就可以直接跳出枚举x的循环了。

时间复杂度:O(n * log m)

代码:

#include <bits/stdc++.h>
using namespace std;
int n,m;
struct p
{
  short a,b,c;
} f[1000001];
int a[1000001];
priority_queue<int,vector<int>,less<int>> q;
int main()
{
  cin>>n>>m;
  for(int i = 0; i < n; i++) scanf("%d%d%d",&f[i].a,&f[i].b,&f[i].c);
  for(int i = 0; i < n; i++)
  {
    for(int x = 1; x < m; x++)
    {
      int t = f[i].a * pow(x,2) + f[i].b * x + f[i].c;
      q.push(t);
      while(q.size() > m) q.pop();
      if(q.top() < t) break;
    }
  }
  for(int i = 0; i < m; i++)
  {
    a[i] = q.top();
    q.pop();
  }
  for(int i = m - 1; i >= 0; i--) cout<<a[i]<<" ";
  return 0;
}

4.BUG版本四

看到运行错误,马上就想到会不会出现队列为空而还在取队头或弹出值,所以……

时间复杂度:O(n * log m)

代码:

#include <bits/stdc++.h>
using namespace std;
int n,m;
struct p
{
  long long a,b,c;
} f[10000001];
long long a[10000001];
priority_queue<long long,vector<long long>,less<long long>> q;
int main()
{
  cin>>n>>m;
  for(int i = 0; i < n; i++)
  {
    scanf("%d%d%d",&f[i].a,&f[i].b,&f[i].c);
    for(int x = 1; x < m; x++)
    {
      long long t = f[i].a * pow(x,2) + f[i].b * x + f[i].c;
      q.push(t);
      if(q.size() > m) q.pop();
      if(q.top() < t) break;
    }
  }
  for(int i = 0; i < m && !q.empty(); i++)
  {
    a[i] = q.top();
    q.pop();
  }
  for(int i = m - 1; i >= 0; i--) cout<<a[i]<<" ";
  return 0;
}

5,正解！

经过观察发现, 我的程序有一个地方写错了！在BUG版本一中我们分析过,x要从1~m中面积,结果我写成了！！！

时间复杂度:O(n * log m)

代码:

#include <bits/stdc++.h>
using namespace std;
int n,m;
struct p
{
  long long a,b,c;
} f[10000001];
long long a[10000001];
priority_queue<long long,vector<long long>,less<long long>> q;
int main()
{
  cin>>n>>m;
  for(int i = 0; i < n; i++)
  {
    scanf("%d%d%d",&f[i].a,&f[i].b,&f[i].c);
    for(int x = 1; x <= m; x++)
    {
      long long t = f[i].a * pow(x,2) + f[i].b * x + f[i].c;
      q.push(t);
      if(q.size() > m) q.pop();
      if(q.top() < t) break;
    }
  }
  for(int i = 0; i < m && !q.empty(); i++)
  {
    a[i] = q.top();
    q.pop();
  }
  for(int i = m - 1; i >= 0; i--) cout<<a[i]<<" ";
  return 0;
}

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!