A.想让voya赢,n就得被3整除,想让vanya赢n就得不被n整除。这个就是临界点。(如果n被3整除,voya必须操作一次,vanya只需要再还原即可获胜。)因此如果n-1,n+1能被3整除vanya就能赢,voya需要n被3整除。
// Problem: A. Game with Integers
// Contest: Codeforces - Codeforces Round 909 (Div. 3)
// URL: https://codeforces.com/contest/1899/problem/A
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <cstring>
#include <iomanip>
#include <ctime>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
void solve() {
int n;
cin>>n;
for(int i=n-1;i<=n+1;i++){
if(i%3==0 && i!=n){
cout<<"First"<<'\n';
return;
}
}
cout<<"Second"<<"\n";
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int q;
cin >> q;
while (q--) {
solve();
}
return 0;
}
#############################################################################补题
B.暴力,求最大的绝对值,要求k种分类下最小值和最大值,因此我们要枚举k层,但只有n%k==0才能满足题意(平均分配),我们再通过2个指针对区间枚举(每个区块k个),再用前缀和对其进行区间求和.比较出最大值和最小值,用ans更新数据.
// Problem: B. 250 Thousand Tons of TNT
// Contest: Codeforces - Codeforces Round 909 (Div. 3)
// URL: https://codeforces.com/contest/1899/problem/B
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <cstring>
#include <iomanip>
#include <ctime>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#define eps 1e-5
#define INF 1e18
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
const int N = 2e6 + 9;
ll a[N],prefix[N];
void solve() {
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
prefix[i]=a[i]+prefix[i-1];
}
ll ans=-INF;
for(int i=1;i<=n;i++){
ll mini=INF, maxi=0;
if(n%i==0){
for(int j=i;j<=n;j+=i){
maxi=max(maxi,prefix[j]-prefix[j-i]);
mini=min(mini,prefix[j]-prefix[j-i]);
}
ans=max(ans,abs(mini-maxi));
}
}
cout<<ans<<'\n';
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int q;
cin >> q;
while (q--) {
solve();
}
return 0;
}
C.贪心或者dp
贪心.为了使得子段和最大,我们要加入大于0的数,因此a[i]和0做比较取最大。但为了满足题意,a[i]和a[i-1]需要一个是偶数一个是奇数(奇偶不同),如果相同我们将总和初始化为0.
判断a[i]和a[i-1]的(奇数偶数性质)需要%2,又因为数据范围有负数,因此有这样的式子abs(a[i]%2)!=abs(a[i-1]%2).
// Problem: C. Yarik and Array
// Contest: Codeforces - Codeforces Round 909 (Div. 3)
// URL: https://codeforces.com/contest/1899/problem/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <cstring>
#include <iomanip>
#include <ctime>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
const int N = 2e5 + 9;
int a[N];
void solve() {
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int ans=a[1];
int sum=0;
for(int i=1;i<=n;i++){
if(abs(a[i]%2)==abs(a[i-1]%2)){
sum=0;
}
sum+=a[i];
ans=max(ans,sum);
if(sum<0){
sum=0;
}
}
cout<<ans<<'\n';
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int q;
cin >> q;
while (q--) {
solve();
}
return 0;
}
dp.通过贪心的方法可以分析出状态转移方程dp[i]=max(dp[i],dp[i-1]+a[i]),记得初始化dp[1]=a[1].最后将dp[i]遍历一遍,用ans更新出最大的和。
判断奇数偶数,还可以通过位运算,a[i]&1!=a[i-1]&1; (1&1==1 1&0==0).
#include <iostream>
#include <cstring>
#include <iomanip>
#include <ctime>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#define eps 1e-5
#define INF 1e9
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
const int N = 2e6 + 9;
int a[N],dp[N];
void solve() {
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
dp[1]=a[1];
for(int i=2;i<=n;i++){
dp[i]=a[i];
if((a[i]&1)!=(a[i-1]&1)){
dp[i]=max(dp[i],dp[i-1]+a[i]);
}
}
int ans=-INF;
for(int i=1;i<=n;i++){
ans=max(ans,dp[i]);
}
cout<<ans<<'\n';
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int q;
cin >> q;
while (q--) {
solve();
}
return 0;
}
D.求pow(pow(2,a[i]),pow(2,a[j])=pow(pow(2,a[j]),pow(2,a[i]),可以先对其式子进行分析.
因此只需要用map作为桶给数组计数即可得出答案。
// Problem: D. Yarik and Musical Notes
// Contest: Codeforces - Codeforces Round 909 (Div. 3)
// URL: https://codeforces.com/contest/1899/problem/D
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <cstring>
#include <iomanip>
#include <ctime>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#define eps 1e-5
#define INF 1e9
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
const int N = 2e5 + 9;
int a[N];
void solve() {
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
map<int,int>mp;
ll ans=0;
for(int i=1;i<=n;i++){
ans+=mp[a[i]];//a[i]相等配对
if(a[i]==1){
ans+=mp[2];//给1配对
}else if(a[i]==2){
ans+=mp[1];//给2配对
}
mp[a[i]]++;
}
cout<<ans<<'\n';
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int q;
cin >> q;
while (q--) {
solve();
}
return 0;
}
E.观察测试例子,可以发现输出-1的都是数字到了最小一个的无法再继续循环下去(死循环),而后面还不是升序状态。因此我们只需要判断最小值后面是不是升序即可.升序输出最小值的索引(从0开始的),不是升序输出0.
// Problem: E. Queue Sort
// Contest: Codeforces - Codeforces Round 909 (Div. 3)
// URL: https://codeforces.com/contest/1899/problem/E
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <cstring>
#include <iomanip>
#include <ctime>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#define eps 1e-5
#define INF 1e9
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
const int N = 2e6 + 9;
ll a[N];
void solve() {
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
int temp=0;
int mini=INF;
for(int i=0;i<n;i++){
if(a[i]<mini){
mini=a[i];
temp=i;
}
}
bool flag=true;
for(int i=temp;i<=n-2;i++){
if(a[i]>a[i+1]){
flag=false;
}
}
if(!flag){
cout<<-1<<'\n';
}else{
cout<<temp<<'\n';
}
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int q;
cin >> q;
while (q--) {
solve();
}
return 0;
}
F.要求我们构造一棵树,使得叶子的距离等于di,我们可以构造一个只有一条链的树,一开始距离是n-1,如果要等于di,我们可以发现只要把最后一个点与di点连接即可,(n=5,d=2,2,1,5(di=2)).
// Problem: F. Alex's whims
// Contest: Codeforces - Codeforces Round 909 (Div. 3)
// URL: https://codeforces.com/contest/1899/problem/F
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <cstring>
#include <iomanip>
#include <ctime>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#define eps 1e-5
#define INF 1e9
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
void solve() {
int n,q;
cin>>n>>q;
for(int i=1;i<n;i++){
cout<<i<<" "<<i+1<<'\n';
}
int index=n-1;
while(q--){
int d;
cin>>d;
if(index==d){
cout<<"-1 -1 -1"<<'\n';
}else{
cout<<n<<" "<<index<<" "<<d<<'\n';
index=d;//记录转移位置
}
}
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int _;
cin >> _;
while (_--) {
solve();
}
return 0;
}