史上最复杂题解

题目传送门

#include<bits/stdc++.h>
using namespace std;
bool cmp(int x,int y){
	return x>y;
}
int main(){
	long long a[100],b[100],c[100],d[100],s1=0,s2=1,s3=0;
	for(int i=1;i<=4;i++) {cin>>a[i];b[i]=a[i];c[i]=a[i];d[i]=a[i];}
	sort(d+1,d+4+1);//增
	sort(c+1,c+4+1);//相同 
	sort(b+1,b+4+1,cmp);//减 
	int t=c[1],t2=c[1];
	for(int i=1;i<=4;i++){
		if(a[i]!=t) t=a[i];
	}
	if(t!=t2) s2=0; 
	for(int i=1;i<=4;i++){
		if(a[i]==d[i]) {s1++;}//增2 
		if(a[i]==b[i]) {s3++;}//减2 
	}
	if(s1 == 4 && s3 == 4) cout<<"Fish At Constant Depth";
	else if(s1==4 && s3!=4) cout<<"Fish Rising";
	else if(s3==4) cout<<"Fish Diving";
	else cout<<"No Fish";
	return 0;
}

#include<bits/stdc++.h> using namespace std; bool cmp(int x,int y){ return x>y; } int main(){ long long a[100],b[100],c[100],d[100],s1=0,s2=1,s3=0; for(int i=1;i<=4;i++) {cin>>a[i];b[i]=a[i];c[i]=a[i];d[i]=a[i];} sort(d+1,d+4+1);//增 sort(c+1,c+4+1);//相同 sort(b+1,b+4+1,cmp);//减 int t=c[1],t2=c[1]; for(int i=1;i<=4;i++){ if(a[i]!=t) t=a[i]; } if(t!=t2) s2=0; for(int i=1;i<=4;i++){ if(a[i]d[i]) {s1++;}//增2 if(a[i]b[i]) {s3++;}//减2 } if(s1 == 4 && s3 == 4) cout<<"Fish At Constant Depth"; else if(s14 && s3!=4) cout<<"Fish Rising"; else if(s34) cout<<"Fish Diving"; else cout<<"No Fish"; return 0; }

#include<bits/stdc++.h> using namespace std; bool cmp(int x,int y){ return x>y; } int main(){ long long a[100],b[100],c[100],d[100],s1=0,s2=1,s3=0; for(int i=1;i<=4;i++) {cin>>a[i];b[i]=a[i];c[i]=a[i];d[i]=a[i];} sort(d+1,d+4+1);//增 sort(c+1,c+4+1);//相同 sort(b+1,b+4+1,cmp);//减 int t=c[1],t2=c[1]; for(int i=1;i<=4;i++){ if(a[i]!=t) t=a[i]; } if(t!=t2) s2=0; for(int i=1;i<=4;i++){ if(a[i]d[i]) {s1++;}//增2 if(a[i]b[i]) {s3++;}//减2 } if(s1 == 4 && s3 == 4) cout<<"Fish At Constant Depth"; else if(s14 && s3!=4) cout<<"Fish Rising"; else if(s34) cout<<"Fish Diving"; else cout<<"No Fish"; return 0; }