3/31思维+差分+完全背包

C. Fault-tolerant Network 七种情况分类讨论，写一个函数每次返回指定区间相减的最小值

#include 
#define int long long
using namespace std;
const int N=2e5+5;
const int mod=998244353;
const int inf=0x3f3f3f3f;
int a[N],b[N],n,mi=inf;
int get(int a[],int l,int r,int v)
{
    mi=inf;
    for(int i=l;i>t;
    while(t--)
    {
        cin>>n;
        for(int i=1;i>a[i];
        for(int j=1;j>b[j];
        int k1=get(b,1,n-1,a[n]);
        int k2=get(b,2,n,a[1]);

        int k3=get(a,1,n-1,b[n]);
        int k4=get(a,2,n,b[1]);

        int ans1=abs(a[1]-b[1])+abs(a[n]-b[n]);
        int ans2=abs(a[1]-b[n])+abs(a[n]-b[1]);
        int ans3=k2+k1+k3+k4;
        int ans4=abs(a[1]-b[1])+k1+k3;
        int ans5=abs(a[n]-b[n])+k2+k4;
        int ans6=abs(a[1]-b[n])+k1+k4;
        int ans7=abs(a[n]-b[1])+k2+k3;
        int mi=min(ans1,min(ans2,ans3));
        mi=min(mi,min(ans4,ans5));
        mi=min(mi,min(ans6,ans7));
        coutq;
    for(int i=1;i>a[i];
    sort(a+1,a+n+1);
    for(int i=1;i>l>>r;
        b[l]+=1;b[r+1]-=1;
    }
    for(int i=1;i=1;i--)
    {
        ans+=a[i]*sum[i];
    }
    cout