Uva/Uva11942.cpp at master · Dobromi/Uva · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <algorithm>
using namespace std;

bool isdesc(vector<int>& coll){
    for(int i=0;i<coll.size()-1;i++){
        if(coll[i+1]>coll[i])return false;
    }
    return true;
}

bool isasc(vector<int>& coll){
    for(int i=coll.size()-1;i>0;i--){
        if(coll[i-1]>coll[i])return false;
    }
    return true;
}

int main()
{

    int N;
    scanf("%d",&N);
    cout<<"Lumberjacks:"<<endl;
    while(N--){
        vector<int> coll;
        int inp;
        for(int i=0;i<10;i++){
            scanf("%d",&inp);
            coll.push_back(inp);
        }
        if(isdesc(coll) || isasc(coll)){
            cout<<"Ordered"<<endl;
        }
        else{
            cout<<"Unordered"<<endl;
        }
    }
    return 0;
}