数组与排序 LESSON 1

向量点积计算

#include <iostream>
using namespace std;
const int N = 1010;
int n;
int ans = 0;
int a[N],b[N];

int main(){
    cin >> n;
    for(int i = 1;i <= n; i++)
        cin >> a[i];
    for(int i = 1;i<=n;i++){
        cin >> b[i];
        
    ans += a[i]*b[i];
    }
    
    cout<< ans;
    
    
    return 0;
}

数组逆序重存放

#include <iostream>  
using namespace std; 

int n;
int a[110];  // array 相同数据类型的集合

int main(){
	
    // a[0] a[1] a[2]
	cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    
    for(int i = n; i >= 1; i--)
        cout << a[i] << " ";
	
	return 0;
}

有趣的跳跃

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 3010;
int n;
int a[N],b[N];
int main(){
    cin>> n;
    for(int i = 1;i<=n;i++)
    {
        cin>> a[i];
        if(i>1)
            b[i-1] = abs(a[i] - a[i-1]);
      }
    sort(b+1, b+n);
        
        for(int i = 1; i<n;i++)
        {
            if(b[i]!=i){
                cout<<"Not jolly";
            return 0;
            }
                
        }
    cout<< "Jolly";
                         
    return 0;
}

谁在正中间（奶牛）

#include<iostream>
#include<algorithm>
using namespace std;

const int N = 10001;
int n;
int a[N];

int main(){
    cin >> n;
    for(int i = 1;i<=n;i++)
        cin >> a[i];
    sort(a+1 , a+n+1);
    cout << a[(n+1)/2] <<endl;
    
        
    
    return 0;
}