{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n section pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"Enunciado do Problema","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eHá \u003cvar\u003e\\(N\\)\u003c/var\u003e pedras, numeradas de \u003cvar\u003e\\(1, 2, \\ldots, N\\)\u003c/var\u003e.\nPara cada \u003cvar\u003e\\(i\\)\u003c/var\u003e (\u003cvar\u003e\\(1 \\leq i \\leq N\\)\u003c/var\u003e), a altura da Pedra \u003cvar\u003e\\(i\\)\u003c/var\u003e é \u003cvar\u003e\\(h_i\\)\u003c/var\u003e.\u003c/p\u003e\n\u003cp\u003eHá um sapo que está inicialmente na Pedra \u003cvar\u003e\\(1\\)\u003c/var\u003e.\nEle irá repetir a seguinte ação algumas vezes para alcançar a Pedra \u003cvar\u003e\\(N\\)\u003c/var\u003e:\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003eSe o sapo estiver atualmente na Pedra \u003cvar\u003e\\(i\\)\u003c/var\u003e, pule para a Pedra \u003cvar\u003e\\(i + 1\\)\u003c/var\u003e ou Pedra \u003cvar\u003e\\(i + 2\\)\u003c/var\u003e. Aqui, um custo de \u003cvar\u003e\\(|h_i - h_j|\\)\u003c/var\u003e é incorrido, onde \u003cvar\u003e\\(j\\)\u003c/var\u003e é a pedra para aterrissar.\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp\u003eEncontre o custo total mínimo possível incorrido antes do sapo alcançar a Pedra \u003cvar\u003e\\(N\\)\u003c/var\u003e.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Restrições","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cul\u003e\n\u003cli\u003eTodos os valores de entrada são inteiros.\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(2 \\leq N \\leq 10^5\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(1 \\leq h_i \\leq 10^4\\)\u003c/var\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/section\u003e"}},{"title":"Entrada","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eA entrada é dada a partir da Entrada Padrão no seguinte formato:\u003c/p\u003e\n\u003cpre\u003e\u003cvar\u003e\\(N\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(h_1\\)\u003c/var\u003e \u003cvar\u003e\\(h_2\\)\u003c/var\u003e \u003cvar\u003e\\(\\ldots\\)\u003c/var\u003e \u003cvar\u003e\\(h_N\\)\u003c/var\u003e\r\n\u003c/pre\u003e\n\n\u003c/section\u003e"}},{"title":"Saída","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eImprima o custo total mínimo possível incorrido.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Exemplo 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4\r\n10 30 40 20\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e30\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\n\u003csection\u003e\n\n\n\u003c/section\u003e\n\n\u003csection\u003e\n\n\n\u003cp\u003eSe seguirmos o caminho \u003cvar\u003e\\(1\\)\u003c/var\u003e → \u003cvar\u003e\\(2\\)\u003c/var\u003e → \u003cvar\u003e\\(4\\)\u003c/var\u003e, o custo total incorrido seria \u003cvar\u003e\\(|10 - 30| + |30 - 20| \u003d 30\\)\u003c/var\u003e.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Exemplo 2","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n10 10\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\n\u003csection\u003e\n\n\n\u003c/section\u003e\n\n\u003csection\u003e\n\n\n\u003cp\u003eSe seguirmos o caminho \u003cvar\u003e\\(1\\)\u003c/var\u003e → \u003cvar\u003e\\(2\\)\u003c/var\u003e, o custo total incorrido seria \u003cvar\u003e\\(|10 - 10| \u003d 0\\)\u003c/var\u003e.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Exemplo 3","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e6\r\n30 10 60 10 60 50\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e40\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\n\u003csection\u003e\n\n\n\u003c/section\u003e\n\n\u003csection\u003e\n\n\n\u003cp\u003eSe seguirmos o caminho \u003cvar\u003e\\(1\\)\u003c/var\u003e → \u003cvar\u003e\\(3\\)\u003c/var\u003e → \u003cvar\u003e\\(5\\)\u003c/var\u003e → \u003cvar\u003e\\(6\\)\u003c/var\u003e, o custo total incorrido seria \u003cvar\u003e\\(|30 - 60| + |60 - 60| + |60 - 50| \u003d 40\\)\u003c/var\u003e.\u003c/p\u003e\u003c/section\u003e"}}]}