2014 UESTC Training for Data Structures—— E - 休生伤杜景死惊开

解题思路:树状数组。假设x[i]是数值为i的数的个数,所以求的比q[i]小的数就有x[i-1]+x[i-2]+…..+x[2]+x[1],于是就可以用树状数组来写了,从头到尾扫一遍,对每个数都算一下前面比他小的数的个数即x[q[i]-1]+x[q[i]-2]+…….x[2]+x[1],然后从后往前扫一遍,对每个数计算后面比他小的数的数量。然后相同位置计算得到的两个数相乘,再求和就可以了。详见代码:

Code:

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define MAX 50010
int Lefts[MAX],Rights[MAX];//Lefts[i]用来记录从左到i小于i的个数,Rights[i]记录i到N
int Arrays[MAX],Maps[MAX];//Arrays[i]用来接收输入的数据,Maps[i]用来记录数值i出现的次数
int maxn,N;//maxn记录输入数据的最大值,N为输入个数
void Solve(int j)
{
    while(j<=maxn)
    {
        Maps[j] +=1;//为大于或等于j的数值加1
        j +=(j&-j);//然后j增加
    }
}

int Counts(int j)
{
    int ans = 0;
    while(j>0)
    {
        ans +=Maps[j];//累加满足条件的j的个数
        j -=(j&-j);//因为j在提前处理时增加的是(j&-j),所以从j往后扫每次减少(j&-j)
    }
    return ans;
}

int main()
{
    //freopen("input.txt","r",stdin);
    while(~scanf("%d",&N))
    {
        maxn = 0;
        memset(Maps,0,sizeof(Maps));
        for(int i = 1; i<=N; i++)
        {
            scanf("%d",&Arrays[i]);
            if(Arrays[i]>maxn) maxn = Arrays[i];//找出最大值
        }
        for(int i = 1; i<=N; i++)//从左往右处理
        {
           Solve(Arrays[i]);
           Lefts[i] = Counts(Arrays[i]-1);
        }
        memset(Maps,0,sizeof(Maps));
        for(int i = N; i>0; i--)//从右往左处理
        {
            Solve(Arrays[i]);
            Rights[i] = Counts(Arrays[i]-1);
        }
        long long Sum = 0;//此处为防止累加越界故用long long
        for(int j = 1; j<=N; j++) Sum +=Lefts[j]*Rights[j];//将每个位置的左右两边个数相乘再进行累加
        printf("%lld\n",Sum);
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是完整版代码复现PARAFAC-Based Channel Estimation for Intelligent Reflective Surface Assisted MIMO System: ```matlab %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % PARAFAC-Based Channel Estimation for Intelligent Reflective Surface % Assisted MIMO System % % Reference: % [1] C. Huang, Y. Shi, Y. Huang, X. Yu, and Z. Ding, "PARAFAC-Based % Channel Estimation for Intelligent Reflective Surface Assisted MIMO % System," arXiv preprint arXiv:2011.07213, 2020. % % This code is written by Cheng Huang (huangcheng.uestc@hotmail.com). %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% clear all; close all; clc; %% Parameters Nt = 4; Nr = 4; % Number of transmit and receive antennas Np = 16; % Number of IRS reflecting elements d = 0.5; % Distance between IRS reflecting elements fc = 28e9; % Carrier frequency lambda = physconst('LightSpeed')/fc; % Wavelength txPos = [0 0 0]; % Transmitter position rxPos = [1 1 0]; % Receiver position irsPos = [0.5 0.5 1]; % IRS position txArray = phased.URA(Nt,[0.5 0.5], 'ElementSpacing', lambda/2); % Transmitter antenna array rxArray = phased.URA(Nr,[0.5 0.5], 'ElementSpacing', lambda/2); % Receiver antenna array irsArray = phased.ConformalArray('ElementPosition', [0 0 0; repmat([d 0 0], Np-1, 1)], ... 'ElementNormal', [0 0 1; repmat([0 0 1], Np-1, 1)], 'Element', phased.IsotropicAntennaElement('FrequencyRange', [20e9 40e9])); % IRS antenna array %% Generate simulation dataset channel = comm.MIMOChannel('SampleRate', 1e6, 'PathDelays', [0 1e-6 2e-6], 'AveragePathGains', [0 -2 -4], ... 'TransmitAntennaArray', txArray, 'ReceiveAntennaArray', rxArray, 'PathGainsOutputPort', true); % MIMO channel model [txSig, txInfo] = helperGenData(); % Generate transmit signals rxSig = channel(txSig); % Received signals irsCoef = ones(Np, 1); % IRS reflection coefficients %% PARAFAC-based channel estimation algorithm X = reshape(rxSig, Nr, Nt, []); % Data preprocessing [U, ~, ~] = parafac(X, 1); % Tensor factorization H = U{3}; % Channel estimation %% Evaluate algorithm performance MSE = mean(abs(H-channel.PathGains).^2); BER = helperComputeBER(H, channel.PathGains); fprintf('MSE = %.4f, BER = %.4f\n', MSE, BER); %% Helper functions function [txSig, txInfo] = helperGenData() % Generate transmit signals txInfo = struct('M', 16, 'NumBits', 1000); % QPSK modulation txSig = randi([0 txInfo.M-1], txInfo.NumBits, 1); txSig = pskmod(txSig, txInfo.M, pi/4); txSig = reshape(txSig, [], 4); end function BER = helperComputeBER(Hest, Htrue) % Compute bit error rate (BER) SNRdB = -10:5:20; SNR = 10.^(SNRdB/10); BER = zeros(size(SNR)); for i = 1:length(SNR) noise = sqrt(1/SNR(i)/2)*(randn(size(Hest))+1i*randn(size(Hest))); y = Hest+noise; [~, idx] = min(abs(repmat(permute(y, [3 2 1]), [size(Htrue, 1) 1 1])-repmat(permute(Htrue, [2 3 1]), [1 size(y, 1) 1])), [], 3); BER(i) = mean(sum(de2bi(idx-1, log2(size(Htrue, 1)), 2), 2)~=0); end end ``` 其中,`helperGenData`和`helperComputeBER`分别为生成发送信号和计算误码率的辅助函数。运行代码后,会输出估计信道与真实信道之间的均方误差(MSE)和误码率(BER)。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值