2017 Multi-University Training Contest

来源：互联网发布：php是什么货币单位编辑：程序博客网时间：2024/06/01 09:44

每次都是两道签到题，inversion和Classes。

        #include<iostream>        #include<algorithm>        #include<cstdio>        using namespace std;                int main(){    int T;    scanf("%d",&T);    for(int Case=1;Case<=T;Case++)    {    int n,ans=0;    scanf("%d",&n);    for(int i=1;i<=n;i++)    {    int mres=0;    int a,b,c,ab,bc,ac,abc;    cin>>a>>b>>c>>ab>>bc>>ac>>abc;    if(a-(ab+ac-abc)>=0&&b-(ab+bc-abc)>=0&&c-(ac+bc-abc)>=0    &&ab-abc>=0&&bc-abc>=0&&ac-abc>=0)        mres=a+b+c-ab-ac-bc+abc;ans=max(ans,mres);}printf("%d\n",ans);}return 0;}

        #include<iostream>        #include<algorithm>#include<cstdio>#include<vector>using namespace std;    typedef struct node    {    int v;    int pos;    bool operator < (const node te) const    {    return this->v<te.v;}}node;    vector<node> ar;int main(){    int T;    scanf("%d",&T);    for(int Case=1;Case<=T;Case++)    {    ar.clear();    int n;    scanf("%d",&n);    for(int i=1;i<=n;i++){int temp;scanf("%d",&temp);ar.push_back(node{temp,i});}sort(ar.begin(),ar.end());for(int i=2;i<=n;i++){int it=ar.size()-1;while(ar[it].pos%i==0) it--;if(i==n) printf("%d",ar[it].v);else printf("%d ",ar[it].v);}printf("\n");}return 0;}

阅读全文

0 0