北京赛区(2017)网络赛之 Visiting Peking University

最新推荐文章于 2019-08-19 18:45:00 发布

原创最新推荐文章于 2019-08-19 18:45:00 发布 · 894 阅读

0 ·

CC 4.0 BY-SA版权

水题同时被 2 个专栏收录

75 篇文章

订阅专栏

模拟法

17 篇文章

订阅专栏

本文介绍了一个算法问题，即如何为一位旅行者规划在北京的最佳访问北京大学日期，以避开等待队伍并考虑交通管制因素。该问题涉及动态规划和最优选择策略。

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

题目1 : Visiting Peking University

时间限制:1000ms

单点时限:1000ms

内存限制:256MB

描述

Ming is going to travel for n days and the date of these days can be represented by n integers: 0, 1, 2, …, n-1. He plans to spend m consecutive days（2 ≤ m ≤ n）in Beijing. During these m days, he intends to use the first day and another day to visit Peking university. Before he made his plan, Ming investigated on the number of tourists who would be waiting in line to enter Peking university during his n-day trip, and the results could be represented by an integer sequence p[i] (0 ≤ i ≤ n-1, p[i] represents the number of waiting tourists on day i). To save time, he hopes to choose two certain dates a and b to visit PKU(0 ≤ a < b ≤ n-1), which makes p[a] + p[b] as small as possible.

Unfortunately, Ming comes to know that traffic control will be taking place in Beijing on some days during his n-day trip, and he won’t be able to visit any place in Beijing, including PKU, on a traffic control day. Ming loves Beijing and he wants to make sure that m days can be used to visit interesting places in Beijing. So Ming made a decision: spending k (m ≤ k ≤ n) consecutive days in Beijing is also acceptable if there are k - m traffic control days among those k days. Under this complicated situation, he doesn’t know how to make the best schedule. Please write a program to help Ming determine the best dates of the two days to visit Peking University. Data guarantees a unique solution.

输入

There are no more than 20 test cases.

For each test case:

The first line contains two integers, above mentioned n and m (2 ≤ n ≤ 100, 2 ≤ m ≤ n).

The second line contains n integers, above mentioned p[0] , p[1] , … p[n-1]. (0 ≤ p[i] ≤ 1000, i = 0 ... n-1)

The third line is an integer q (0 ≤ q ≤ n), representing the total number of traffic control days during the n-day trip, followed by q integers representing the dates of these days.

输出

One line, including two integers a and b, representing the best dates for visiting PKU.

样例输入

7 3
6 9 10 1 0 8 35
3 5 6 2
4 2
10 11 1 2
1 2

样例输出

0 3

1 3

AC代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn=100+10;
int p[maxn];
int q[maxn];
int flag[maxn];

struct point
{
    int value;
    int id;
}a[maxn];

int main()
{
    int n,m;
    int l,r;
    int q_num;
    while(cin>>n>>m)
    {
        memset(p,0,sizeof(p));
        memset(q,0,sizeof(q));
        memset(a,0,sizeof(a));
        memset(flag,0,sizeof(flag));

        for(int i=0;i<n;i++) cin>>p[i];
        cin>>q_num;
        for(int i=0;i<q_num;i++)
        {
            cin>>q[i];
            flag[q[i]]=1;
        }
        int num=0;
        for(int i=0;i<n;i++)
        {
            if(!flag[i])
            {
                a[num].value=p[i];
                a[num].id=i;
                num++;
            }
        }

        int maxi=10000;
        for(int i=0;i<num;i++)
        {
            if(i+m-1<num)
            {
                 for(int j=i+1;j<=i+m-1;j++)
                 {
                    if(a[i].value+a[j].value<maxi)
                    {
                        maxi=a[i].value+a[j].value;
                        l=a[i].id;
                        r=a[j].id;
                    }
                 }

            }
        }
        cout<<l<<" "<<r<<endl;
    }
    return 0;
}