题目描述
解题思路
首先读题,题目的是要求两个多项式的和,输入有两行,分别用来表示这两个多项式,每一行的第一项K为该多项式的项数,每一项用两个值
N
i
N_i
Ni和
a
N
i
a_{N_i}
aNi来表示,即多项式可表示为
f
(
X
)
=
∑
i
=
1
K
a
N
i
X
N
i
f(X)=\sum\limits_{i=1}^K a_{N_i}X^{N_i}
f(X)=i=1∑KaNiXNi,最后输出也使用同样的方法输出。
那么理解题意之后,解答题目就很简单了,同时注意到
0
≤
N
k
<
⋯
<
N
1
≤
1000
0\le N_k <\cdots <N_1\le1000
0≤Nk<⋯<N1≤1000,那么可以利用这个性质,采用归并排序同样的思路,从前往后处理polynomialA和polynomialB数组中的元素即可
注意:可能相加的时候有些项会抵消,如下面的例子
输入:
2 1 2.0 0 0.5
2 2 2.0 0 -0.5
输出:
2 2 2.0 1 2.0
错误输出:
3 2 2.0 1 2.0 0 0.0
AC代码
#include <bits/stdc++.h>
using namespace std;
int main () {
int k_A, k_B;
pair<int, double> polynomial_A[10], polynomial_B[10], polynomial_ans[20];
scanf("%d", &k_A);
for(int i=0;i<k_A;i++) scanf("%d %lf", &polynomial_A[i].first, &polynomial_A[i].second);
scanf("%d", &k_B);
for(int i=0;i<k_B;i++) scanf("%d %lf", &polynomial_B[i].first, &polynomial_B[i].second);
int point_A=0, point_B=0, point_ans=0;
while (point_A<k_A && point_B<k_B) {
if (polynomial_A[point_A].first < polynomial_B[point_B].first) {
polynomial_ans[point_ans] = polynomial_B[point_B++];
} else if (polynomial_A[point_A].first > polynomial_B[point_B].first) {
polynomial_ans[point_ans] = polynomial_A[point_A++];
} else {
polynomial_ans[point_ans] = polynomial_A[point_A++];
polynomial_ans[point_ans].second += polynomial_B[point_B++].second;
}
if (polynomial_ans[point_ans].second != 0) point_ans++;
}
while (point_A < k_A) polynomial_ans[point_ans++] = polynomial_A[point_A++];
while (point_B < k_B) polynomial_ans[point_ans++] = polynomial_B[point_B++];
printf("%d", point_ans);
for (int i=0;i<point_ans;i++) printf(" %d %.1lf", polynomial_ans[i].first, polynomial_ans[i].second);
printf("\n");
return 0;
}