#include <cstdio> #include <vector> #include <algorithm> const int maxn=1000000; int a[maxn]; int main() { int n; scanf("%d",&n); int max_f=1+2*n; int res=0; for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int l=0;l<n;l++) for(int r=n-1;r>=l;r--) { std::vector<int> v; for(int j=l;j<=r;j++) v.push_back(a[j]); sort(v.begin(), v.end()); int f=r-l+1; if((r-l)%2==0) f+=2*v[(r-l)/2]; else f+=v[(r-l)/2]+v[(r-l)/2+1]; if(f==max_f) res++; } printf("%d %d\n", max_f, res); return 0; }
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 | #include <cstdio> #include <vector> #include <algorithm> const int maxn=1000000; int a[maxn]; int main() { int n; scanf("%d",&n); int max_f=1+2*n; int res=0; for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int l=0;l<n;l++) for(int r=n-1;r>=l;r--) { std::vector<int> v; for(int j=l;j<=r;j++) v.push_back(a[j]); sort(v.begin(), v.end()); int f=r-l+1; if((r-l)%2==0) f+=2*v[(r-l)/2]; else f+=v[(r-l)/2]+v[(r-l)/2+1]; if(f==max_f) res++; } printf("%d %d\n", max_f, res); return 0; } |