多校比赛—It's All In The Mind

本文探讨了一道算法题目,目标是在已知部分元素的情况下填充一个非递增序列,并求解特定表达式的最大值。文章提供了完整的C++代码实现,包括输入处理、序列填充逻辑及输出结果。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

It's All In The Mind

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0


Problem Description
Professor Zhang has a number sequence a1,a2,...,an. However, the sequence is not complete and some elements are missing. Fortunately, Professor Zhang remembers some properties of the sequence:

1. For every i{1,2,...,n}0ai100.
2. The sequence is non-increasing, i.e. a1a2...an.
3. The sum of all elements in the sequence is not zero.

Professor Zhang wants to know the maximum value of a1+a2ni=1ai among all the possible sequences.
 

Input
There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

The first contains two integers n and m (2n100,0mn) -- the length of the sequence and the number of known elements.

In the next m lines, each contains two integers xi and yi (1xin,0yi100,xi<xi+1,yiyi+1), indicating that axi=yi.
 

Output
For each test case, output the answer as an irreducible fraction "p/q", where pq are integers, q>0.
 

Sample Input
2 2 0 3 1 3 1
 

Sample Output
1/1 200/201
 

思路:只需保证a[1]+a[2]最大即可
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<limits.h>
#include<algorithm>
using namespace std;
int gcd(int x,int y)
{
	if(x<y)
		return gcd(y,x);
	else if(y==0)
		return x;
	else
		return gcd(y,x%y);
}
int  main()
{
	int  n,m,i,j,a[101];
	int t,p,q;
	scanf("%d",&t);
	while(t--)
	{
		int x,y;
		q=0;
		memset(a,0,sizeof(a));
		scanf("%d%d",&n,&m);
		int flag=0;
		for(i=1;i<=m;i++)
		{
			scanf("%d%d",&x,&y);
			a[x]=y;
		}
		if(a[1]!=0  && a[2]!=0)
		{
		     p=a[1]+a[2];
		}
		else if(a[1]==0 && a[2]!=0)
		{
			a[1]=100;
			p=a[1]+a[2];
		}
		else if(a[1]!=0 && a[2]==0)
		{
		    a[2]=a[1];
			p=a[1]+a[2];
		}
		else if(a[1]==0 && a[2]==0)
		{
			   a[1]=a[2]=100;
			   p=a[1]+a[2];
		}
		int t1,t2;
		t2=3;
		q+=p;
		flag=0;
		for(i=n;i>=3;i--)
		{
			if(a[i]!=0)
			{
				flag=i;
				break;
			}
			else
				a[i]=0;
		}
		while(t2<=flag)
		{
			for(int h=t2;h<=flag;h++)
				if(a[h]!=0)
				{
					t1=h;
					break;
				}
			for(j=t2;j<=t1;j++)
			{
				if(a[j]==0)
					q+=a[t1];
				if(j==t1)
					q+=a[t1];
			}
			t2=t1+1;
		}
		int x1=gcd(p,p+q);
		p=p/x1;
		q=q/x1;
		printf("%d/%d\n",p,q);
	}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值