1 条题解

  • 0
    @ 2023-6-11 12:21:11

    C++ :

    #include <bits/stdc++.h>
    using namespace std;
    int main(){
        int n,a[110],i;
        cin>>n;
        for(i = 1;i <= n;i++){
        	cin>>a[i];
    	}
    	
    	int f1 = 1;//假设递增
    	int f2 = 1;//假设递减 
    	
    	for(i = 1;i < n;i++){
    		if(a[i] > a[i+1]){
    			f1 = 0;
    		}
    		
    		if(a[i] < a[i+1]){
    			f2 = 0;
    		}
    	}
    	
    	if(f1 == 0 && f2 == 0){
    		cout<<"No";
    	}else{
    		cout<<"Good";
    	}
        return 0;
    }
    

    Java :

    
    import java.util.Scanner;
    public class Main {
        public static void main(String[] args) {
            Scanner scanner = new Scanner(System.in);
            int num1 = scanner.nextInt();
            int[] count = new int[80];
            int[] a = new int[num1];
            int[] b = new int[num1];
            int[] c = new int[num1];
            for (int i = 0; i < num1; i++) {
                c[i] = b[i] = a[i] = scanner.nextInt();
            }
            int flag1 = 0,flag2 = 2;
            paiXux(a);
            paiXud(b);
            for (int i = 0; i < num1; i++) {
                if(c[i] != a[i]){
                    flag1 = 1;
                    break;
                }
            }
            for (int i = 0; i < num1; i++) {
                if(c[i] != b[i]){
                    flag2 = 1;
                    break;
                }
            }
            if(flag1 == 0 || flag2 == 2) System.out.println("Good");
            else System.out.println("No");
    
    
    
        }public static void paiXu(int[] a,int length){
            int temp;
            for(int i = 0;i < length - 1;i++){
                for(int k = 0;k < length - i - 1;k++){
                    if(a[k] > a[k + 1]){
                        temp = a[k];
                        a[k] = a[k + 1];
                        a[k + 1] = temp;
                    }
                }
            }
        } public static void paiXud(int[] a){
            int temp;
            for(int i = 0;i < a.length - 1;i++){
                for(int k = 0;k < a.length - i - 1;k++){
                    if(a[k] < a[k + 1]){
                        temp = a[k];
                        a[k] = a[k + 1];
                        a[k + 1] = temp;
                    }
                }
            }
        } public static void paiXux(int[] a){
            int temp;
            for(int i = 0;i < a.length - 1;i++){
                for(int k = 0;k < a.length - i - 1;k++){
                    if(a[k] > a[k + 1]){
                        temp = a[k];
                        a[k] = a[k + 1];
                        a[k + 1] = temp;
                    }
                }
            }
        }
    
        public static int MAX(int[] a){
            int max = a[0];
            for (int i = 0; i < a.length; i++) {
                if(max < a[i]){
                    max = a[i];
                }
            }
            return max;
        }
    
        public static int MIN(int[] a){
            int min = a[0];
            for (int i = 0; i < a.length; i++) {
                if(min > a[i]){
                   min = a[i];
                }
            }
            return min;
        }
        public static int sum(int a){
            int x,s = 0;
            while(a != 0){
                x = a % 10;
                s = s + x;
                a /= 10;
            }
            return s;
        }
        public static boolean isPrime(int a){
            if(a <= 1)return false;
            else
            for(int i = 2;i <= Math.sqrt(a);i++){
                if(a % i == 0)return false;
            }return true;
        }
    
        public static long qiuYu(long i){
            long a;
            a = i % 10;
            return a;
        }
    }
    
    

    Python :

    n=int(input())
    a=list(map(int,input().split()))
    b=sorted(a)
    c=[]
    for i in range(n-1,-1,-1):
        c.append(b[i])
    if (a==b or  c==a):
        print("Good")
    else:
        print("No")
    
    • 1

    信息

    ID
    2692
    时间
    1000ms
    内存
    64MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者