[2016.4][京东暑期实习笔试]生日礼物

package bupt.syh;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

	private static Envelope card;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		List<Envelope> list = new ArrayList<Envelope>();
		while (in.hasNext()) {
			list.clear();
			int enveNum = in.nextInt();
			long cardX = in.nextLong();
			long cardY = in.nextLong();
			card = new Envelope(cardX, cardY);
			while (enveNum-- > 0) {
				long elX = in.nextLong();
				long elY = in.nextLong();
				Envelope envelop = new Envelope(elX, elY);
				list.add(envelop);
			}
			List<Integer> indexList = new ArrayList<Integer>(); // 信封的序号的序列
			List<List<Integer>> rstList = new ArrayList<List<Integer>>();  // 所有序列的集合
			helper(rstList, indexList, list);
			
			int maxEnvelopeNum = Integer.MIN_VALUE;
			List<Integer> longest = null;
			for (List<Integer> each : rstList) {
				if (maxEnvelopeNum < each.size()) {
					maxEnvelopeNum = each.size();
					longest = each;
				}
			}
			
			// print
			System.out.println(maxEnvelopeNum);
			StringBuilder builder = new StringBuilder();
			for (int i = 0; i < longest.size(); i++) {
				builder.append(longest.get(i) + 1 + " ");
			}
			System.out.println(builder.toString().trim());
		}
	}
	
	// 搜索
	public static void helper(List<List<Integer>> rstList, List<Integer> indexList, List<Envelope> enveLopeList) {
		Envelope outestEnvelope = null; // 当前最外层的信封
		if (indexList.isEmpty()) {
			outestEnvelope = card;
		} else {
			outestEnvelope = enveLopeList.get(indexList.get(indexList.size() - 1));
		}
		
		for (int i = 0; i < enveLopeList.size(); i++) {
			Envelope nextEnvelope = enveLopeList.get(i);
			if (outestEnvelope.canInto(nextEnvelope)) {
				indexList.add(i);
				helper(rstList, indexList, enveLopeList);
				indexList.remove(indexList.size() - 1); //取出来
			}
		}
		rstList.add(new ArrayList<Integer>(indexList));
	}
	
	static class Envelope {
		public long x;
		public long y;
		
		public Envelope(long x, long y) {
			super();
			this.x = x;
			this.y = y;
		}
		
		// 可不可以放的进
		public boolean canInto(Envelope el) {
			if (x < el.x && y < el.y) {
				return true;
			} else {
				return false;
			}
		}
		
	}
	
	
}


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值