HDU 5536: Chip Factory

import static java.lang.Math.*;import java.util.*;

/** * @author Sycamore * @link http://acm.hdu.edu.cn/showproblem.php?pid=5536 * @date Sep, 16 */

public class Main {

public static void main(String args[]) {        Scanner scanner =new Scanner(System.in);        int T=scanner.nextInt();        while(T--!=0){            int n=scanner.nextInt(),ans=0;            int []s=new int[n];            for(int i=0;i<n;i++){                s[i]=scanner.nextInt();            }            for(int i=0;i<n;i++){                for(int j=i+1;j<n;j++){                    for(int k=j+1;k<n;k++){                        ans=max(ans,(s[i]+s[j])^s[k]);                        ans=max(ans,(s[i]+s[k])^s[j]);                        ans=max(ans,(s[j]+s[k])^s[i]);                    }                }            }            System.out.println(ans);        }

}}

pasting

时间: 2024-10-13 11:31:24

HDU 5536: Chip Factory的相关文章

HDU 5536 Chip Factory 字典树+贪心

给你n个数,a1....an,求(ai+aj)^ak最大的值,i不等于j不等于k 思路:先建字典树,暴力i,j每次删除他们,然后贪心找k,再恢复i,j,每次和答案取较大的,就是答案,有关异或的貌似很多都用字典树,也是醉了 /*Problem : 5536 ( Chip Factory ) Judge Status : Accepted RunId : 15506230 Language : G++ Author : qianbi08*/ #include<iostream> #include&

2015ACM/ICPC亚洲区长春站 J hdu 5536 Chip Factory

Chip Factory Time Limit: 18000/9000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 368    Accepted Submission(s): 202 Problem Description John is a manager of a CPU chip factory, the factory produces lots of chips

hdu 5536 Chip Factory 字典树+bitset 铜牌题

Chip Factory Time Limit: 18000/9000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1842    Accepted Submission(s): 833 Problem Description John is a manager of a CPU chip factory, the factory produces lots of chip

ACM学习历程—HDU 5536 Chip Factory(xor &amp;&amp; 字典树)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5536 题目大意是给了一个序列,求(si+sj)^sk的最大值. 首先n有1000,暴力理论上是不行的. 此外题目中说大数据只有10组,小数据最多n只有100.(那么c*n^2的复杂度应该差不多) 于是可以考虑枚举i和j,然后匹配k. 于是可以先把所有s[k]全部存进一个字典树, 然后枚举s[i]和s[j],由于i.j.k互不相等,于是先从字典树里面删掉s[i]和s[j],然后对s[i]+s[j]这个

HDU 5536 Chip Factory(字典树)

题目戳这 题意:给你n个数,从中选出三个数a,b,c,然后(a+b)^c,这个式子的值是最大的. 思路:如果来三个for循环,果断TLE,所以想到了字典树,就是先把所有的数字都插进去,在查询的时候就先把确定了的那两个数字删掉,然后在字典树中求出异或的最大值,得到结果后,再把两个数字插回去. P.S.一开始我的数组开到了45*10^5+10,然后他给我TLE,然后当我把数组开到10^5+10的时候,A了···········,居然是数组爆我时间了,我勒个擦. #include<stdio.h>

hdu5269 Chip Factory

地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=5536 题目: Chip Factory Time Limit: 18000/9000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2044    Accepted Submission(s): 919 Problem Description John is a mana

hdu5536 Chip Factory xor,字典树

hdu5536 Chip Factory   xor,字典树 Chip Factory Time Limit: 18000/9000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 280    Accepted Submission(s): 158 Problem Description John is a manager of a CPU chip factory, the

Chip Factory

原文链接:https://blog.csdn.net/qq_41021816/java/article/details/82934486 John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More speci?cally, the

【hdu 5536】【 2015ACM/ICPC亚洲区长春站 】Chip Factory 题意&题解&代码

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5536 题意: 给定n个个数s1, s2- sn,求最大的(si+sj)^sk且满足(i!=j!=k). 题解: 很明显的一道字典树题目,把每个数都插入字典树,枚举两个数的和.考虑到可能会有重复的数,每次枚举到i,j时首先在字典树上删除 si 和 sj 然后再查询 si+sj . 代码: #include<iostream> #include<algorithm> #include&l