zoukankan      html  css  js  c++  java
  • codeforces 631A A. Interview

    A. Interview
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Blake is a CEO of a large company called "Blake Technologies". He loves his company very much and he thinks that his company should be the best. That is why every candidate needs to pass through the interview that consists of the following problem.

    We define function f(x, l, r) as a bitwise OR of integers xl, xl + 1, ..., xr, where xi is the i-th element of the array x. You are given two arrays a and b of length n. You need to determine the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the length of the arrays.

    The second line contains n integers ai (0 ≤ ai ≤ 109).

    The third line contains n integers bi (0 ≤ bi ≤ 109).

    Output

    Print a single integer — the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.

    Examples
    input
    5
    1 2 4 3 2
    2 3 3 12 1
    output
    22
    input
    10
    13 2 7 11 8 4 9 8 5 1
    5 7 18 9 2 3 0 11 8 6
    output
    46
    Note

    Bitwise OR of two non-negative integers a and b is the number c = a OR b, such that each of its digits in binary notation is 1 if and only if at least one of a or b have 1 in the corresponding position in binary notation.

    In the first sample, one of the optimal answers is l = 2 and r = 4, becausef(a, 2, 4) + f(b, 2, 4) = (2 OR 4 OR 3) + (3 OR 3 OR 12) = 7 + 15 = 22. Other ways to get maximum value is to choose l = 1 andr = 4, l = 1 and r = 5, l = 2 and r = 4, l = 2 and r = 5, l = 3 and r = 4, or l = 3 and r = 5.

    In the second sample, the maximum value is obtained for l = 1 and r = 9.

    题意:求[l,r]内ai的or和bi的or和的最大值;

    思路:暴力求任意的l到r的要求值,再找出最大的输出;

    AC代码:

    #include <bits/stdc++.h>
    using namespace std;
    long long a[1003],b[1003],fa[1003][1003],fb[1003][1003];
    int n;
    int main()
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
        }
        for(int i=1;i<=n;i++)
        {
            cin>>b[i];
        }
        long long x,y;
        for(int i=1;i<=n;i++)
        {
            fa[i][i]=a[i];
            fb[i][i]=b[i];
            for(int j=i+1;j<=n;j++)
            {
                fa[i][j]=(fa[i][j-1]|a[j]);
                fb[i][j]=(fb[i][j-1]|b[j]);
            }
        }
        long long ans=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=i;j<=n;j++)
            {
                ans=max(ans,fa[i][j]+fb[i][j]);
            }
        }
        cout<<ans<<"
    ";
        return 0;
    }
  • 相关阅读:
    WorkFlow入门Step.2—Building a Simple WorkFlowForWF4.0
    AgileEAS.NET敏捷开发平台升级版(丑小鸭的蜕变)[已修复下载链接]
    AgileEAS.NET平台开发实例药店系统视频教程系列索引
    AgileEAS.NET敏捷开发平台及案例下载(持续更新)索引
    WorkFlow入门Step.3—Adding Procedural ElementsForWF4.0
    AgileEAS.NET敏捷开发平台案例药店系统项目综述
    AgileEAS.NET平台开发实例智能升级及服务器部署
    WorkFlow入门Step.4—Adding Procedural ElementsForWF4.0(续)
    AgileEAS.NET平台开发实例药店系统资源文件的替换[大家关心的问题]
    停靠在八楼的2路汽车/ 刀郎:2002年第一场雪
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5243883.html
Copyright © 2011-2022 走看看