제출 #676270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676270		Toxtaq	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	300 KiB

segments

#include <bits/stdc++.h>
using namespace std;
int check(int mid, vector<int>&v, vector<int>&suff){
    int temp = 0, prev = -1, indx = 0, result = 0;
    while(temp <= mid)temp += v[indx++];
    prev = temp;
    temp = 0;
    if(prev < mid)return 0;
    result++;
    for(int i = indx;i < v.size();++i){
        temp += v[i];
        if(prev <= temp){
            if(i != v.size() - 1 && suff[i + 1] < temp){
                return result + 1;
            }
            else{
                result++;
                prev = temp;
                temp = 0;
            }
        }
    }
    return result;
}
int main()
{
    int n;
    cin >> n;
    vector<int>v(n), suff(n);
    for(int i = 0;i < n;++i)cin >> v[i];
    suff[n - 1] = v[n - 1];
    for(int i = n - 2;i >= 0;--i)suff[i] = suff[i + 1] + v[i];
    int l = 1, r = 1e9, Mx = 0;
    for(int i = 1;i < 1e3;++i){
        Mx = max(Mx, check(i, v, suff));
    }
    cout << Mx;
}

컴파일 시 표준 에러 (stderr) 메시지

segments.cpp: In function 'int check(int, std::vector<int>&, std::vector<int>&)':
segments.cpp:10:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i = indx;i < v.size();++i){
      |                      ~~^~~~~~~~~~
segments.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |             if(i != v.size() - 1 && suff[i + 1] < temp){
      |                ~~^~~~~~~~~~~~~~~
segments.cpp: In function 'int main()':
segments.cpp:33:9: warning: unused variable 'l' [-Wunused-variable]
   33 |     int l = 1, r = 1e9, Mx = 0;
      |         ^
segments.cpp:33:16: warning: unused variable 'r' [-Wunused-variable]
   33 |     int l = 1, r = 1e9, Mx = 0;
      |                ^

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27