#include <iostream>
#include <vector> 
 
using namespace std;
 
int find_max(vector<int>a) { 
  int max=0; 
  for(int i=0;i<a.size();i++) if(a[i]>max) max=i; 
  return max; 
}
 
int main() {
 vector<int> test;   // Deklaration 
 test.reserve(7);    // Speicher-Reservierung 
 test.push_back(10); // F 
 test.push_back(45); // u 
 test.push_back(12); // e 
 test.push_back(23); // l 
 test.push_back(39); // l 
 test.push_back(63); // e 
 test.push_back(33); // n 
 
 int idx_of_max = find_max(test); // Wird 5 sein, da das vorletzte Element 
                                  // mit 63 den hoechsten Wert beinhaltet	
 cout << idx_of_max;                                 
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPiAKCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgZmluZF9tYXgodmVjdG9yPGludD5hKSB7IAogIGludCBtYXg9MDsgCiAgZm9yKGludCBpPTA7aTxhLnNpemUoKTtpKyspIGlmKGFbaV0+bWF4KSBtYXg9aTsgCiAgcmV0dXJuIG1heDsgCn0KCmludCBtYWluKCkgewogdmVjdG9yPGludD4gdGVzdDsgICAvLyBEZWtsYXJhdGlvbiAKIHRlc3QucmVzZXJ2ZSg3KTsgICAgLy8gU3BlaWNoZXItUmVzZXJ2aWVydW5nIAogdGVzdC5wdXNoX2JhY2soMTApOyAvLyBGIAogdGVzdC5wdXNoX2JhY2soNDUpOyAvLyB1IAogdGVzdC5wdXNoX2JhY2soMTIpOyAvLyBlIAogdGVzdC5wdXNoX2JhY2soMjMpOyAvLyBsIAogdGVzdC5wdXNoX2JhY2soMzkpOyAvLyBsIAogdGVzdC5wdXNoX2JhY2soNjMpOyAvLyBlIAogdGVzdC5wdXNoX2JhY2soMzMpOyAvLyBuIAogICAKIGludCBpZHhfb2ZfbWF4ID0gZmluZF9tYXgodGVzdCk7IC8vIFdpcmQgNSBzZWluLCBkYSBkYXMgdm9ybGV0enRlIEVsZW1lbnQgCiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAvLyBtaXQgNjMgZGVuIGhvZWNoc3RlbiBXZXJ0IGJlaW5oYWx0ZXQJCiBjb3V0IDw8IGlkeF9vZl9tYXg7ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgCn0=