ICPC過去問
Problem A: Ohgas' Fortune
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1135&lang=jp
解放:各値ずつ、シミュレーションしていきvectorに放り込む、最後にmax_elementで抽出
includeやテンプレは省略
テンプレ:http://henteko07.hatenablog.com/entry/2012/06/18/001535
int main() { int m = cin_i(); REP(i,m) { int start = cin_i(); int nen = cin_i(); int n = cin_i(); VI sum; REP(j,n) { int tan_hu = cin_i(); double riritsu; cin >> riritsu; int tesu = cin_i(); int num = start,rishi = 0; REP(k,nen) { if(tan_hu == 0) { rishi += (int)(num * riritsu); num -= tesu; }else { num += (int)(num * riritsu); num -= tesu; } } sum.PB(num + rishi); } VI::iterator it = max_element(ALL(sum)); cout << *it << endl; } }