~~垃圾~~贪心正解
1. #include<bits/stdc++.h>
1. using namespace std;
1. int main()
1. {
1. int n,a,z[5001],i,c,m;
1. c=0;
1. m=0;
1. cin>>n;
1. cin>>a;
1. for(i=1;i<=a;i++)
1. {cin>>z[i];}
1. for(i=1;i<=a;i++)
1. {
1. if(z[i]>=(n-z[i]+1))
1. {
if(n-z[i]+1>=c) c=n-1. z[i]+1;
1. }
1. else {if(z[i]>=c) c=z[i];}
1. }
1. for(i=1;i<=a;i++)
1. {
1. if(z[i]>=(n-z[i]+1))
1. {
1. if(z[i]>=m) m=z[i];
1. }
1. else {if(n-z[i]+1>=m) m=n-z[i]+1;}
1. }
1. cout<<c<<" "<<m;
1. }
by TWXZ666 @ 2019-07-29 22:56:05