This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <bitset>
using namespace std;
const int MAXN = 11;
int a[MAXN];
int b[MAXN];
signed main(){
int n;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> a[i];
}
for(int i = 0; i < n; ++i){
cin >> b[i];
}
int ans = 0;
for(int m = 0; m < (1 << n); ++m){
bitset<MAXN> bs = m;
bs[n] = 1;
bs[0] = 1;
int cnt = 0;
for(int i = 0; i < n; ++i){
if(bs[i]){
int mx = a[i];
for(int j = i + 1; !bs[j]; ++j)
mx = max(mx, a[j]);
for(int j = i; !bs[j] || j == i; ++j){
if(mx == a[j])
++cnt;
}
}
}
ans = max(ans, cnt);
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |