习题3.6 一元多项式的乘法与加法运算（20 分）浙大版《数据结构（第2版）》题目集

#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
struct poly
{
    int a,b;
}r1[1000],r2[1000];
int ans[1000000],ant = 0;
int main()
{
    int a,b,flag = 0,e;
    cin>>a;
    for(int i = 0;i < a;i ++)
    {
        cin>>r1[i].a>>r1[i].b;
    }
    cin>>b;
    for(int i = 0;i < b;i ++)
    {
        cin>>r2[i].a>>r2[i].b;
    }
    map<int,int>p,q;
    for(int i = 0;i < a;i ++)
    {
        for(int k = 0;k < b;k ++)
        {
            if(p[r1[i].b + r2[k].b] == 0)ans[ant ++] = r1[i].b + r2[k].b;
            p[r1[i].b + r2[k].b] += r1[i].a*r2[k].a;
        }
    }
    e = 0;
    sort(ans,ans+ant);
    for(int i = ant - 1;i >= 0;i --)
    if(p[ans[i]])
    {
        e ++;
        if(flag)cout<<‘ ‘<<p[ans[i]]<<‘ ‘<<ans[i];
        else
        {
            cout<<p[ans[i]]<<‘ ‘<<ans[i];
            flag = 1;
        }
    }
    if(e == 0)cout<<0<<‘ ‘<<0;
    cout<<endl;
    ant = 0;
    e = 0;
    for(int i = 0;i < a;i ++)
    {
        if(q[r1[i].b] == 0)ans[ant ++] = r1[i].b;
        q[r1[i].b] += r1[i].a;
    }
    for(int i = 0;i < b;i ++)
    {
        if(q[r2[i].b] == 0)ans[ant ++] = r2[i].b;
        q[r2[i].b] += r2[i].a;
    }
    if(ant == 0)cout<<0<<‘ ‘<<0;
    sort(ans,ans+ant);
    flag = 0;
    for(int i = ant - 1;i >= 0;i --)
    if(q[ans[i]])
    {
        e ++;
        if(flag)cout<<‘ ‘<<q[ans[i]]<<‘ ‘<<ans[i];
        else
        {
            flag = 1;
            cout<<q[ans[i]]<<‘ ‘<<ans[i];
        }
    }
    if(e == 0)cout<<0<<‘ ‘<<0;
}