练习五代码

A

#include<bits/stdc++.h>
using namespace std;
const int N=110;
int a[N][N],b[N][N];
int main(){
    int n,m,x,y;
    cin>>n>>m>>x>>y;
    int x1,y1,x2,y2;
    for(int l=1;l<=x;l++){
        cin>>x1>>y1>>x2>>y2;
        for(int i=x1;i<=x2;i++){
            for(int j=y1;j<=y2;j++){
                a[i][j]++;
                b[i][j]=l;
            }
        }
    }
    while(y--){
        cin>>x1>>y1;
        if(a[x1][y1]==0){
            cout<<"N"<<endl;
        }
        else cout<<"Y "<<a[x1][y1]<<" "<<b[x1][y1]<<endl;
    }
    return 0;
}

B

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

const int N = 10010;
int a[N];

int main() {
    int n, sum = 0;
    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 - i; j++) {
            if (a[j] > a[j + 1]) {
                sum++;
                int t = a[j];
                a[j] = a[j + 1];
                a[j + 1] = t;
            }
        }
    }
    cout << sum << endl;
    return 0;
}

C

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

const int N = 130;
int a[N][N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> a[i][j];
            a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
        }
    }
    int ma = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int x = i; x <= n; x++) {
                for (int y = j; y <= n; y++) {
                    int k =
                        a[x][y] - a[i - 1][y] - a[x][j - 1] + a[i - 1][j - 1];
                    if (k > ma) ma = k;
                }
            }
        }
    }
    cout << ma << endl;
    return 0;
}

D

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

const int N = 130;
int a[N][N];

int main() {
    char s[N], ans[N];
    int tail = 0;
    cin >> s;
    int len = strlen(s);
    for (int i = 0; i < len; i++) {
        if (s[i] == '(') {
            ans[++tail] = '(';
        } else if (s[i] == ')') {
            if (tail > 0 && ans[tail] == '(') {
                tail--;
            } else {
                cout << "NO" << endl;
                return 0;
            }
        }
    }
    if (tail == 0)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
    return 0;
}

E

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

const int N = 3000010;
int a[N],b[N],c[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int n,tail=0;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        while(tail>0){
            if(a[b[tail]]<a[i]){
                c[b[tail]]=i;
                tail--;
            }else{
                break;
            }
        }
        b[++tail]=i;
    }
    for(int i=1;i<=n;i++){
        cout<<c[i]<<" ";
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值