75周acwing周赛打卡

最新推荐文章于 2024-08-21 18:16:36 发布

重生之我是蒟蒻

最新推荐文章于 2024-08-21 18:16:36 发布

阅读量92

点赞数

文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/qq_58750893/article/details/127603160

版权

#include <iostream>
using namespace std;
int q[110];
int main()
{
    int n;
    cin >> n;
    for(int i = 1;i <= n - 1;i ++) cin >> q[i];
    int a,b;
    cin >> a >> b;
    int isum = 0;
    for(int i = a;i <= b - 1;i ++)  isum += q[i];
    cout << isum << endl;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
string a[110];
string b[110];
vector<string> v;
int main()
{
    int n;
    cin >> n;
    for(int i = 1;i <= n;i ++)    cin >> a[i] >> b[i];
    for(int i = 1;i <= n;i ++)
    {
         if(b[i] == "rat")
        {
            v.push_back({a[i]});
        }
    }
    for(int i = 1;i <= n;i ++)
    {
          if(b[i] == "woman" || b[i] == "child")
        {
          v.push_back({a[i]});
        }
    }
    for(int i = 1;i <= n;i ++)
    {
         if(b[i] == "man")
        {
           v.push_back({a[i]});
        }
    }
    for(int i = 1;i <= n;i ++)
    {
         if(b[i] == "captain")
        {
           v.push_back({a[i]});
        }
    }
    for(int i = 0;i < v.size();i ++) cout << v[i] << endl;
    return 0;
}

#include <iostream>
#include <cstring>
using namespace std;
const int N = 5e4 + 10;
int n,r1,r2;
int f[N],f2[N];
int main()
{
    cin >> n >> r1 >> r2;
    for(int i = 1;i <= n;i ++)
    {
        if(i != r1)
        {
           cin >> f[i];
        }
    }
    memcpy(f2,f,sizeof f2);
    for(int i = r2;i >= 1;i = f[i])
    {
        int j = f[i];
        f2[j] = i;
    }
    for(int i = 1;i <= n;i ++)
    {
        if(i != r2)
        {
            cout << f2[i] << " ";
        }
    }
    return 0;
    
}