好臭的样例
不做力
2350. 序列

y总保我AK！！！

祝在座的各位RP++！

#include<bits/stdc++.h>
using namespace std;
int main(){
    double a,b,c;
    cin>>a>>b;
    c=(a*3.5+b*7.5)/11;
    cout<<"MEDIA = "<<fixed<<setprecision(5)<<c;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
    double a,b;
    cin>>a;
    b=3.14159*a*a;
    cout<<"A="<<fixed<<setprecision(4)<<b;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
    int A,b,C,d;
    cin>>A>>b>>C>>d;
    cout<<"DIFERENCA = "<<(A*b)-(C*d);
}

#include<iostream>
using namespace std;
int main(){
    int a,b;
    cin>>a>>b;
    cout<<a+b;
}

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1000010;
int n;
int w[N], l[N], r[N], s[N];
int ans;
int dfs1(int u){
    if (!u) return 0;
    s[u] = dfs1(l[u]) + dfs1(r[u]) + 1;
    return s[u];
}
bool check(int a, int b){
    if (!a && !b) return true;
    if (!a || !b) return false;
    if (w[a] != w[b]) return false;
    return check(l[a], r[b]) && check(r[a], l[b]);
}
void dfs2(int u){
    if (!u) return;
    if (s[l[u]] == s[r[u]]){
        if (check(l[u], r[u]))
            ans = max(ans, s[u]);
    }
    dfs2(l[u]);
    dfs2(r[u]);
}
int main(){
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
    for (int i = 1; i <= n; i ++ ){
        scanf("%d%d", &l[i], &r[i]);
        if (l[i] == -1) l[i] = 0;
        if (r[i] == -1) r[i] = 0;
    }
    dfs1(1);  
    dfs2(1);  
    printf("%d\n", ans);
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N=605;
int n,w,t,a[N];
int f(int x)
{
    if(x<=1) x=1;
    for(int i=600;i>=0;i--)
    {
        x-=a[i];
        if(x<=0)
        {
            return i;
        }
    }
}
int main(){
    scanf("%d%d",&n,&w);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&t);
        a[t]++;
        cout<<f((int)i*w/100.0)<<" ";
    }
}