「FZU2281」Trades【第一次写java】

Trades

This is a very easy problem.

ACMeow loves $GTX1920.$ Now he has $m$ $RMB$, but no $GTX1920s$. In the next $n$ days, the unit price of $GTX1920$ in the $i-th$ day is $C_i$ $RMB.$ In other words, in the $i-th$ day, he can buy one $GTX1920$ with $C_i$ $RMB$, or sell one $GTX1920$ to gain $C_i$ $RMB.$ He can buy or sell as many times as he wants in one day, but make sure that he has enough money for buying or enough $GTX1920$ for selling.

Now he wants to know, how many $RMB$ can he get after the n days. Could you please help him?

It’s really easy, yeah?

Input

First line contains an integer $T(1\le T\le 20)$, represents there are $T$ test cases.

For each test case: first line contains two integers $n(1\le n\le 2000)$ and $m(0\le m\le 1000000000).$ Following $n$ integers in one line, the $i-th$ integer represents $C_i(1\le C_i\le 1000000000).$

Output

For each test case, output “Case #X: Y” in a line (without quotes), where $X$ is the case number starting from $1$, and $Y$ is the maximum number of $RMB$ he can get mod $1000000007.$

Sample Input

2
3 1
1 2 3
4 1
1 2 1 2

Sample Output

Case #1: 3
Case #2: 4

题意

• 就是有$n$天，你开始有$m$元钱，每天的显卡都有一个价格，你可以选择把手中的一些显卡卖掉或者买进一些显卡（只要钱够），问最后你手上最多有多少钱

题解

• 昨天才开始学的一节课的$java$,今天就遇到了还是很开心$QWQ$
• 贪心：在一段连续的单调区间内，低谷买进显卡，高峰卖掉显卡，只不过可能会爆$longlong$，比如$110^{9}110^{9}1....$这种情况，所以直接可以用$java$来写

代码

import java.util.*;
import java.math.*;

public class Main {
	public static void main(String args[]){
		int[] a=new int[2005];
		Scanner in=new Scanner(System.in);
		int t=in.nextInt();
		for(int cas=1;cas<=t;cas++) {
			int n=in.nextInt(),m=in.nextInt();
			for(int i=1;i<=n;i++) a[i]=in.nextInt();
			
			int l=1,r=1;
			boolean inc=true;
			while(r<n) {
				if(inc) {
					int pos=r;
					while(r<n&&a[r+1]>=a[r]) r++;
					if(a[pos]!=a[r]) a[++l]=a[r];
					inc=false;
				}else{
					int pos=r;
					while(r<n&&a[r+1]<=a[r]) r++;
					if(a[pos]!=a[r]) a[++l]=a[r];
					inc=true;
				}
			}
			n=l;
			BigInteger money=BigInteger.valueOf(m),have=BigInteger.valueOf(0);
			System.out.print("Case #"+cas+": ");
			if(n==1) {
				System.out.println(m);
				continue;
			}
			if(a[2]>a[1]) {
				have=money.divide(BigInteger.valueOf(a[1]));
				money=money.mod(BigInteger.valueOf(a[1]));
			}
			for(int i=2;i<=n;i++) {
				BigInteger c=BigInteger.valueOf(a[i]);
				if(a[i]>a[i-1]) {
					
					money=money.add(c.multiply(have));
					have=BigInteger.valueOf(0);
				}else {
					have=have.add(money.divide(c));
					money=money.mod(c);
				}
			}
			BigInteger c=BigInteger.valueOf(a[n]);
			money=money.add(c.multiply(have));
			System.out.println(money.mod(BigInteger.valueOf(1000000007)));
		}
	}
}