output limit exceed 常见错误

 output limit exceed   常见错误

最近做题,好几次出现了这样的令人郁闷的答案 output limit exceed   ,  仔细查看了自己的代码,仍然没有发现错误,后来上网上搜索答案,也是有好多人遇到过这些问题,自己的那个题经过多次修改,最终解决了,我把scanf读取lld改为cin或者直接把longlong 等更改为int就没有问题了,后来我不死心又从网上搜索http://bbs.cyuyan.com.cn/thread-4574-1-1.html 他们也有这个问题,和我的相似,定义的变量类型可能不匹配导致出现各种问题,我想要是java,肯定不会出现这种奇葩问题,无非就是慢点而已,时间效率不高罢了!还有c语言读取字符串的时候好多次本来很正确的代码,经常会出现各种奇葩错误,gets,getline,scanf(“%s”)各有优点也各有缺点!
还有读取回车getchar真是令人郁闷的发明,尤其在竞赛中,经常会被这类小问题卡主!
c语言是挺灵活,但是灵活也带来了这种意想不到的问题,看来有时候还是讲点原则的好啊

PS:当出现TLE(Time Limit Exceed)时,不妨:
将long long 改为int
将double改为float
将cin改为scanf
将cout改为printf

当出现MLE(Memory Limit Exceed)时,不妨:
G++提交的换作C++提交,C++提交的换位G++提交。
有时候还真能过。

B. Serval and Final MEX time limit per test1 second memory limit per test256 megabytes You are given an array a consisting of n≥4 non-negative integers. You need to perform the following operation on a until its length becomes 1 : Select two indices l and r (1≤l<r≤|a| ), and replace the subarray [al,al+1,…,ar] with a single integer mex([al,al+1,…,ar]) , where mex(b) denotes the minimum excluded (MEX)∗ of the integers in b . In other words, let x=mex([al,al+1,…,ar]) , the array a will become [a1,a2,…,al−1,x,ar+1,ar+2,…,a|a|] . Note that the length of a decreases by (r−l) after this operation. Serval wants the final element in a to be 0 . Help him! More formally, you have to find a sequence of operations, such that after performing these operations in order, the length of a becomes 1 , and the final element in a is 0 . It can be shown that at least one valid operation sequence exists under the constraints of the problem, and the length of any valid operation sequence does not exceed n . Note that you do not need to minimize the number of operations. ∗ The minimum excluded (MEX) of a collection of integers b1,b2,…,bk is defined as the smallest non-negative integer x which does not occur in the collection b . Input Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤1000 ). The description of the test cases follows. The first line of each test case contains a single integer n (4≤n≤5000 ) — the length of the array a . The second line contains n integers a1,a2,…,an (0≤ai≤n ) — the elements of the array a . It is guaranteed that the sum of n over all test cases does not exceed 5000 . Output For each test case, output a single integer k (0≤k≤n ) in the first line of output — the length of the operation sequence. Then, output k lines, the i -th line containing two integers li and ri (1≤li<ri≤|a| ) — the two indices you choose in the i -th operation, where |a| denotes the length of the array be
最新发布
03-23
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值