OJ：PAT A1048 Find Coins - 双下标归中

WinterShiver

于 2022-03-20 22:39:21 发布

阅读量213

点赞数

分类专栏： OJ笔记文章标签： ACM

本文链接：https://blog.csdn.net/WinterShiver/article/details/123623668

版权

OJ笔记专栏收录该内容

28 篇文章 0 订阅

订阅专栏

思想

问题：有一个函数 $f (i, j)$ 是基于一个数组定义的，需要遍历一个数组，寻找使 $f (i, j)$ 满足条件的 $(i, j)$ .

解决：在这种情况下，如果从 $(i \pm 1, j)$ 到 $(i, j)$ ， $(i, j \pm 1)$ 到 $(i, j)$ 时 $f (i, j)$ 的值可以用某种方法维护，而且有单调性质：
可以设置头尾下标，从两端往中间移动，从而遍历到每个合法情况。

很多情况下，双下标其实也是通过排序降低时间复杂度的后置部分：排序过后的数组才能应用双下标。但是这种方法比较特殊，所以先单独拎出来。

题目：1048 Find Coins (25 分)

这道题几乎可以作为这类「双下标-归中」问题的模板题。

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she could only use exactly two coins to pay the exact amount. Since she has as many as 105 coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find two coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (≤105, the total number of coins) and M (≤103, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers no more than 500. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the two face values V1 and V2 (separated by a space) such that V1+V2=M and V1≤V2. If such a solution is not unique, output the one with the smallest V1. If there is no solution, output No Solution instead.

Sample Input 1:

8 15
1 2 8 7 2 4 11 15

Sample Output 1:

4 11

Sample Input 2:

7 14
1 8 7 2 4 11 15

Sample Output 2:

No Solution

思路

典型的在数组中寻找数据对的问题，用双下标非常合适。首先对数组排序，然后一头一尾开始寻找符合要求的数对。

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <cmath>
#include <cstdio>
#include <bitset>
using namespace std;

const int MAX = 100005;
const int INF = 0x3f3f3f3f;

int main(){
    // data & input
    int N, M;
    cin >> N >> M;
    int coin[MAX];
    for(int i=0; i<N; i++){
        scanf("%d", &coin[i]);
    }
    // main logic
    sort(coin, coin+N);
    int head = 0, tail = N-1;
    while(true){
        while(coin[head] + coin[tail] > M) tail--;
        if(head >= tail) break;
        if(coin[head] + coin[tail] == M){
            printf("%d %d", coin[head], coin[tail]);
            return 0;
        }
        head++;
    }
    // output
    printf("No Solution");
    return 0; 
}