UVA_11942_Lumberjack_Sequencing

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char** argv) {
    int t,i,desc,ver,asc;
    scanf("%d",&t);
    printf("Lumberjacks:\n");
    while(t--){
        desc=0;ver=0;
        int sequence[11];
        for(i=0;i<10;i++){
           scanf("%d",&sequence[i]);
        }

        if(sequence[0]<sequence[1]){
            asc=1;
            for(i=1;i<9;i++){
                if(sequence[i+1]<sequence[i]){
                    ver=1;
                }
            }
        }
        if(sequence[1]<sequence[0]){
             desc=1;
            for(i=1;i<9;i++){
                if(sequence[i]<sequence[i+1]){
                    ver=1;
                }
            }
        }

        if(asc && !ver){  printf("Ordered\n");
        } else if(desc && !ver) {  printf("Ordered\n");
        }else{
            printf("Unordered\n");
        }
    }

    return (EXIT_SUCCESS);
}