#include #include #include #include #include #include<bits/stdc++.h> #include #include #include #include #include #include #include #include #include using namespace std; int main(){ list ls; list::iterator it; int n,k,p,m,x; cin>>n; ls.push_front(1); for(int i=2;i<=n;i++){ cin>>k>>p; it=find(ls.begin(),ls.end(),k); if(p==1){ advance(it,1); ls.insert(it,i); }else{ ls.insert(it,i); } } cin>>m; for(int i=1;i<=m;i++){ cin>>x; ls.remove(x); } for(it=ls.begin();it!=ls.end();it++){ cout<<*it<<" "; } return 0; }

3 条评论

  • #include <bits/stdc++.h> using namespace std;

    int main() { int n; cin >> n; int c = 0; int m = 0;

    for (int i = 0; i < n; ++i) { int s, d; cin >> s >> d;

    if (s >= 90 && s <= 140 && d >= 60 && d <= 90) {
        c++;
        if (c > m) {
            m = c;
        }
    } else {
        c = 0;
    }
    

    }

    cout << m<< endl; return 0; }

    • @ 2025-5-8 19:02:58

      #include using namespace std;

      int main() { int n; cin >> n; int current_streak = 0; int max_streak = 0;

      for (int i = 0; i < n; ++i) {
          int systolic, diastolic;
          cin >> systolic >> diastolic;
          
          if (systolic >= 90 && systolic <= 140 && diastolic >= 60 && diastolic <= 90) {
              current_streak++;
              if (current_streak > max_streak) {
                  max_streak = current_streak;
              }
          } else {
              current_streak = 0;
          }
      }
      
      cout << max_streak << endl;
      return 0;
      

      }

      • @ 2025-5-8 16:11:44

        ***不能在讨论里发题解!!!!!


        • 1

        信息

        ID
        1517
        时间
        1000ms
        内存
        256MiB
        难度
        5
        标签
        递交数
        28
        已通过
        15
        上传者