Codeforces Round #819 (Div. 1 + Div. 2) 参考代码

最新推荐文章于 2024-07-15 17:55:50 发布

原创

最新推荐文章于 2024-07-15 17:55:50 发布 · 418 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法

本文分享了Codeforces Round #819比赛中的五道题目——A. Mainak and Array, B. Mainak and Interesting Sequence, C. Jatayu’s Balanced Bracket Sequence, D. Edge Split, E. Almost Perfect的参考代码和解题思路，适合算法爱好者学习和练习。" 78653491,6682711,Springboot Admin配置邮件报警,"['Springboot', '邮件服务', '监控工具', '报警机制']

A. Mainak and Array

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
   
   
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){
   
   if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){
   
   x=x*10+c-'0',c=getchar();}
    return x*f;
}
const int N=2010;
int a[N];
void solve()
{
   
   
	int n=read();

	for(int i=1;i<=n;i++)a[i]=read();
	if(n==1)
	{
   
   
		printf("0\n");
		return;
	}
	int ans=0;
	for(int i=1;i<n;i++)ans=max(ans,a[i]-a[i+1]);
	
	int max1=0,max2=1e9;
	for(int i=1;i<=n-1;i++)max2=min(max2,a[i]);
	for(int i=2;i<=n;i++)max1=max(max1,a[i]);
	ans=max(ans,max(max1-a[1],a[n]-max2));
	printf("%d\n",ans);
}

int main()
{
   
   
	int T=read();
	while(T--)solve();
	return 0;
}

B. Mainak and Interesting Sequence

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#

最低0.47元/天解锁文章