1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","9362","static/chunks/9362-e9f488fde79ed646.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","9992","static/chunks/9992-c6b29c96d53cc0fe.js","9211","static/chunks/9211-2c147ebefe26b47c.js","9791","static/chunks/app/submission/%5Bid%5D/page-47099a350c9e7e40.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","9362","static/chunks/9362-e9f488fde79ed646.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","9992","static/chunks/9992-c6b29c96d53cc0fe.js","9211","static/chunks/9211-2c147ebefe26b47c.js","9791","static/chunks/app/submission/%5Bid%5D/page-47099a350c9e7e40.js"],"TestCaseDisplay"] 1b:T739,#include #include int arr[100000]; int main() { int i,n,x, pindex=-1, u, d, m, min=2000000001, min1, min2, usum, dsum, sum; scanf("%d", &n); for (i=0;i=0 && pindex==-1) pindex=i; arr[i]=x; } if (0 1){ m=(u+d)/2; if (arr[i]+arr[m] < 0) d=m; else u=m; } usum=arr[i]+arr[u]; dsum=arr[i]+arr[d]; if (dsum<0) dsum=-dsum; if (usum<0) usum=-usum; if (dsum

제출 #83194

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: