~5 new solution of CCF 2021-12-2 sequence query

Title Description

Input

Output

The sample input

Examples 1

3 10
2 5 8

Examples 2

9 10
1 2 3 4 5 6 7 8 9

Examples 3

2 10
1 3

Sample output

Examples 1

5

Examples 2

0

Examples 3

6

The subtasks

Source code

70 branch ：

#include <iostream>
#include <math.h>
using namespace std;

int main (){
    
    int  n,N;
    cin>>n>>N;

    long double *f=new long double [N+1];
    long double *g=new long double [N+1];
    long double *t=new long double [N+1];
    long double *c=new long double [N+1];

    int   rate=0;
    int   temp=0;
    int   i=0;
    int   result=0;
    int   h=0;
    int   count=0;
    int   k=0;
    f[0]=0;
    g[0]=0;
    c[0]=0;
    t[0]=0;
    for (i = 1; i <=n ; i++) {
    
        cin>>temp;
        t[i]=temp;
        c[i-1]=t[i]-t[i-1];
    }
    c[i-1]=N-t[i-1];
    rate=ceil((double )(N/(n+1)));
    for (int j = 0; j < N; j++) {
    
        g[j]= ceil((double )(j/rate));
    }

    for (int j = 0; j < N; j++) {
    
        if (c[h]!=count){
    
            count++;
        }
        else{
    
            h++;
            k++;
            count=1;
        }
        f[j]=abs(g[j]-k);
    }
    for (int j = 0; j <N ; j++) {
    
        result+=f[j];
    }
    cout<<result<<endl;
    return 0;
}

About this problem

70 branch All of them are int It's also 70 branch …