codevs——1275 有鱼的声音

A ?sh-?nder is a device used by anglers to ?nd ?sh in a lake. If the ?sh-?nder ?nds a ?sh, it will sound an alarm. It uses depth readings to determine whether to sound an alarm. For our purposes, the ?sh-?nder will decide that a ?sh is swimming past if:

fish-finder是一个神奇的装置供垂钓者使用区在护理钓鱼。如果一个f-f找到了一条鱼，他会响起声音警报。它用鱼的深度来决定是否响警报。我们的目的就是要决定鱼是否通过，具体如下：

• there are four consecutive depth readings which form a strictly increasing sequence (such as 3 4 7 9) (which we will call “Fish Rising”), or

如果连续的四个深度读入是严格递增的序列，我们可以叫它 Fish Rising 。

• there are four consecutive depth readings which form a strictly decreasing sequence (such as 9 6 5 2) (which we will call “Fish Diving”), or

如果连续的四个深度读入是严格递减的序列，我们可以叫它 Fish Diving 。

• there are four consecutive depth readings which are identical (which we will call “Constant Depth”).
All other readings will be considered random noise or debris, which we will call “No Fish.”
Your task is to read a sequence of depth readings and determine if the alarm will sound.

如果连续的四个深度读入是一样的，那就是“Fish At Constant Depth”。如果都不是，就是“No Fish”。

The input will be four positive integers, representing the depth readings. Each integer will be on its own line of input.

输入会是四个正整数，代表深度读入。每个整数会占一行。

The output is one of four possibilities. If the depth readings are increasing, then the output should be Fish Rising. If the depth readings are decreasing, then the output should be Fish Diving. If the depth readings are identical, then the output should be Fish At Constant Depth. Otherwise, the output should be No Fish.

输出就是四种情况。

样例1：

30 10 20 20

样例2：

1 10 12 13

样例1：

No Fish

样例2：

Fish Rising

数据很小

活跃一下身心

代码‘：

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n=4;
int a1,a2,a3,a[5],b[5];
int read()
{
    int x=0,f=1; char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘) f=-1; ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;  ch=getchar();}
    return x*f;
}
int main()
{
    for(int i=1;i<=n;i++)
     a[i]=read(),b[i]=a[i];
    sort(b+1,b+1+n);
    for(int i=1;i<=n;i++)
    {
        if(a[i]>a[i-1]) a1++;
        if(a[i]<a[i-1]) a2++;
        if(a[i]==a[i-1]) a3++;
    }
    if(a3==n-1) {printf("Fish At Constant Depth");return 0;}
    if(a1==n) {printf("Fish Rising");return 0;}
    if(a2==n-1) {printf("Fish Diving");return 0;}
    printf("No Fish");return 0;
}