蒟蒻求救,样例过了,数据全Wa
查看原帖
蒟蒻求救,样例过了,数据全Wa
227654
平易楼主2021/4/20 18:57
#include <iostream>
#include <fstream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <bits/stdc++.h>
using namespace std;

int _myList[10086];
int _num;
int _maxi;

int main()
{
	int fun, x, q, h;
	int solo;
	
	cin >> _maxi;
	for (int i = 0; i < _maxi; i ++) {
		cin >> fun >> x;
		
		switch(fun) {
		case 1:
			for (int i = 0; i < _num; i ++) {
				if (_myList[i] == x) {
					cout << i + 1 << endl;
				}
			}
			break;
		case 2:
			cout << _myList[i - 1] << endl;
			break;
		case 3:
			if (_myList[0] >= x) {
				cout << -2147483647 << endl;
				break;
			}
			
			for (int i = 1; i < _num; i ++) {
				if (_myList[i] >= x) {
					cout << _myList[i - 1] << endl;
					break;	
				}
			}
			break;
		case 4:
			if (_myList[_num - 1] <= x) {
				cout << 2147483647 << endl;
				break;
			}
			
			for (int i = 1; i < _num; i ++) {
				if (_myList[i] <= x) {
					cout << _myList[i + 1] << endl;
					break;	
				}
			}
			break;
		case 5:			
			solo = _num;
			for (int i = 0; i < _num; i ++) {
				if (_myList[i] > x) {
					solo = i;
				}
			}
			
			_num ++;
			
			for (int i = solo + 1; i < _num; i ++) {
				_myList[i] = _myList[i - 1];
			}
			_myList[solo] = x;
			break;
		}	
	}
	
	
	return 0;
}

2021/4/20 18:57
加载中...