2021CCPC华为云挑战赛 卷业务模型分析

卷业务模型分析

题目链接

写的时候根本没有想到是最小二乘法，把高中知识全忘了，害
知道是最小二乘法后，那么|B[i]-(k*A[i]+b)|<=10，就可以等价于找到由A1与B ,A2与B所得到的两条直线的离差平方和
最小的那个，直线方程位B[i]=k*A[i]+b，常数10说实话没用，因为有他没他都a了.图一图二求的是回归方程，图三是求的离差平方和。

#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define ms(a, b) memset(a, b, sizeof(a))
#define lowbit(x) (x & -x)
#define fi first
#define se second
#define Size(a) int((a).size())
#define all(x) x.begin(), x.end()
#define ull unsigned long long
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define endl "\n"
#define bug cout << "----acac----" << endl;
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
using namespace std;
const ll mod = 1e12 + 7;
const int maxn = 1e5 + 10;
const int maxm = 5e3 + 50;
const double eps = 1e-8;
const ll inf = 0x3f3f3f3f;
const ll lnf = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);

int m;
ll a[3][maxn], b[maxn];
pair<double ,double > cal(int id)
{
    ll sum1 = 0, sum2 = 0;
    ll cnt1 = 0, cnt2 = 0;
    for (int i = 1; i <= m;i++)
    {
        sum1 += a[id][i];
        sum2 += b[i];
        cnt1 += a[id][i] * b[i];
        cnt2 += a[id][i] * a[id][i];
    } 
    double p1 = (sum1 * 1.0) / m, p2 = (sum2 * 1.0) / m; 
    double k = (cnt1 * 1.0 - m * p1 * p2) / (cnt2 - m * p1 * p1);
    double x = p2 - k * p1;
    return make_pair(k, x);
}
void sove()
{
    cin >> m;
    for (int j = 1; j <= 2; j++)
    {
        for (int i = 1; i <= m; i++)
        {
            cin >> a[j][i];
        }
    }
    for (int i = 1; i <= m;i++)
    {
        cin >> b[i];
    }
    auto t1 = cal(1), t2 = cal(2);
    double ans1 = 0, ans2 = 0;
    for (int i = 1; i <= m;i++)
    {
        ans1 += (b[i] - t1.se - t1.fi * a[1][i]) * (b[i] - t1.se - t1.fi * a[1][i]);
        ans2 += (b[i] - t2.se - t2.fi * a[2][i]) * (b[i] - t2.se - t2.fi * a[2][i]);
    }
    if(ans1-ans2>eps)
    {
        cout << "2" << endl;
    }
    else
    {
        cout << "1" << endl;
    }
}

int main()
{
    IOS;
    int T;
    cin >> T;
    while (T--)
    {
        sove();
    }
    return 0;
}