CF1490E Accidental Victory (前缀和)

题目传送门
这道题我们来寻找性质,用一个结构体来存储数据的值和数据的位置,并对数据的值将进行排序,并求前缀和,如果i-1的前缀和小于a[i]那么答案就一定不在1~i-1之间了,答案在i ~ n这个区间,因此记录下来,最后的ans以后的所有位置用一个数组存放起来,再对这个数组排序,最后的答案就是这个数组的数据。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
struct node{
	ll num;
	ll p;
}s[2102100];
ll sum[2102120];
ll an[21020000];
bool cmp(node x,node y){
	return x.num<y.num;
}
int main(){
	ll T;
	cin>>T;
	while(T--){
		ll n;
		cin>>n;
		for(ll i=1;i<=n;i++){
			cin>>s[i].num;
			s[i].p=i;
		}	
		sort(s+1,s+1+n,cmp);
		for(ll i=1;i<=n;i++){
			sum[i]=s[i].num+sum[i-1];
		}
		ll ans=1;//记录起始位置 
		for(ll i=1;i<=n;i++){
			if(sum[i-1]<s[i].num)ans=i;
			if(sum[i-1]==0)ans=i;
		}
		if(sum[n]==0)ans=n+1;
		ll o=0;
		for(ll i=ans;i<=n;i++)an[++o]=s[i].p;
		if(ans<=n)sort(an+1,an+1+o);
		printf("%lld\n",o);
		for(ll i=1;i<=o;i++)printf("%lld ",an[i]);
		printf("\n");
	}
	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
As an AI language model, I do not have access to the specific requirements or details for the E2E_CalculateCRC8 function. However, I can provide a general explanation of what a CRC8 calculation is and how it can be implemented. CRC (Cyclic Redundancy Check) is a type of error-detecting code used in digital communication systems to detect accidental changes to raw data. A CRC8 checksum is a specific type of CRC that uses an 8-bit polynomial to generate the checksum value. The checksum is calculated by dividing the raw data by the polynomial and taking the remainder as the checksum value. To implement a CRC8 calculation, the following steps can be taken: 1. Define the polynomial used for the CRC8 calculation. This is typically an 8-bit value such as 0x07 or 0x9B. 2. Initialize a variable to hold the current checksum value. This is typically set to 0xFF. 3. For each byte of data in the input message, XOR it with the current checksum value and update the checksum value using the polynomial. 4. After processing all the bytes in the input message, the final checksum value is the CRC8 checksum. Here is an example implementation of a CRC8 calculation in C: ``` #define CRC8_POLYNOMIAL 0x07 unsigned char calculate_crc8(unsigned char *data, unsigned int length) { unsigned char crc = 0xFF; unsigned int i, j; for (i = 0; i < length; i++) { crc ^= data[i]; for (j = 0; j < 8; j++) { if (crc & 0x80) { crc = (crc << 1) ^ CRC8_POLYNOMIAL; } else { crc <<= 1; } } } return crc; } ``` This function takes an input message as an array of bytes and its length as an integer. It returns the calculated CRC8 checksum as an unsigned char value. The function performs the XOR and polynomial operations on each byte of the input message to calculate the checksum value.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值