ccfText2014.3.2(窗口)

ccfText2014.3.2(窗口)

错误代码1

错误原因：第12行的findMax()函数中的形参名跟第8行定义的全局变量冲突导致错误

#include <iostream>
#include <algorithm>
#define N 11
#define MAXN 2600
#define MAXL 1500
using namespace std;

int a[N];//存放比较层次
int b[N][MAXL][MAXN] ={0};//存放窗口大小
int asd;

int findMax(int a[],int n){
    int maxi = -1;
    int flag ;
    int l;
    for(l = 0;l < n;l++){
        if(maxi < a[l]){
            flag = l;
            maxi = a[l];
        }
    }
    return flag;
}

int main()
{
   // cout << "Hello world!" << endl;
    int n,m;
    cin>>n>>m;
    for(int i = 0 ;i < n;i++){
        int x1,x2,y1,y2;
        cin>>x1>>y1>>x2>>y2;
        a[i]= i;
        for(int j = y1;j <y2+1;j++)
            for(int k = x1;k <x2+1;k++)
                b[i][j][k] = 1;
    }
  
    for(int i = 0;i < m;i++){
        int x3,y3;
        cin>>x3>>y3;

        int t = n;
        int c[N] ={0};
        int dangmax = a[findMax(a,n)];
         for(int i = 0;i < n;i++){
                c[i] = a[i];
            }
        while(!t){
            asd = findMax(c,n);
            if(b[asd][y3][x3]==1){
                cout<<asd+1<<endl;
                a[asd] += dangmax;
                break;
            }
            c[asd] = -1;
            t--;
        }
        if(!t)
            cout<<"IGNORED"<<endl;

    }

    return 0;
}

错误代码2

错误原因：第49行的while(!t)使用错误，while()判断里边为真则一直循环下去，可使用while(t- -)来达到目的，但是这题不能，原因暂时不想去想了。

#include <iostream>
#include <algorithm>
#define N 11
#define MAXN 2600
#define MAXL 1500
using namespace std;

int a[N];//存放比较层次
int b[N][MAXL][MAXN] ={0};//存放窗口大小
int asd;

int findMax(int d[],int n){
    int maxi = -1;
    int flag ;
    int l;
    for(l = 0;l < n;l++){
        if(maxi < d[l]){
            flag = l;
            maxi = d[l];
        }
    }
    return flag;
}

int main()
{
   // cout << "Hello world!" << endl;
    int n,m;
    cin>>n>>m;
    for(int i = 0 ;i < n;i++){
        int x1,x2,y1,y2;
        cin>>x1>>y1>>x2>>y2;
        a[i]= i;
        for(int j = y1;j <y2+1;j++)
            for(int k = x1;k <x2+1;k++)
                b[i][j][k] = 1;
    }
   
    for(int i = 0;i < m;i++){
        int x3,y3;
        cin>>x3>>y3;

        int t = n;
        int c[N] ={0};
        int dangmax = a[findMax(a,n)];
         for(int i = 0;i < n;i++){
                c[i] = a[i];
            }
        while(!t){
            asd = findMax(c,n);
            if(b[asd][y3][x3]==1){
                cout<<asd+1<<endl;
                a[asd] += dangmax;
                break;
            }
            c[asd] = -1;
            t--;
        }
        if(!t)
            cout<<"IGNORED"<<endl;

    }

    return 0;
}

正确代码

#include <iostream>
#include <algorithm>
#define N 11
#define MAXN 2600
#define MAXL 1500
using namespace std;

int a[N];//存放比较层次
int b[N][MAXL][MAXN] ={0};//存放窗口大小
int asd;

int findMax(int d[],int n){
    int maxi = -1;
    int flag ;
    int l;
    for(l = 0;l < n;l++){
        if(maxi < d[l]){
            flag = l;
            maxi = d[l];
        }
    }
    return flag;
}

int main()
{
   // cout << "Hello world!" << endl;
    int n,m;
    cin>>n>>m;
    for(int i = 0 ;i < n;i++){
        int x1,x2,y1,y2;
        cin>>x1>>y1>>x2>>y2;
        a[i]= i;
        for(int j = y1;j <y2+1;j++)
            for(int k = x1;k <x2+1;k++)
                b[i][j][k] = 1;
    }
   
    for(int i = 0;i < m;i++){
        int x3,y3;
        cin>>x3>>y3;

        int t = n;
        int c[N] ={0};
        int dangmax = a[findMax(a,n)];
         for(int i = 0;i < n;i++){
                c[i] = a[i];
            }
        while(t != 0){
            asd = findMax(c,n);
            if(b[asd][y3][x3]==1){
                cout<<asd+1<<endl;
                a[asd] += dangmax;
                break;
            }
            c[asd] = -1;
            t--;
        }
        if(!t)
            cout<<"IGNORED"<<endl;

    }

    return 0;
}