A. Bear and Colors
模拟一下就完了。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int a[5010];
int cnt[5010];
int ans[5010];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cnt[j] = 0;
}
int MAX = 0;
int maxID = 0;
for(int j=i;j<=n;j++){
cnt[a[j]]++;
if(cnt[a[j]]>MAX){
MAX = cnt[a[j]];
maxID = a[j];
}else if(cnt[a[j]] == MAX){
if(a[j]<maxID){
maxID = a[j];
}
}
ans[maxID]++;
}
}
for(int i=1;i<=n;i++){
cout<<ans[i]<<" ";
}
return 0;
}
B. Bear and Two Paths
构造题。两条路分别是ac…db和ca…bd中间以同样的顺序补。注意两种无解的情况。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int ans1[1111];
int ans2[1111];
int main(){
int n,k;
cin>>n>>k;
int a,b,c,d;
cin>>a>>b>>c>>d;
ans1[1] = a;
ans1[n] = b;
ans1[2] = c;
ans1[n-1] = d;
int cur = 1;
for(int i=3;i<=n-2;i++){
while(cur==a|| cur==b||cur==c||cur==d){
cur++;
}
ans1[i] = cur;
cur++;
}
for(int i=1;i<=n;i++){
ans2[i] = ans1[i];
}
swap(ans2[1],ans2[2]);
swap(ans2[n],ans2[n-1]);
if(k<n+1||n==4){
cout<<-1<<endl;
}else{
for(int i=1;i<=n;i++){
cout<<ans1[i]<<" ";
}
cout<<endl;
for(int i=1;i<=n;i++){
cout<<ans2[i]<<" ";
}
cout<<endl;
}
return 0;
}
C. Levels and Regions
dp。把 O(n∗n∗k) 斜率优化到 O(n∗k) 就能过,关键还是找到那个形如斜率的式子。据说可以分治,没想明白怎么搞。
#include <bits/stdc++.h>
using namespace std;
double t[200010];
long double dp[200010][2];
long double fz[200010];
long double fs[200010];
long double fmSum[200010];
long double fsSum[200010];
int que[200010];
long double calc(int x,int y){
return (fsSum[x] - fsSum[y] ) - (fmSum[x]-fmSum[y])*fz[y];
}
int pre,cur;
long double getY(int id){
return dp[id][pre]-fsSum[id]+fmSum[id]*fz[id];
}
long double getX(int id){
return fz[id];
}
int main(){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
scanf("%lf",&t[i]);
fz[i] = fz[i-1] + t[i];
fs[i] = fz[i]/t[i];
fsSum[i] = fsSum[i-1] + fs[i];
fmSum[i] = fmSum[i-1] + 1.0/t[i];
}
pre = 0;
cur = 1;
for(int i=1;i<=n;i++){
dp[i][cur] = (fsSum[i] - fsSum[0] ) - (fmSum[i]-fmSum[0])*fz[0];
}
int head = 0;
int tail = 0;
for(int j=2;j<=k;j++){
swap(pre,cur);
tail = head = 0;
que[tail++] = j-1;
for(int i=j;i<=n;i++){
while(head+1<tail && ((getY(que[head+1]) - getY(que[head]))/(getX(que[head+1])-getX(que[head])) <= fmSum[i] ) ){
head++;
}
dp[i][cur] = calc(i,que[head]) + dp[que[head]][pre];
while(head+1<tail && (getY(que[tail-1])-getY(que[tail-2])) / (getX(que[tail-1])-getX(que[tail-2]))
> (getY(i)-getY(que[tail-1]))/(getX(i)-getX(que[tail-1])) ){
tail--;
}
que[tail++] = i;
}
}
double ans = dp[n][cur];
printf("%.10f\n",ans);
return 0;
}
UPD:撸了一下分治优化的dp,也是神奇。总结一下,就是形如
dp(i)=min(dp(i),dp(j)+cost(j+1,i))
的dp,假设
dp(i)
的最优选择是从
dp(j)
转移而来,且
j
随着
#include <bits/stdc++.h>
using namespace std;
double t[200010];
long double dp[200010][2];
long double fz[200010];
long double fs[200010];
long double fmSum[200010];
long double fsSum[200010];
long double calc(int x,int y){
return (fsSum[x] - fsSum[y] ) - (fmSum[x]-fmSum[y])*fz[y];
}
int pre,cur;
void solve(int l,int r,int s,int e){
if(l>r){
return;
}
int mid = (l+r)>>1;
dp[mid][cur] = 1e99;
int pos = 0;
for(int i=s;i<=e;i++){
if(i==mid)break;
long double tmp = calc(mid,i);
if(tmp + dp[i][pre] < dp[mid][cur]){
dp[mid][cur] = tmp + dp[i][pre];
pos = i;
}
}
solve(l,mid-1,s,pos);
solve(mid+1,r,pos,e);
}
int main(){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
scanf("%lf",&t[i]);
fz[i] = fz[i-1] + t[i];
fs[i] = fz[i]/t[i];
fsSum[i] = fsSum[i-1] + fs[i];
fmSum[i] = fmSum[i-1] + 1.0/t[i];
}
pre = 0;
cur = 1;
for(int i=1;i<=n;i++){
dp[i][cur] = (fsSum[i] - fsSum[0] ) - (fmSum[i]-fmSum[0])*fz[0];
}
int head = 0;
int tail = 0;
for(int j=2;j<=k;j++){
swap(pre,cur);
solve(j,n,j-1,n);
}
double ans = dp[n][cur];
printf("%.10f\n",ans);
return 0;
}