1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T41e,#ifndef _CRT_SECURE_NO_WARNINGS #define _CRT_SECURE_NO_WARNINGS #endif #include using namespace std; int numarr[100000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); freopen("input.txt", "r", stdin); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> numarr[i]; } int s = 0, e = 0; int sum = numarr[0]; int ans = 200000; while (s < n) { //cout << s << ' ' << e << " " << sum << "\n"; if (e == n - 1) { sum -= numarr[s++]; if (sum >= m) { ans = min(ans, e - s + 1); } continue; } if (s > e) { sum = numarr[s], e = s; if (sum >= m) { ans = min(ans, e - s + 1); } continue; } if (sum < m) { sum += numarr[++e]; if (sum >= m) { ans = min(ans, e - s + 1); } } else { sum -= numarr[s++]; if (sum >= m) { ans = min(ans, e - s + 1); } } } if (ans == 200000) cout << 0; else cout << ans; return 0; } /* for

제출 #115308

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: