2022icpc沈阳站

DRX vs. T1

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

string s;

void solve()
{
	int t=0,d=0;
	for(int i=0;i<s.size();i++)
	{
		if(s[i]=='T') t++;
		else if(s[i]=='D') d++;
	}
	if(t>d) cout<<"T1"<<endl;
	else cout<<"DRX"<<endl;
}

int main()
{
	cin>>s;
	
	solve();
	
	return 0;
}

C. Clamped Sequence

#include<iostream>
#include<algorithm>
#include<cstring>
#define int long long

using namespace std;

const int N=5010;
int a[N],b[N];
int n,d;

int solve()
{
	int ans=-0x3f3f3f3f;
	for(int i=0;i<n;i++) cin>>a[i];
	
	for(int i=0;i<n;i++)
	{
		int sum=0;
		int l=a[i];
		int r=a[i]+d;
		for(int j=0;j<n;j++)
		{
			if(a[j]<l) b[j]=l;
			else if(a[j]>r) b[j]=r;
			else b[j]=a[j];
		}
		for(int j=1;j<n;j++) sum+=abs(b[j]-b[j-1]);
		ans=max(sum,ans);
		
		sum=0;
		l=a[i]-d,r=a[i];
		
		for(int j=0;j<n;j++)
		{
			if(a[j]<l) b[j]=l;
			else if(a[j]>r) b[j]=r;
			else b[j]=a[j];
		}
		for(int j=1;j<n;j++) sum+=abs(b[j]-b[j-1]);
		ans=max(ans,sum);
	}
	return ans;
}
signed main()
{
	cin>>n>>d;
	
	cout<<solve();
	
	return 0;
}