답안 #129984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
129984	2019-07-13T17:24:37 Z	Vardanyan	Hacker (BOI15_hac)	C++14	40 / 100	1000 ms	1656 KB

hac

#include <bits/stdc++.h>
using namespace std;

const int N = 500*1000+5;
int a[N];
long long pref[N];
int main(){
    ios_base::sync_with_stdio(false);
    int n;
    cin>>n;
    long long all = 0;
    for(int i = 1;i<=n;i++) {
        cin>>a[i];
        all+=a[i];
        pref[i] = pref[i-1]+a[i];
    }
    long long ans = 0;
    for(int i = 1;i<=n;i++){
        long long mx = 0;
        for(int j = 1;j<=n;j++){
            int jj = j;
            int qn = 0;
            long long cur = 0;
            /*while(1){
                if(jj == i) break;
                cur+=a[jj];
                qn++;
                if(qn == n/2) break;
                jj++;
                if(jj>n) jj = 1;
            }*/
            int l = j;
            int r = j+n/2-1;
            if(r>n) r = (r-n);
            if(r>=l){
                if(i<l || i>r){
                    cur = pref[r]-pref[l-1];
                }
            }
            else{
                if(i>r && i<l){
                    cur+=(pref[r]);
                    cur+=(pref[n]-pref[l-1]);
                }
            }
            mx = max(mx,cur);
        }
        ans = max(ans,all-mx);
    }
    cout<<ans<<endl;

    return 0;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:21:17: warning: unused variable 'jj' [-Wunused-variable]
             int jj = j;
                 ^~
hac.cpp:22:17: warning: unused variable 'qn' [-Wunused-variable]
             int qn = 0;
                 ^~

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	248 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	380 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	248 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	380 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	4 ms	376 KB	Output is correct
21	Correct	3 ms	504 KB	Output is correct
22	Correct	22 ms	376 KB	Output is correct
23	Correct	58 ms	508 KB	Output is correct
24	Correct	23 ms	376 KB	Output is correct
25	Correct	58 ms	476 KB	Output is correct
26	Correct	58 ms	504 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	58 ms	504 KB	Output is correct
31	Correct	58 ms	504 KB	Output is correct

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	60 ms	456 KB	Output is correct
4	Execution timed out	1070 ms	1656 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	248 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	380 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	4 ms	376 KB	Output is correct
21	Correct	3 ms	504 KB	Output is correct
22	Correct	22 ms	376 KB	Output is correct
23	Correct	58 ms	508 KB	Output is correct
24	Correct	23 ms	376 KB	Output is correct
25	Correct	58 ms	476 KB	Output is correct
26	Correct	58 ms	504 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	58 ms	504 KB	Output is correct
31	Correct	58 ms	504 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	60 ms	456 KB	Output is correct
35	Execution timed out	1070 ms	1656 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-