本文最后更新于 321 天前,其中的信息可能已经有所发展或是发生改变。
题目大意:
思想:
代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define re register
#define fi first
#define se second
#define endl '\n'
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int N = 1e6 + 3;
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
const double eps = 1e-6, PI = acos(-1);
void solve(){
int n, k; cin >> n >> k;
bool flag = 0;
for(int i = 0; i < n; i ++){
int x; cin >> x;
if(x == 1) flag = 1;
}
if(flag) cout << "YES" << endl;
else cout << "NO" << endl;
}
int main(){
IOS;
int _ = 1;
cin >> _;
while(_ --){
solve();
}
return 0;
}
题目大意:
思想:
代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define re register
#define fi first
#define se second
#define endl '\n'
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int N = 1e6 + 3;
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
const double eps = 1e-6, PI = acos(-1);
int a[N], b[N];
void solve(){
int n; cin >> n;
for(int i = 0; i < n; i ++){
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int cnt = 0;
for(int i = 0; i < n; i ++){
if(a[i] != b[i]) cnt ++;
}
cout << cnt / 2 << endl;
}
int main(){
IOS;
int _ = 1;
cin >> _;
while(_ --){
solve();
}
return 0;
}
题目大意:
思想:
代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define re register
#define fi first
#define se second
#define endl '\n'
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int N = 1e6 + 3;
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
const double eps = 1e-6, PI = acos(-1);
int a[N];
void solve(){
int n; cin >> n;
for(int i = 1; i <= n; i ++) cin >> a[i];
priority_queue<PII, vector<PII>, greater<PII>> b;
for(int i = 2; i <= n; i ++){
int t = a[i] - a[i - 1];
if(t <= 0){
b.push({-t + 1, i});
}
}
if(b.empty()){
for(int i = 1; i <= n; i ++) cout << 1 << ' ';
}
else{
auto p = b.top();
for(int i = 1 ; i <= n; i ++){
if(i >= p.fi && !b.empty()){
cout << p.se << ' ';
b.pop(); p = b.top();
}
else cout << 1 << ' ';
}
}
cout << endl;
}
int main(){
IOS;
int _ = 1;
cin >> _;
while(_ --){
solve();
}
return 0;
}