HUST Online Judge WebBoard
Problem 2497 >> ???
yinziyang @ 2025-12-12 20:09:32
[ Quote ] [ Edit ] [ Delete ] 1#
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
double a[n],b[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
}
double mx=0;
for(int i=0;i<n;i++){
double s1=0;
for(int j=0;j<n-i;j++){
if(a[i+j]==b[j]){
s1++;
}
}
mx=max(mx,s1);
double s2=0;
for(int j=0;j<n-i;j++){
if(a[j]==b[i+j]){
s2++;
}
}
mx=max(mx,s2);
}
double s=mx/n*100;
cout<<fixed<<setprecision(2)<<s<<"%";

return 0;
}
yinziyang @ 2025-12-12 20:49:00
[ Quote ] [ Edit ] [ Delete ] 2#
#include<bits/stdc++.h>
using namespace std;
int a[10005],b[10005],c[10005];
int main() {
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
for(int i=0;i<n-1;i++) {
for(int j=0;j<n-1-i;j++){
if(a[j]<a[j+1]||(a[j]==a[j+1]&&b[j]<b[j+1])){
swap(a[j],a[j+1]);
swap(b[j],b[j+1]);
}
}
}
int s=0;
for(int i=0;i<n;i++){
int v=b[i];
int f=-1;
for(int j=0;j<s;j++){
if(c[j]>=v){
f=j;
break;
}
}
if(f==-1){
c[s]=v;
s++;
}else{
c[f]=v;
}
}
cout<<s;

return 0;
}
yinziyang @ 2025-12-12 20:54:21
[ Quote ] [ Edit ] [ Delete ] 3#
看到的是幸运儿