# 2015672, 2024-09-28 10:30:19, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[10010];
int N;
int calcualte_max_power(int shift) {
int power{beads[shift]};
int last_bead{beads[shift]};
int remove_quota{1};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
// std::cout << beads[i] << " ";
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota) {
remove_quota--;
continue;
}
else if (beads[i] < last_bead) {
return power;
}
else {
power += beads[i];
last_bead = beads[i];
}
}
// std::cout << "=";
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{static_cast<int>(-1e9)};
for (int shift{0}; shift < N; ++shift) {
// std::cout << calcualte_max_power(shift) << "\n";
mxx = std::max(mxx, calcualte_max_power(shift));
}
std::cout << mxx << "\n";
} | # 2015771, 2024-09-28 10:41:23, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[10010];
int N;
int calcualte_max_power(int shift) {
int power{beads[shift]};
int last_bead{beads[shift]};
int remove_quota{1};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota) {
remove_quota--;
continue;
}
else if (beads[i] < last_bead) {
return power;
}
else {
power += beads[i];
last_bead = beads[i];
}
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift));
}
std::cout << mxx << "\n";
} | # 2015782, 2024-09-28 10:42:47, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[10010];
int N;
int calcualte_max_power(int shift) {
int power{beads[shift]};
int last_bead{beads[shift]};
int remove_quota{1};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && !remove_quota) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift));
}
std::cout << mxx << "\n";
} | # 2015799, 2024-09-28 10:44:08, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[1001];
int N;
int calcualte_max_power(int shift) {
int power{beads[shift]};
int last_bead{beads[shift]};
int remove_quota{1};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift));
}
std::cout << mxx << "\n";
} | # 2015858, 2024-09-28 10:51:06, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[1001];
int N;
int calcualte_max_power(int shift, int remove_quota) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max({mxx, calcualte_max_power(shift, 1), calcualte_max_power(shift, 0)});
}
std::cout << mxx << "\n";
} | # 2015917, 2024-09-28 10:56:26, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[1001];
int N;
int calcualte_max_power(int shift, int remove_quota) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift <= N; ++shift) {
mxx = std::max({mxx, calcualte_max_power(shift, 1), calcualte_max_power(shift, 0)});
}
std::cout << mxx << "\n";
} | # 2015923, 2024-09-28 10:56:45, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[1001];
int N;
int calcualte_max_power(int shift, int remove_quota) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt <= N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max({mxx, calcualte_max_power(shift, 1), calcualte_max_power(shift, 0)});
}
std::cout << mxx << "\n";
} | # 2015938, 2024-09-28 10:57:27, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[1001];
int N;
int calcualte_max_power(int shift, int remove_quota) {
int power{0};
int last_bead{0};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max({mxx, calcualte_max_power(shift, 1), calcualte_max_power(shift, 0)});
}
std::cout << mxx << "\n";
} | # 2015945, 2024-09-28 10:58:07, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[1001];
int N;
int calcualte_max_power(int shift, int remove_quota) {
int power{0};
int last_bead{0};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (beads[i] < last_bead && remove_quota != 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max({mxx, calcualte_max_power(shift, 1), calcualte_max_power(shift, 0)});
}
std::cout << mxx << "\n";
} | # 2015975, 2024-09-28 11:00:55, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500];
int N;
int calcualte_max_power(int shift, int remove_quota) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift <= N; ++shift) {
mxx = std::max({mxx, calcualte_max_power(shift, 1), calcualte_max_power(shift, 0)});
}
std::cout << mxx << "\n";
} | # 2015981, 2024-09-28 11:01:15, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500];
int N;
int calcualte_max_power(int shift, int remove_quota) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift <= N; ++shift) {
mxx = std::max({mxx, calcualte_max_power(shift, 1), calcualte_max_power(shift, 0)});
}
std::cout << mxx;
} | # 2015994, 2024-09-28 11:02:12, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500];
int N;
int calcualte_max_power(int shift, int remove_quota) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016070, 2024-09-28 11:10:17, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500];
int N=0;
int calcualte_max_power(int shift, int remove_quota) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016074, 2024-09-28 11:10:39, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N=0;
int calcualte_max_power(int shift, int remove_quota) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016097, 2024-09-28 11:12:54, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 0));
}
std::cout << mxx;
} | # 2016101, 2024-09-28 11:13:05, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016206, 2024-09-28 11:23:37, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
long long beads[5000] = {0};
long long N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
// for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N)
// std::cout << beads[i] << " ";
// std::cout << "\n";
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 0));
}
std::cout << mxx;
} | # 2016214, 2024-09-28 11:24:13, PPPPPPPPP----PP--PP- (65%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
std::cout << "\n";
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 2));
}
std::cout << mxx;
} | # 2016216, 2024-09-28 11:24:25, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
std::cout << "\n";
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016243, 2024-09-28 11:27:19, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016248, 2024-09-28 11:27:46, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{0};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016458, 2024-09-28 11:43:14, ----P---P-----P-PPP- (30%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
last_bead = beads[i];
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{0};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016469, 2024-09-28 11:43:41, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int shift, int remove_quota=1) {
int power{beads[shift]};
int last_bead{beads[shift]};
for (int i{shift}, cnt{0}; cnt < N; ++cnt, i=(i+1)%N) {
if (i == shift) continue;
if (beads[i] < last_bead && remove_quota > 0) {
remove_quota--;
continue;
}
if (beads[i] < last_bead && remove_quota == 0) {
return power;
}
power += beads[i];
last_bead = beads[i];
}
return power;
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{-1};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 1));
}
std::cout << mxx;
} | # 2016569, 2024-09-28 11:50:22, PPPPPPPPPPPPPPPPPPPP (100%)
#include <bits/stdc++.h>
int beads[500] = {0};
int N = 0;
int calcualte_max_power(int position, int cnt, int remove_quota, int power, int last_bead) {
if (cnt == N || (remove_quota == 0 && (beads[position] < last_bead))) {
return power;
}
if (beads[position] < last_bead && remove_quota) {
return calcualte_max_power((position+1)%N, cnt+1, remove_quota-1, power, last_bead);
}
if (remove_quota)
return std::max(calcualte_max_power((position+1)%N, cnt+1, remove_quota, power+beads[position], beads[position]),
calcualte_max_power((position+1)%N, cnt+1, remove_quota-1, power, last_bead));
return calcualte_max_power((position+1)%N, cnt+1, remove_quota, power+beads[position], beads[position]);
}
int main() {
std::cin >> N;
for (int i{0}; i < N; ++i) {
std::cin >> beads[i];
}
int mxx{0};
for (int shift{0}; shift < N; ++shift) {
mxx = std::max(mxx, calcualte_max_power(shift, 0, 1, 0, 0));
}
std::cout << mxx;
} |
# 2015749, 2024-09-28 10:38:36, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
int mx = 0;
for(int i = 0; i < n; i++) {
int cnt = 0, sum = 0, j = i, tmp;
bool vis[501] = {false}, skip = false;
while(cnt < n) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp && !skip) {
j++;
skip = true;
} else {
break;
}
cnt++;
}
// cout << sum << '\n';
mx = max(mx,sum);
}
cout << mx;
} | # 2015779, 2024-09-28 10:42:09, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[501] = {false}, skip = false;
while(cnt < n) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp && !skip) {
j++;
skip = true;
} else {
break;
}
cnt++;
}
// cout << sum << '\n';
mx = max(mx,sum);
}
cout << mx;
} | # 2015808, 2024-09-28 10:44:48, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[501] = {false}, skip = false;
while(cnt < n) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp && !skip) {
j++;
skip = true;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
// cout << sum << '\n';
mx = max(mx,sum);
}
cout << mx;
} | # 2015863, 2024-09-28 10:51:31, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[501] = {false}, skip = false;
while(cnt < n) {
if(j > n-1) {
j -= n;
}
if(vis[j] && !skip) {
skip = true;
j++;
continue;
} else if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp && !skip) {
j++;
skip = true;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
// cout << sum << '\n';
mx = max(mx,sum);
}
cout << mx;
} | # 2015934, 2024-09-28 10:57:17, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[501] = {false}, skip = false;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp && !skip) {
j++;
skip = true;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
// cout << sum << '\n';
mx = max(mx,sum);
}
cout << mx;
} | # 2015946, 2024-09-28 10:58:11, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[10001] = {false}, skip = false;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp && !skip) {
j++;
skip = true;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
// cout << sum << '\n';
mx = max(mx,sum);
}
cout << mx;
} | # 2016147, 2024-09-28 11:18:07, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[501] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[501] = {false};
if(k == n-1) skip[0] = true;
else skip[k+1] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(skip[j]) {
j++;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
if(k == n-1) skip[0] = false;
else skip[k+1] = false;
// cout << sum << '\n';
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016173, 2024-09-28 11:20:19, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[501] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[501] = {false};
if(k == n-1) skip[0] = true;
else skip[k] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(skip[j]) {
j++;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
if(k == n-1) skip[0] = false;
else skip[k] = false;
// cout << sum << '\n';
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016198, 2024-09-28 11:23:04, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[10001];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[10001] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[10001] = {false};
skip[k] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(skip[j]) {
j++;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
skip[k] = false;
// cout << sum << '\n';
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016237, 2024-09-28 11:26:47, PPPP-PPPPPPPPPPPP-PP (90%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[10001];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[10001] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[10001] = {false};
skip[k] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(skip[j]) {
j++;
} else if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
skip[k] = false;
// cout << sum << '\n';
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016257, 2024-09-28 11:29:19, PPPP-PPPPPPPPPPPP-PP (90%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[10001];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[10001] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp = arr[j];
bool vis[10001] = {false};
skip[k] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(skip[j]) {
j++;
} else if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
skip[k] = false;
// cout << sum << '\n';
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016268, 2024-09-28 11:30:12, PPPP-PPPPPPPPPPPP-PP (90%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[10001];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[10001] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp = arr[j];
bool vis[10001] = {false};
skip[k] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(skip[j]) {
j++;
continue;
} else if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
skip[k] = false;
// cout << sum << '\n';
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016300, 2024-09-28 11:32:19, PPPP-PPPPPPPPPPPP-PP (90%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[10001];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[10001] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp = arr[j];
bool vis[10001] = {false};
if(k == n-1) skip[0] = true;
else skip[k+1] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(skip[j]) {
j++;
continue;
} else if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
if(k == n-1) skip[0] = false;
else skip[k+1] = false;
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016322, 2024-09-28 11:34:09, PPPP-PPPPPPPPPPPP-PP (90%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[10001];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[10001] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[10001] = {false};
if(k == n-1) skip[0] = true;
else skip[k+1] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(skip[j]) {
j++;
continue;
} else if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp) {
break;
}
cnt++;
}
if(k == n-1) skip[0] = false;
else skip[k+1] = false;
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016362, 2024-09-28 11:36:43, PPPP-PPPPPPPPPPPP-PP (90%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[10001];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[10001] = {false};
for(int k = 0; k < n; k++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[10001] = {false};
skip[k] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(skip[j]) {
j++;
} else if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
cnt++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp) {
break;
}
}
skip[k] = false;
mx = max(mx,sum);
}
}
cout << mx;
} | # 2016457, 2024-09-28 11:43:13, PPPPPPPPPPPPPPPPPPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[10001];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
long long mx = 0;
for(int i = 0; i < n; i++) {
bool skip[10001] = {false};
for(int k = 0; k < n+1; k++) {
long long cnt = 0, sum = 0, j = i, tmp;
bool vis[10001] = {false};
skip[k] = true;
while(1) {
if(j > n-1) {
j -= n;
}
if(vis[j]) {
break;
}
vis[j] = true;
if(skip[j]) {
j++;
} else if(cnt == 0) {
sum += arr[j];
tmp = arr[j];
j++;
cnt++;
} else if(arr[j] >= tmp) {
sum += arr[j];
tmp = arr[j];
j++;
} else if(arr[j] < tmp) {
break;
}
}
skip[k] = false;
mx = max(mx,sum);
}
}
cout << mx;
} |
# 2016115, 2024-09-28 11:15:12, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
} | # 2016124, 2024-09-28 11:15:42, P--PPPPPPPPPPPPPPPPP (90%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
cout<<max;
} | # 2016209, 2024-09-28 11:23:49, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
bool wasperfect=false;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
if(j==n-1){
wasperfect=true;
}
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
if(!wasperfect){
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
}
cout<<max;
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
cout<<max;
} | # 2016212, 2024-09-28 11:24:01, P--PPPPPPPPPPPPPPPPP (90%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
bool wasperfect=false;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
if(j==n-1){
wasperfect=true;
}
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
if(!wasperfect){
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
}
cout<<max;
} | # 2016279, 2024-09-28 11:30:50, P--PPPPPPPPPPPPPPPPP (90%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
bool wasperfect=false;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
if(j==n-1){
wasperfect=true;
}
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
if(!wasperfect){
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
}
cout<<max;
} | # 2016387, 2024-09-28 11:39:13, ---PPPPPPPPPPPPPPPPP (85%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
bool wasperfect=false;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
if(j==n-1){
wasperfect=true;
}
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
if(!wasperfect){
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
}
cout<<max;
} | # 2016419, 2024-09-28 11:41:12, P--PPPPPPPPPPPPPPPPP (90%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
bool wasperfect=false;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
if(j==n-1){
wasperfect=true;
}
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
if(!wasperfect){
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
}
cout<<max;
} | # 2016471, 2024-09-28 11:43:45, P--PPPPPPPPPPPPPPPPP (90%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
continue;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
cout<<max;
} | # 2016499, 2024-09-28 11:45:39, PPPPPPPPPPPPPPPPPPPP (100%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
}
//normal count
int max=0;
int score=0;
int ij=0;
int last=-1;
for(int i=0;i<n;i++){ //each start
score=0;
last=-1;
for(int j=0;j<n;j++){
ij=i+j;
if(ij>n-1){
ij-=n;
}
if(bead[ij]<last){
break;
}
score+=bead[ij];
last=bead[ij];
}
if(score>max){
max=score;
}
}
int temp[n-1];
int shift;
int kv=0;
for(int i=0;i<n;i++){
shift=0;
for(int j=0;j<n-1;j++){// make a copy
if(j==i){
shift=1;
}
temp[j]=bead[j+shift];
}
for(int k=0;k<n-1;k++){ //each start
score=0;
last=-1;
for(int v=0;v<n-1;v++){
kv=k+v;
if(kv>n-2){
kv-=n-1;
}
if(temp[kv]<last){
break;
}
score+=temp[kv];
last=temp[kv];
}
if(score>max){
max=score;
}
}
}
cout<<max;
} |
# 2018132, 2024-09-28 14:36:48, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int nums;
cin >> nums;
vector<int> all;
for(int i =0 ;i<nums;i++){
int input;
cin >> input;
all.push_back(input);
}
int MAX = 0;
for(int i =0;i<nums+1;i++){
vector<int> jj = all;
if(i == 0){
}else{
jj.erase(jj.begin()+i-1);
}
int use_i = i -1;
int SumLoop = 0;
for(int j =0;j<jj.size();j++){
if(jj[i+1] < jj[i] ){
break;
}else{
SumLoop += jj[i];
}
}
if(SumLoop > MAX){
MAX = SumLoop;
}
}
cout << MAX;
} | # 2018149, 2024-09-28 14:38:43, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int nums;
cin >> nums;
vector<int> all;
for(int i =0 ;i<nums;i++){
int input;
cin >> input;
all.push_back(input);
}
int MAX = 0;
for(int i =0;i<nums+1;i++){
vector<int> jj = all;
if(i == 0){
}else{
jj.erase(jj.begin()+i-1);
}
int use_i = i -1;
int SumLoop = 0;
for(int j =0;j<jj.size();j++){
if(jj[use_i+1] < jj[use_i] ){
break;
}else{
SumLoop += jj[use_i];
}
}
if(SumLoop > MAX){
MAX = SumLoop;
}
}
cout << MAX << endl;
} | # 2018165, 2024-09-28 14:39:57, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int nums;
cin >> nums;
vector<int> all;
for(int i =0 ;i<nums;i++){
int input;
cin >> input;
all.push_back(input);
}
int MAX = 0;
for(int i =0;i<nums+1;i++){
vector<int> jj = all;
if(i == 0){
}else{
jj.erase(jj.begin()+i-1);
}
int use_i = i -1;
int SumLoop = 0;
for(int j =0;j<jj.size();j++){
if(jj[use_i+1] > jj[use_i] ){
break;
}else{
SumLoop += jj[use_i];
}
}
if(SumLoop > MAX){
MAX = SumLoop;
}
}
cout << MAX << endl;
} | # 2018233, 2024-09-28 14:44:53, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int nums;
cin >> nums;
vector<int> all;
for(int i =0 ;i<nums;i++){
int input;
cin >> input;
all.push_back(input);
}
int MAX = 0;
for(int i =0;i<nums+1;i++){
vector<int> jj = all;
int use_i;
if(i == 0){
use_i = i;
}else{
jj.erase(jj.begin()+i-1);
use_i = i -1;
}
int SumLoop = 0;
for(int j =0;j<jj.size();j++){
if(j == jj.size()-1){
SumLoop += jj[j];
}
else if(jj[j+1] > jj[j] ){
break;
}else{
SumLoop += jj[j];
}
}
if(SumLoop > MAX){
MAX = SumLoop;
}
}
cout << MAX << endl;
} | # 2018240, 2024-09-28 14:45:31, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int nums;
cin >> nums;
vector<int> all;
for(int i =0 ;i<nums;i++){
int input;
cin >> input;
all.push_back(input);
}
int MAX = 0;
for(int i =0;i<nums+1;i++){
vector<int> jj = all;
int use_i;
if(i == 0){
use_i = i;
}else{
jj.erase(jj.begin()+i-1);
use_i = i -1;
}
int SumLoop = 0;
for(int j =0;j<jj.size();j++){
if(j == jj.size()-1){
SumLoop += jj[j];
}
else if(jj[j+1] > jj[j] ){
break;
}else{
SumLoop += jj[j];
}
}
if(SumLoop > MAX){
MAX = SumLoop;
}
}
cout << MAX;
} | # 2018313, 2024-09-28 14:52:21, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int nums;
cin >> nums;
vector<int> all;
for(int i =0 ;i<nums;i++){
int input;
cin >> input;
all.push_back(input);
}
int MAX = 0;
for(int i =0;i<nums+1;i++){
vector<int> jj = all;
int use_i;
if(i == 0){
use_i = i;
}else{
jj.erase(jj.begin()+i-1);
use_i = i -1;
}
int SumLoop = 0;
for(int j =0;j<jj.size();j++){
SumLoop += jj[j];
if(jj[j+1]>jj[j]){
break;
}
}
if(SumLoop > MAX){
MAX = SumLoop;
}
}
cout << MAX;
} | # 2018348, 2024-09-28 14:54:35, PP----PPPPPP-------- (40%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int nums;
cin >> nums;
vector<int> all;
for(int i =0 ;i<nums;i++){
int input;
cin >> input;
all.push_back(input);
}
int MAX = 0;
for(int i =0;i<nums+1;i++){
vector<int> jj = all;
int use_i;
if(i == 0){
use_i = i;
}else{
jj.erase(jj.begin()+i-1);
use_i = i -1;
}
int SumLoop = 0;
for(int j =0;j<jj.size();j++){
SumLoop += jj[j];
if(jj[j+1]<jj[j]){
break;
}
}
if(SumLoop > MAX){
MAX = SumLoop;
}
}
cout << MAX;
} | # 2018463, 2024-09-28 15:02:31, PPPPPPPPPPPPPPPPPPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int nums;
cin >> nums;
vector<int> all;
for(int i =0 ;i<nums;i++){
int input;
cin >> input;
all.push_back(input);
}
int MAX = 0;
for(int z = 0;z<all.size()-1;z++){
vector<int> temp = all;
rotate(temp.begin(),temp.begin()+z,temp.end());
for(int i =0;i<nums+1;i++){
vector<int> jj = temp;
int use_i;
if(i == 0){
use_i = i;
}else{
jj.erase(jj.begin()+i-1);
use_i = i -1;
}
int SumLoop = 0;
for(int j =0;j<jj.size();j++){
SumLoop += jj[j];
if(jj[j+1]<jj[j]){
break;
}
}
if(SumLoop > MAX){
MAX = SumLoop;
}
}
}
cout << MAX;
} |
# 2017475, 2024-09-28 13:32:25, PPPPPPPP---------P-- (45%)
#include "bits/stdc++.h"
using namespace std;
queue <int> q;
int main(){
int n;
cin >> n;
int maxx = INT_MIN;
int prev = 0;
for(int i=0;i<n;i++){
int tmp;
cin >> tmp;
q.push(tmp);
}
for(int i=0;i<n;i++){
q.push(q.front());
q.pop();
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
//cout << cur << "\n";
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
//cout << cur << "\n";
if(!found) maxx = max(cur,maxx);
}
cout << maxx;
return 0;
} | # 2017677, 2024-09-28 13:56:52, PPPPPPPP---------P-- (45%)
#include "bits/stdc++.h"
using namespace std;
queue <int> q;
int main(){
int n;
cin >> n;
int maxx = INT_MIN;
int prev = 0;
for(int i=0;i<n;i++){
int tmp;
cin >> tmp;
q.push(tmp);
}
for(int i=0;i<n;i++){
if(i!=0){
q.push(q.front());
q.pop();
}
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
//cout << cur << "\n";
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
//cout << cur << "\n";
if(!found) maxx = max(cur,maxx);
}
/*
int kep ;
for(int i=0;i<n;i++){
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n-1;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
//cout << cur << "\n";
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
//cout << cur << "\n";
if(!found) maxx = max(cur,maxx);
q.push(kep);
}
*/
cout << maxx;
return 0;
} | # 2018086, 2024-09-28 14:32:08, PP----PPPPPP-------- (40%)
#include "bits/stdc++.h"
using namespace std;
queue <int> q;
queue <int> save;
int main(){
int n;
cin >> n;
int maxx = INT_MIN;
int prev = 0;
for(int i=0;i<n;i++){
int tmp;
cin >> tmp;
q.push(tmp);
}
/*
for(int i=0;i<n;i++){
if(i!=0){
q.push(q.front());
q.pop();
}
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
//cout << cur << "\n";
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
//cout << cur << "\n";
if(!found) maxx = max(cur,maxx);
}
q.push(q.front());
q.pop();
*/
int kep ;
for(int i=0;i<n;i++){
save.push(q.front());
q.push(q.front());
q.pop();
}
for(int i=0;i<n;i++){
for(int j=0;j<q.size();j++){
if(j == i){
kep = q.front();
q.pop();
if(i==n-1) continue;
}
q.push(q.front());
q.pop();
}
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
if(!found) maxx = max(cur,maxx);
while(!q.empty()) q.pop();
for(int j=0;j<n;j++){
q.push(save.front());
save.push(save.front());
save.pop();
}
}
cout << maxx;
return 0;
} | # 2018089, 2024-09-28 14:32:34, PPPPPPPPPPPP-------- (60%)
#include "bits/stdc++.h"
using namespace std;
queue <int> q;
queue <int> save;
int main(){
int n;
cin >> n;
int maxx = INT_MIN;
int prev = 0;
for(int i=0;i<n;i++){
int tmp;
cin >> tmp;
q.push(tmp);
}
for(int i=0;i<n;i++){
if(i!=0){
q.push(q.front());
q.pop();
}
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
//cout << cur << "\n";
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
//cout << cur << "\n";
if(!found) maxx = max(cur,maxx);
}
q.push(q.front());
q.pop();
int kep ;
for(int i=0;i<n;i++){
save.push(q.front());
q.push(q.front());
q.pop();
}
for(int i=0;i<n;i++){
for(int j=0;j<q.size();j++){
if(j == i){
kep = q.front();
q.pop();
if(i==n-1) continue;
}
q.push(q.front());
q.pop();
}
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
if(!found) maxx = max(cur,maxx);
while(!q.empty()) q.pop();
for(int j=0;j<n;j++){
q.push(save.front());
save.push(save.front());
save.pop();
}
}
cout << maxx;
return 0;
} | # 2018168, 2024-09-28 14:40:16, PPPP-PPPPPPPPPPPP-PP (90%)
#include "bits/stdc++.h"
using namespace std;
queue<int> q;
queue<int> save;
int main()
{
int n;
cin >> n;
int maxx = INT_MIN;
int prev = 0;
for (int i = 0; i < n; i++)
{
int tmp;
cin >> tmp;
q.push(tmp);
}
/*
for(int i=0;i<n;i++){
if(i!=0){
q.push(q.front());
q.pop();
}
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
//cout << cur << "\n";
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
//cout << cur << "\n";
if(!found) maxx = max(cur,maxx);
}
q.push(q.front());
q.pop();
*/
for (int i = 0; i < n; i++)
{
save.push(q.front());
q.push(q.front());
q.pop();
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < q.size(); j++)
{
if (j == i)
{
q.pop();
if (i == n - 1)
continue;
}
q.push(q.front());
q.pop();
}
for (int k = 0; k < n - 1; k++)
{
q.push(q.front());
q.pop();
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for (int j = 1; j < n - 1; j++)
{
if (q.front() < prev && !found)
{
maxx = max(cur, maxx);
found = true;
}
if (!found)
cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
if (!found)
maxx = max(cur, maxx);
}
while (!q.empty())
q.pop();
for (int j = 0; j < n; j++)
{
q.push(save.front());
save.push(save.front());
save.pop();
}
}
cout << maxx;
return 0;
} | # 2018172, 2024-09-28 14:40:35, PPPPPPPPPPPPPPPPPPPP (100%)
#include "bits/stdc++.h"
using namespace std;
queue<int> q;
queue<int> save;
int main()
{
int n;
cin >> n;
int maxx = INT_MIN;
int prev = 0;
for (int i = 0; i < n; i++)
{
int tmp;
cin >> tmp;
q.push(tmp);
}
for(int i=0;i<n;i++){
if(i!=0){
q.push(q.front());
q.pop();
}
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for(int j=1;j<n;j++){
if(q.front() < prev && !found){
maxx = max(cur,maxx);
//cout << cur << "\n";
found = true;
}
if(!found) cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
//cout << cur << "\n";
if(!found) maxx = max(cur,maxx);
}
q.push(q.front());
q.pop();
for (int i = 0; i < n; i++)
{
save.push(q.front());
q.push(q.front());
q.pop();
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < q.size(); j++)
{
if (j == i)
{
q.pop();
if (i == n - 1)
continue;
}
q.push(q.front());
q.pop();
}
for (int k = 0; k < n - 1; k++)
{
q.push(q.front());
q.pop();
int cur = 0;
bool found = false;
prev = q.front();
cur += q.front();
q.push(q.front());
q.pop();
for (int j = 1; j < n - 1; j++)
{
if (q.front() < prev && !found)
{
maxx = max(cur, maxx);
found = true;
}
if (!found)
cur += q.front();
prev = q.front();
q.push(q.front());
q.pop();
}
if (!found)
maxx = max(cur, maxx);
}
while (!q.empty())
q.pop();
for (int j = 0; j < n; j++)
{
q.push(save.front());
save.push(save.front());
save.pop();
}
}
cout << maxx;
return 0;
} |
# 2018022, 2024-09-28 14:25:24, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
int sum=0;
for(int i=0;i<n;i++){
cin >> v[i];
sum+=v[i];
}
cout << sum;
} | # 2018025, 2024-09-28 14:25:40, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
int sum=0;
for(int i=0;i<n;i++){
cin >> v[i];
sum+=v[i];
}
cout << 0;
} | # 2018211, 2024-09-28 14:43:19, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
int ans=INT_MIN, sum=0;
for(int i=0;i<n;i++){
cin >> v[i];
}
int it=0;
start:
if(it==n-1){
cout << ans;
return 0;
}
for(int i=0;i<n-1;i++){
sum+=v[i];
if(v[i+1]<v[i]){
break;
}
else if(i==n-2)sum+=v[i+1];
}
ans=max(ans,sum);
for(int j=0;j<n;j++){
sum=0;
for(int i=0;i<n-1;i++){
if(i==j)continue;
sum+=v[i];
if(v[i+1]<v[i]){
break;
}
else if(i==n-2)sum+=v[i+1];
}
ans=max(sum,ans);
}
vector<int> temp;
for(int i=1;i<n;i++){
temp.push_back(v[i]);
}
temp.push_back(v[0]);
v=temp;
it++;
goto start;
} | # 2018267, 2024-09-28 14:47:55, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
int ans=INT_MIN, sum=0;
for(int i=0;i<n;i++){
cin >> v[i];
}
int it=0;
start:
sum=0;
it++;
for(int i=0;i<n-1;i++){
sum+=v[i];
if(v[i+1]<v[i]){
break;
}
else if(i==n-2)sum+=v[i+1];
}
ans=max(ans,sum);
for(int j=0;j<n;j++){
sum=0;
for(int i=0;i<n-1;i++){
if(i==j)continue;
sum+=v[i];
if(v[i+1]<v[i]){
break;
}
else if(i==n-2)sum+=v[i+1];
}
ans=max(sum,ans);
}
vector<int> temp;
for(int i=1;i<n;i++){
temp.push_back(v[i]);
}
temp.push_back(v[0]);
v=temp;
for(auto x:v)cout << x << " ";
cout << endl;
if(it==n){
cout << ans;
return 0;
}
goto start;
} | # 2018273, 2024-09-28 14:48:16, ----P----PPPP--P-P-P (40%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
int ans=INT_MIN, sum=0;
for(int i=0;i<n;i++){
cin >> v[i];
}
int it=0;
start:
sum=0;
it++;
for(int i=0;i<n-1;i++){
sum+=v[i];
if(v[i+1]<v[i]){
break;
}
else if(i==n-2)sum+=v[i+1];
}
ans=max(ans,sum);
for(int j=0;j<n;j++){
sum=0;
for(int i=0;i<n-1;i++){
if(i==j)continue;
sum+=v[i];
if(v[i+1]<v[i]){
break;
}
else if(i==n-2)sum+=v[i+1];
}
ans=max(sum,ans);
}
vector<int> temp;
for(int i=1;i<n;i++){
temp.push_back(v[i]);
}
temp.push_back(v[0]);
v=temp;
// for(auto x:v)cout << x << " ";
// cout << endl;
if(it==n){
cout << ans;
return 0;
}
goto start;
} | # 2018402, 2024-09-28 14:58:45, PPPPPPPPPPPPPPPPPPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
int ans=INT_MIN, sum=0;
for(int i=0;i<n;i++){
cin >> v[i];
}
int it=0;
start:
sum=0;
it++;
for(int i=0;i<n-1;i++){
sum+=v[i];
if(v[i+1]<v[i]){
break;
}
else if(i==n-2)sum+=v[i+1];
}
ans=max(ans,sum);
for(int j=0;j<n;j++){
sum=0;
for(int i=0;i<n-1;i++){
if(i==j)continue;
sum+=v[i];
if(i+1==j){
if(v[i+2]<v[i])break;
}
else if(v[i+1]<v[i]){
break;
}
else if(i==n-2)sum+=v[i+1];
}
ans=max(sum,ans);
}
vector<int> temp;
for(int i=1;i<n;i++){
temp.push_back(v[i]);
}
temp.push_back(v[0]);
v=temp;
// for(auto x:v)cout << x << " ";
// cout << endl;
if(it==n){
cout << ans;
return 0;
}
goto start;
} |
# 2016933, 2024-09-28 12:37:43, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> bead;
for(int i{0} ; i<n ; i++){
int tmp;
cin >> tmp;
bead.push_back(tmp);
}
bead.push_back(bead[0]);
int ans1=0;
//not ignore
for(int i{0} ; i<n ; i++){
if(bead[i]<=bead[i+1]){
ans1 += bead[i];
}
else{
ans1 += bead[i];
break;
}
}
//ignore
int ans2=0;
for(int i{0} ; i<n ; i++){
int tmp2=0;
for(int j{0} ; j<n ; j++){ //ignore
if (i!=j && bead[i]<=bead[i+1]) tmp2 += bead[i];
else{
tmp2 += bead[i];
break;
}
}
ans2 = max(ans2,tmp2);
}
cout << max(ans1,ans2);
} | # 2018265, 2024-09-28 14:47:51, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> bead;
for(int i{0} ; i<n ; i++){
int tmp;
cin >> tmp;
bead.push_back(tmp);
}
bead.push_back(bead[0]);
int ans1=0;
//not ignore
for(int i{0} ; i<n ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n ; j++){
int next = idx+1;
if(next >= n) next=0;
if(bead[idx]<=bead[next]){
tmp1 += bead[idx];
}
else if(bead[idx]>bead[next]){
tmp1 += bead[idx];
break;
}
idx=next;
next++;
}
ans1 = max(ans1,tmp1);
}
cout << ans1;
} | # 2018328, 2024-09-28 14:53:42, PPPPPPPPPPPPPPPPPPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> bead;
for(int i{0} ; i<n ; i++){
int tmp;
cin >> tmp;
bead.push_back(tmp);
}
bead.push_back(bead[0]);
int ans1=0;
//not ignore
for(int i{0} ; i<n ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n ; j++){
int next = idx+1;
if(next >= n) next=0;
if(bead[idx]<=bead[next]){
tmp1 += bead[idx];
}
else if(bead[idx]>bead[next]){
tmp1 += bead[idx];
break;
}
idx=next;
next++;
}
ans1 = max(ans1,tmp1);
}
//not ignore
int ans2=0;
vector<int> bead1;
for(int k{0} ; k<n ; k++){
bead1.clear();
for(int l{0} ; l<n ; l++){
if(k!=l) bead1.push_back(bead[l]);
}
for(int i{0} ; i<n-1 ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n-1 ; j++){
int next = idx+1;
if(next >= n-1) next=0;
if(bead1[idx]<=bead1[next]){
tmp1 += bead1[idx];
}
else if(bead1[idx]>bead1[next]){
tmp1 += bead1[idx];
break;
}
idx=next;
next++;
}
ans2 = max(ans2,tmp1);
}
}
cout << max(ans1,ans2);
} | # 2018419, 2024-09-28 14:59:50, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int bead[n],bead[n-1];
for(int i{0} ; i<n ; i++) cin >> bead[i];
int ans1=0;
//not ignore
for(int i{0} ; i<n ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n ; j++){
int next = idx+1;
if(next >= n) next=0;
if(bead[idx]<=bead[next]){
tmp1 += bead[idx];
}
else if(bead[idx]>bead[next]){
tmp1 += bead[idx];
break;
}
idx=next;
next++;
}
ans1 = max(ans1,tmp1);
}
//not ignore
int ans2=0;
for(int k{0} ; k<n ; k++){
for(int l{0} ; l<n ; l++){
if(k!=l) bead1[l]==bead[l];
}
for(int i{0} ; i<n-1 ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n-1 ; j++){
int next = idx+1;
if(next >= n-1) next=0;
if(bead1[idx]<=bead1[next]){
tmp1 += bead1[idx];
}
else if(bead1[idx]>bead1[next]){
tmp1 += bead1[idx];
break;
}
idx=next;
next++;
}
ans2 = max(ans2,tmp1);
}
}
cout << max(ans1,ans2);
} | # 2018427, 2024-09-28 15:00:26, ---PPPPP---------P-- (30%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int bead[n],bead1[n-1];
for(int i{0} ; i<n ; i++) cin >> bead[i];
int ans1=0;
//not ignore
for(int i{0} ; i<n ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n ; j++){
int next = idx+1;
if(next >= n) next=0;
if(bead[idx]<=bead[next]){
tmp1 += bead[idx];
}
else if(bead[idx]>bead[next]){
tmp1 += bead[idx];
break;
}
idx=next;
next++;
}
ans1 = max(ans1,tmp1);
}
//not ignore
int ans2=0;
for(int k{0} ; k<n ; k++){
for(int l{0} ; l<n ; l++){
if(k!=l) bead1[l]==bead[l];
}
for(int i{0} ; i<n-1 ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n-1 ; j++){
int next = idx+1;
if(next >= n-1) next=0;
if(bead1[idx]<=bead1[next]){
tmp1 += bead1[idx];
}
else if(bead1[idx]>bead1[next]){
tmp1 += bead1[idx];
break;
}
idx=next;
next++;
}
ans2 = max(ans2,tmp1);
}
}
cout << max(ans1,ans2);
} | # 2018433, 2024-09-28 15:01:11, PPPPPPPPPPPPPPPPPPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> bead;
for(int i{0} ; i<n ; i++){
int tmp;
cin >> tmp;
bead.push_back(tmp);
}
bead.push_back(bead[0]);
int ans1=0;
//not ignore
for(int i{0} ; i<n ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n ; j++){
int next = idx+1;
if(next >= n) next=0;
if(bead[idx]<=bead[next]){
tmp1 += bead[idx];
}
else if(bead[idx]>bead[next]){
tmp1 += bead[idx];
break;
}
idx=next;
next++;
}
ans1 = max(ans1,tmp1);
}
//not ignore
int ans2=0;
vector<int> bead1;
for(int k{0} ; k<n ; k++){
bead1.clear();
for(int l{0} ; l<n ; l++){
if(k!=l) bead1.push_back(bead[l]);
}
for(int i{0} ; i<n-1 ; i++){
int idx=i;
int tmp1=0;
for(int j{0} ; j<n-1 ; j++){
int next = idx+1;
if(next >= n-1) next=0;
if(bead1[idx]<=bead1[next]){
tmp1 += bead1[idx];
}
else if(bead1[idx]>bead1[next]){
tmp1 += bead1[idx];
break;
}
idx=next;
next++;
}
ans2 = max(ans2,tmp1);
}
}
cout << max(ans1,ans2);
} |
# 2017684, 2024-09-28 13:57:22, -------------------- (0%)
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
unsigned n;
cin >> n;
unsigned arr[n];
for (unsigned i = 0; i < n; i++)
{
cin >> arr[i];
}
unsigned max = 0;
// loop from each possible beginning
for (unsigned i = 0; i < n; i++)
{
unsigned sum = 0;
// loop until found higher number
for (unsigned j = i;; j++)
{
unsigned index = j % n;
sum += arr[index];
if (arr[index] < arr[(index + 1) % n])
{
sum += arr[(index + 1) % n];
break;
}
}
cout << sum << '\n';
if (sum > max)
{
max = sum;
}
}
cout << max;
return 0;
} | # 2017685, 2024-09-28 13:57:29, -------------------- (0%)
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
unsigned n;
cin >> n;
unsigned arr[n];
for (unsigned i = 0; i < n; i++)
{
cin >> arr[i];
}
unsigned max = 0;
// loop from each possible beginning
for (unsigned i = 0; i < n; i++)
{
unsigned sum = 0;
// loop until found higher number
for (unsigned j = i;; j++)
{
unsigned index = j % n;
sum += arr[index];
if (arr[index] < arr[(index + 1) % n])
{
sum += arr[(index + 1) % n];
break;
}
}
if (sum > max)
{
max = sum;
}
}
cout << max;
return 0;
} | # 2017789, 2024-09-28 14:05:53, -------------------- (0%)
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
unsigned n;
cin >> n;
unsigned arr[n];
for (unsigned i = 0; i < n; i++)
{
cin >> arr[i];
}
unsigned max = 0;
// loop from each possible beginning
for (unsigned i = 0; i < n; i++)
{
unsigned sum = 0;
// loop until found higher number
for (unsigned j = i;; j++)
{
unsigned current = arr[j % n];
unsigned next = arr [(j + 1) % n];
sum += current;
if (current < next)
{
sum += next;
break;
}
if((j + 1) % n == i ){
break;
}
}
if (sum > max)
{
max = sum;
}
}
cout << max;
return 0;
} | # 2018676, 2024-09-28 15:15:12, PPPPPPPPPPPPPPPPPTPP (95%)
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
unsigned n;
cin >> n;
unsigned input[n];
for (unsigned i = 0; i < n; i++)
{
cin >> input[i];
}
unsigned max = 0;
// loop for each beginning position
for (unsigned i = 0; i < n; i++)
{
unsigned sum = 0;
// loop until found higher number
bool firstLoop = true;
for (unsigned j = i; firstLoop || j % n != i; j++)
{
firstLoop = false;
unsigned current = input[j % n];
unsigned next = input[(j + 1) % n];
sum += current;
if (current > next)
{
break;
}
}
if (sum > max)
{
max = sum;
}
}
n--;
// loop for all possible array
for (unsigned a = 0; a < n + 1; a++)
{
unsigned arr[n], index = 0;
bool firstLoop = true;
for (unsigned b = 0; b < n + 1; b++)
{
if (b != a)
{
arr[index++] = input[b];
}
}
// loop for each beginning position
for (unsigned i = 0; i < n; i++)
{
unsigned sum = 0;
// loop until found higher number
for (unsigned j = i; firstLoop || j % n != i; j++)
{
unsigned current = arr[j % n];
unsigned next = arr[(j + 1) % n];
sum += current;
if (current > next)
{
break;
}
}
if (sum > max)
{
max = sum;
}
}
}
cout << max << endl;
return 0;
} | # 2018705, 2024-09-28 15:16:18, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
unsigned n;
cin >> n;
unsigned input[n];
for (unsigned i = 0; i < n; i++)
{
cin >> input[i];
}
unsigned max = 0;
// loop for each beginning position
for (unsigned i = 0; i < n; i++)
{
unsigned sum = 0;
// loop until found higher number
bool firstLoop = true;
for (unsigned j = i; firstLoop || j % n != i; j++)
{
firstLoop = false;
unsigned current = input[j % n];
unsigned next = input[(j + 1) % n];
sum += current;
if (current > next)
{
break;
}
}
if (sum > max)
{
max = sum;
}
}
n--;
// loop for all possible array
for (unsigned a = 0; a < n + 1; a++)
{
unsigned arr[n], index = 0;
bool firstLoop = true;
for (unsigned b = 0; b < n + 1; b++)
{
if (b != a)
{
arr[index++] = input[b];
}
}
// loop for each beginning position
for (unsigned i = 0; i < n; i++)
{
unsigned sum = 0;
// loop until found higher number
bool firstLoop = true;
for (unsigned j = i; firstLoop || j % n != i; j++)
{
firstLoop = false;
unsigned current = arr[j % n];
unsigned next = arr[(j + 1) % n];
sum += current;
if (current > next)
{
break;
}
}
if (sum > max)
{
max = sum;
}
}
}
cout << max << endl;
return 0;
} |
# 2018138, 2024-09-28 14:37:28, -------------------- (0%)
#include <iostream>
using namespace std;
int point(int beads[], int start ,int n){
int sum=0;
int i=start;
for (int j = i; j < n; j++)
{
if (sum<=beads[j])
{
sum+=beads[j];
}else{
sum+=beads[j];
return sum;
}
if (j==n-1)j=-1;
if (j==i-1)
{
break;
}
}
return sum;
}
int main(){
int N;
cin >> N;
int Beads[N];
for (int i = 0; i < N; i++)
{
cin >> Beads[i];
}
int conc[N];
for (int i = 0; i < N; i++)
{
conc[i]=point(Beads,i,N);
}
int mx_conc=conc[0];
for (int i = 1; i < N; i++)
{
if (mx_conc<conc[i])
{
mx_conc=conc[i];
}
}
//Now we get the number that not take something off
int beadoff[N][N-1];
for (int i = 0; i < N; i++)
{
int x=0;
for (int j = 0; j < N; j++)
{
if (j==i)
{
continue;
}
beadoff[i][x]=Beads[j];
x++;
}
}
int concoff[N][N-1];
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N-1; j++)
{
concoff[i][j]=point(beadoff[i],j,N-1);
}
}
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N-1; j++)
{
if (mx_conc<concoff[i][j])
{
mx_conc=concoff[i][j];
}
}
}
cout << mx_conc << endl;
} | # 2018145, 2024-09-28 14:37:50, -------------------- (0%)
#include <iostream>
using namespace std;
int point(int beads[], int start ,int n){
int sum=0;
int i=start;
for (int j = i; j < n; j++)
{
if (sum<=beads[j])
{
sum+=beads[j];
}else{
sum+=beads[j];
return sum;
}
if (j==n-1)j=-1;
if (j==i-1)
{
break;
}
}
return sum;
}
int main(){
int N;
cin >> N;
int Beads[N];
for (int i = 0; i < N; i++)
{
cin >> Beads[i];
}
int conc[N];
for (int i = 0; i < N; i++)
{
conc[i]=point(Beads,i,N);
}
int mx_conc=conc[0];
for (int i = 1; i < N; i++)
{
if (mx_conc<conc[i])
{
mx_conc=conc[i];
}
}
//Now we get the number that not take something off
int beadoff[N][N-1];
for (int i = 0; i < N; i++)
{
int x=0;
for (int j = 0; j < N; j++)
{
if (j==i)
{
continue;
}
beadoff[i][x]=Beads[j];
x++;
}
}
int concoff[N][N-1];
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N-1; j++)
{
concoff[i][j]=point(beadoff[i],j,N-1);
}
}
cout << mx_conc << endl;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N-1; j++)
{
if (mx_conc<concoff[i][j])
{
mx_conc=concoff[i][j];
}
}
}
} | # 2018298, 2024-09-28 14:50:59, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int point(int beads[], int start ,int n){
int sum=0;
int i=start;
int check=0;
for (int j = i; j < n; j++)
{
if (check<=beads[j])
{
sum+=beads[j];
check=beads[j];
}else{
sum+=beads[j];
return sum;
}
if (j==n-1)j=-1;
if (j==i-1)
{
break;
}
}
return sum;
}
int main(){
int N;
cin >> N;
int Beads[N];
for (int i = 0; i < N; i++)
{
cin >> Beads[i];
}
int conc[N];
for (int i = 0; i < N; i++)
{
conc[i]=point(Beads,i,N);
}
int mx_conc=conc[0];
for (int i = 1; i < N; i++)
{
if (mx_conc<conc[i])
{
mx_conc=conc[i];
}
}
//Now we get the number that not take something off
int beadoff[N][N-1];
for (int i = 0; i < N; i++)
{
int x=0;
for (int j = 0; j < N; j++)
{
if (j==i)
{
continue;
}
beadoff[i][x]=Beads[j];
x++;
}
}
int concoff[N][N-1];
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N-1; j++)
{
concoff[i][j]=point(beadoff[i],j,N-1);
}
}
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N-1; j++)
{
if (mx_conc<concoff[i][j])
{
mx_conc=concoff[i][j];
}
}
}
cout << mx_conc << endl;
} | # 2018424, 2024-09-28 15:00:17, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int point(int beads[], int start ,int n){
int sum=0;
int i=start;
int check=0;
for (int j = i; j < n; j++)
{
if (check<=beads[j])
{
sum+=beads[j];
check=beads[j];
}else{
return sum;
}
if (j==n-1)j=-1;
if (j==i-1)
{
break;
}
}
return sum;
}
int main(){
int N;
cin >> N;
int Beads[N];
for (int i = 0; i < N; i++)
{
cin >> Beads[i];
}
int conc[N];
for (int i = 0; i < N; i++)
{
conc[i]=point(Beads,i,N);
}
int mx_conc=conc[0];
for (int i = 1; i < N; i++)
{
if (mx_conc<conc[i])
{
mx_conc=conc[i];
}
}
//Now we get the number that not take something off
int beadoff[N][N-1];
for (int i = 0; i < N; i++)
{
int x=0;
for (int j = 0; j < N; j++)
{
if (j==i)
{
continue;
}
beadoff[i][x]=Beads[j];
x++;
}
}
int concoff[N][N-1];
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N-1; j++)
{
concoff[i][j]=point(beadoff[i],j,N-1);
//cout << concoff[i][j] << " ";
}
//cout << endl;
}
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N-1; j++)
{
if (mx_conc<concoff[i][j])
{
mx_conc=concoff[i][j];
}
}
}
cout << mx_conc << endl;
} |
# 2017774, 2024-09-28 14:05:14, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a[20005],mx=INT_MIN;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
//for(int k=0;k<n;k++){
// int tmp=a[k];
// a[k]=0;
for(int i=0;i<n;i++){
int sum=a[i];
for(int j=i;j<n+i-1;j++){
int next,now;
if(j>=n){
now=j-n;next=j-n+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else if(j==n-1){
now=n-1;next=0;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else{
now=j;next=j+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
}
//cout<<k<<" -> "<<sum<<endl;
mx=max(mx,sum);
}
//a[k]=tmp;
// }
cout<<mx;
} | # 2017800, 2024-09-28 14:06:58, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a[20005],mx=INT_MIN;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
int sum=a[i];
for(int j=i;j<n+i-1;j++){
int next,now;
if(j>=n){
now=j-n;next=j-n+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else if(j==n-1){
now=n-1;next=0;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else{
now=j;next=j+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
}
mx=max(mx,sum);
}
for(int i=0;i<n;i++)cin>>a[i];
for(int k=0;k<n;k++){
int tmp=a[k];
a[k]=0;
for(int i=0;i<n;i++){
int sum=a[i];
for(int j=i;j<n+i-1;j++){
int next,now;
if(j>=n){
now=j-n;next=j-n+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else if(j==n-1){
now=n-1;next=0;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else{
now=j;next=j+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
}
mx=max(mx,sum);
}
a[k]=tmp;
}
cout<<mx;
} | # 2018054, 2024-09-28 14:28:54, PPPPPPPPPPPPPPPPPPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a[20005],mx=INT_MIN;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
int sum=a[i];
for(int j=i;j<n+i-1;j++){
int next,now;
if(j>=n){
now=j-n;next=j-n+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else if(j==n-1){
now=n-1;next=0;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else{
now=j;next=j+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
}
mx=max(mx,sum);
}
bool flag=0;
for(int k=0;k<n;k++){
int tmp=a[k];
a[k]=-1;
// for(int x=0;x<n;x++)cout<<a[x]<<" ";
// cout<<endl;
for(int i=0;i<n;i++){
int sum=a[i];
for(int j=i;j<n+i-1;j++){
int next,now;
if(j>=n){
if(flag){next=j-n+1;flag=0;}
else{now=j-n;next=j-n+1;}
if(a[next]==-1){
flag=1;
continue;
}
if(a[now]<=a[next])sum+=a[next];
else break;
}
else if(j==n-1){
if(flag){next=0;flag=0;}
else{now=n-1;next=0;}
if(a[next]==-1){
flag=1;
continue;
}
if(a[now]<=a[next])sum+=a[next];
else break;
}
else{
if(flag){next=j+1;flag=0;}
else{now=j;next=j+1;}
if(a[next]==-1){
flag=1;
continue;
}
if(a[now]<=a[next])sum+=a[next];
else break;
}
}
//cout<<" -> "<<sum<<endl;
mx=max(mx,sum);
}
a[k]=tmp;
}
cout<<mx;
} | # 2018059, 2024-09-28 14:29:15, PPPPPPPPPPPPPPPPPPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a[20005],mx=INT_MIN;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
int sum=a[i];
for(int j=i;j<n+i-1;j++){
int next,now;
if(j>=n){
now=j-n;next=j-n+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else if(j==n-1){
now=n-1;next=0;
if(a[now]<=a[next])sum+=a[next];
else break;
}
else{
now=j;next=j+1;
if(a[now]<=a[next])sum+=a[next];
else break;
}
}
mx=max(mx,sum);
}
bool flag=0;
for(int k=0;k<n;k++){
int tmp=a[k];
a[k]=-1;
for(int i=0;i<n;i++){
int sum=a[i];
for(int j=i;j<n+i-1;j++){
int next,now;
if(j>=n){
if(flag){next=j-n+1;flag=0;}
else{now=j-n;next=j-n+1;}
if(a[next]==-1){
flag=1;
continue;
}
if(a[now]<=a[next])sum+=a[next];
else break;
}
else if(j==n-1){
if(flag){next=0;flag=0;}
else{now=n-1;next=0;}
if(a[next]==-1){
flag=1;
continue;
}
if(a[now]<=a[next])sum+=a[next];
else break;
}
else{
if(flag){next=j+1;flag=0;}
else{now=j;next=j+1;}
if(a[next]==-1){
flag=1;
continue;
}
if(a[now]<=a[next])sum+=a[next];
else break;
}
}
mx=max(mx,sum);
}
a[k]=tmp;
}
cout<<mx;
} |
# 2016251, 2024-09-28 11:28:46, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main () {
int N;
bool end;
cin >> N;
int k[N];
for (int i=0;i<N;i++) {
cin >> k[i];
}
int msum=0;
for (int s=0;s<N;s++) {
int max=0,sum=0;
end=false;
for (int i=s;!((i==s)&&end);i++) {
if (!(k[i]<max)) {
sum+=k[i];
max=k[i];
}
if (i==N-1) {
i=-1;
end=true;
}
}
if (sum>msum) msum=sum;
}
cout << msum << endl;
} | # 2016287, 2024-09-28 11:31:43, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int main () {
int N;
bool end;
cin >> N;
int k[N];
for (int i=0;i<N;i++) {
cin >> k[i];
}
int msum=0;
for (int s=0;s<N;s++) {
int max=0,sum=0;
end=false;
for (int i=s;!((i==s)&&end);i++) {
if (!(k[i]<max)) {
sum+=k[i];
max=k[i];
} else break;
if (i==N-1) {
i=-1;
end=true;
}
}
if (sum>msum) msum=sum;
}
cout << msum << endl;
} | # 2016535, 2024-09-28 11:48:29, PPPPPPPP-PPPP--P-P-P (75%)
#include <iostream>
using namespace std;
int main () {
int N;
bool end;
cin >> N;
int k[N];
for (int i=0;i<N;i++) {
cin >> k[i];
}
int msum=0;
for (int s=0;s<N;s++) {
int max=0,sum=0;
end=false;
for (int i=s;!((i==s)&&end);i++) {
if (!(k[i]<max)) {
sum+=k[i];
max=k[i];
} else break;
if (i==N-1) {
i=-1;
end=true;
}
}
if (sum>msum) msum=sum;
}
for (int d=0;d<N;d++) {
for (int s=0;s<N;s++) {
int max=0,sum=0;
end=false;
for (int i=s;!((i==s)&&end);i++) {
if (!(k[i]<max)) {
if (i!=d) {
sum+=k[i];
max=k[i];
}
} else break;
if (i==N-1) {
i=-1;
end=true;
}
}
if (sum>msum) msum=sum;
}
}
cout << msum << endl;
} | # 2016674, 2024-09-28 11:55:25, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int main () {
int N;
bool end;
cin >> N;
int k[N];
for (int i=0;i<N;i++) {
cin >> k[i];
}
int msum=0;
for (int s=0;s<N;s++) {
int max=0,sum=0;
end=false;
for (int i=s;!((i==s)&&end);i++) {
if (!(k[i]<max)) {
sum+=k[i];
max=k[i];
} else break;
if (i==N-1) {
i=-1;
end=true;
}
}
if (sum>msum) msum=sum;
}
for (int d=0;d<N;d++) {
for (int s=0;s<N;s++) {
int max=0,sum=0;
end=false;
for (int i=s;!((i==s)&&end);i++) {
if (!(k[i]<max)) {
if (i!=d) {
sum+=k[i];
max=k[i];
}
} else if (i==d) {
} else break;
if (i==N-1) {
i=-1;
end=true;
}
}
if (sum>msum) msum=sum;
}
}
cout << msum << endl;
} |
# 2016180, 2024-09-28 11:21:26, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
pair<int, int> calculatepower(int beadArr[][0], int size, int startindex)
{
int times = 1;
int totalpower = 0;
int i;
for (i = startindex; times <= size; times++, i++)
{
totalpower += beadArr[i][0];
if (i == size - 1)
{
if (beadArr[i][0] > beadArr[0][0])
return {totalpower, i};
i = -1;
}
if (beadArr[i][0] > beadArr[i + 1][0])
{
return {totalpower, i};
}
}
return {totalpower, i - 1};
;
}
void removearr(int beadarr[][0], int size, int index)
{
for (int i = index; i < size - 1; i++)
{
beadarr[i][0] = beadarr[i + 1][0];
}
}
void copyarr(int beadarrcopy[][0], int beadarr[][0], int size)
{
for (int i = 0; i < size; i++)
{
beadarrcopy[i][0] = beadarr[i][0];
}
}
int main()
{
int beadcount;
int beadArr[beadcount][0];
int beadArrCutbefore[beadcount][0];
int beadArrCutafter[beadcount][0];
int totalpower = 0;
int maxpower = 0;
cin >> beadcount;
int beadpower;
for (int i = 0; i < beadcount; i++)
{
cin >> beadpower;
beadArr[i][0] = beadpower;
}
int lastindex;
for (int i = 0; i < beadcount - 1; i++) // startbead num
{
totalpower = calculatepower(beadArr, beadcount, i).first;
lastindex = calculatepower(beadArr, beadcount, i).second;
maxpower = max(totalpower, maxpower);
copyarr(beadArrCutbefore, beadArr, beadcount);
copyarr(beadArrCutafter, beadArr, beadcount);
removearr(beadArrCutbefore, beadcount, lastindex);
totalpower = calculatepower(beadArrCutbefore, beadcount - 1, i).first;
maxpower = max(totalpower, maxpower);
removearr(beadArrCutafter, beadcount, lastindex + 1);
totalpower = calculatepower(beadArrCutafter, beadcount - 1, i).first;
maxpower = max(totalpower, maxpower);
}
cout << maxpower;
} | # 2016349, 2024-09-28 11:35:49, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
pair<int, int> calculatepower(int beadArr[][1], int size, int startindex)
{
int times = 1;
int totalpower = 0;
int i;
for (i = startindex; times <= size; times++, i++)
{
totalpower += beadArr[i][0];
//cout << beadArr[i][0] << endl;
if (i == size - 1)
{
if (beadArr[i][0] > beadArr[0][0])
return {totalpower, i};
i = -1;
}
if (beadArr[i][0] > beadArr[i + 1][0])
{
return {totalpower, i};
}
}
return {totalpower, i - 1};
;
}
void removearr(int beadarr[][1], int size, int index)
{
for (int i = index; i < size - 1; i++)
{
beadarr[i][0] = beadarr[i + 1][0];
}
}
void copyarr(int beadarrcopy[][1], int beadarr[][1], int size)
{
for (int i = 0; i < size; i++)
{
beadarrcopy[i][0] = beadarr[i][0];
}
}
int main()
{
int beadcount;
int totalpower = 0;
int maxpower = 0;
cin >> beadcount;
int beadArr[beadcount][1];
int beadArrCutbefore[beadcount][1];
int beadArrCutafter[beadcount][1];
int beadpower;
for (int i = 0; i < beadcount; i++)
{
cin >> beadpower;
beadArr[i][0] = beadpower;
//cout << beadpower <<" ";
}
int lastindex;
for (int i = 0; i < beadcount - 1; i++) // startbead num
{
totalpower = calculatepower(beadArr, beadcount, i).first;
lastindex = calculatepower(beadArr, beadcount, i).second;
maxpower = max(totalpower, maxpower);
copyarr(beadArrCutbefore, beadArr, beadcount);
copyarr(beadArrCutafter, beadArr, beadcount);
//cout << "---" << endl;
removearr(beadArrCutbefore, beadcount, lastindex);
totalpower = calculatepower(beadArrCutbefore, beadcount - 1, i).first;
maxpower = max(totalpower, maxpower);
//cout << "---" << endl;
removearr(beadArrCutafter, beadcount, lastindex + 1);
totalpower = calculatepower(beadArrCutafter, beadcount - 1, i).first;
maxpower = max(totalpower, maxpower);
//cout << "---" << endl;
}
cout << maxpower;
} | # 2016385, 2024-09-28 11:39:11, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
pair<int, int> calculatepower(int beadArr[][1], int size, int startindex)
{
int times = 1;
int totalpower = 0;
int i;
for (i = startindex; times <= size; times++, i++)
{
totalpower += beadArr[i][0];
//cout << beadArr[i][0] << endl;
if (i == size - 1)
{
if (beadArr[i][0] > beadArr[0][0])
return {totalpower, i};
i = -1;
}
if (beadArr[i][0] > beadArr[i + 1][0])
{
return {totalpower, i};
}
}
return {totalpower, i - 1};
;
}
void removearr(int beadarr[][1], int size, int index)
{
for (int i = index; i < size - 1; i++)
{
beadarr[i][0] = beadarr[i + 1][0];
}
}
void copyarr(int beadarrcopy[][1], int beadarr[][1], int size)
{
for (int i = 0; i < size; i++)
{
beadarrcopy[i][0] = beadarr[i][0];
}
}
int main()
{
int beadcount;
int totalpower = 0;
int maxpower = 0;
cin >> beadcount;
int beadArr[beadcount][1];
int beadArrCutbefore[beadcount][1];
int beadArrCutafter[beadcount][1];
int beadpower;
for (int i = 0; i < beadcount; i++)
{
cin >> beadpower;
beadArr[i][0] = beadpower;
//cout << beadpower <<" ";
}
int lastindex;
for (int i = 0; i < beadcount - 1; i++) // startbead num
{
totalpower = calculatepower(beadArr, beadcount, i).first;
lastindex = calculatepower(beadArr, beadcount, i).second;
maxpower = max(totalpower, maxpower);
copyarr(beadArrCutbefore, beadArr, beadcount);
copyarr(beadArrCutafter, beadArr, beadcount);
//cout << "---" << endl;
removearr(beadArrCutbefore, beadcount, lastindex);
totalpower = calculatepower(beadArrCutbefore, beadcount - 1, i).first;
maxpower = max(totalpower, maxpower);
//cout << "---" << endl;
removearr(beadArrCutafter, beadcount, lastindex + 1);
totalpower = calculatepower(beadArrCutafter, beadcount - 1, i).first;
maxpower = max(totalpower, maxpower);
cout << "---" << endl;
}
cout << maxpower;
} | # 2016388, 2024-09-28 11:39:22, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
pair<int, int> calculatepower(int beadArr[][1], int size, int startindex)
{
int times = 1;
int totalpower = 0;
int i;
for (i = startindex; times <= size; times++, i++)
{
totalpower += beadArr[i][0];
//cout << beadArr[i][0] << endl;
if (i == size - 1)
{
if (beadArr[i][0] > beadArr[0][0])
return {totalpower, i};
i = -1;
}
if (beadArr[i][0] > beadArr[i + 1][0])
{
return {totalpower, i};
}
}
return {totalpower, i - 1};
;
}
void removearr(int beadarr[][1], int size, int index)
{
for (int i = index; i < size - 1; i++)
{
beadarr[i][0] = beadarr[i + 1][0];
}
}
void copyarr(int beadarrcopy[][1], int beadarr[][1], int size)
{
for (int i = 0; i < size; i++)
{
beadarrcopy[i][0] = beadarr[i][0];
}
}
int main()
{
int beadcount;
int totalpower = 0;
int maxpower = 0;
cin >> beadcount;
int beadArr[beadcount][1];
int beadArrCutbefore[beadcount][1];
int beadArrCutafter[beadcount][1];
int beadpower;
for (int i = 0; i < beadcount; i++)
{
cin >> beadpower;
beadArr[i][0] = beadpower;
//cout << beadpower <<" ";
}
int lastindex;
for (int i = 0; i < beadcount - 1; i++) // startbead num
{
totalpower = calculatepower(beadArr, beadcount, i).first;
lastindex = calculatepower(beadArr, beadcount, i).second;
maxpower = max(totalpower, maxpower);
copyarr(beadArrCutbefore, beadArr, beadcount);
copyarr(beadArrCutafter, beadArr, beadcount);
//cout << "---" << endl;
removearr(beadArrCutbefore, beadcount, lastindex);
totalpower = calculatepower(beadArrCutbefore, beadcount - 1, i).first;
maxpower = max(totalpower, maxpower);
//cout << "---" << endl;
removearr(beadArrCutafter, beadcount, lastindex + 1);
totalpower = calculatepower(beadArrCutafter, beadcount - 1, i).first;
maxpower = max(totalpower, maxpower);
//cout << "---" << endl;
}
cout << maxpower;
} |
# 2015783, 2024-09-28 10:42:50, -------------------- (0%)
#include <iostream>
using namespace std;
int main() {
int n, sum=0, max=0;
cin >> n;
int power[n];
for (int i=0;i<n;i++) {
cin >> power[i];
}
for (int i=0;i<n;i++) {
for (int j=i, k=0;k<n;j++, k++) {
if (power[j%n]>=power[(j+1)%n]) sum+=power[j%n];
else break;
}
if (sum>max) max=sum;
sum=0;
}
cout << max;
} | # 2015834, 2024-09-28 10:47:36, -----------------P-- (5%)
#include <iostream>
using namespace std;
int main() {
int n, sum=0, max=0;
cin >> n;
int power[n];
for (int i=0;i<n;i++) {
cin >> power[i];
}
for (int i=0;i<n;i++) {
for (int j=i, k=0;k<n;j++, k++) {
if (power[j%n]<=power[(j-1)%n]||j==i) sum+=power[j%n];
else break;
}
if (sum>max) max=sum;
sum=0;
}
cout << max;
} | # 2015882, 2024-09-28 10:53:40, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int main() {
int n, sum=0, max=0;
cin >> n;
int power[n];
for (int i=0;i<n;i++) {
cin >> power[i];
}
for (int i=0;i<n;i++) {
for (int j=i, k=0;k<n;j++, k++) {
if ((power[j%n]<power[(j-1)%n])&&k!=0) break;
else sum+=power[j%n];
}
if (sum>max) max=sum;
sum=0;
}
cout << max;
} | # 2016120, 2024-09-28 11:15:33, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int main() {
int n, sum=0, max=0;
cin >> n;
int power[n];
for (int i=0;i<n;i++) {
cin >> power[i];
}
for (int i=0;i<n;i++) {
for (int j=i, k=0;k<n;j++, k++) {
if ((power[j%n]<power[(j-1)%n])&&k!=0) break;
else sum+=power[j%n];
}
if (sum>max) max=sum;
sum=0;
}
for (int o=0;o<n;o++) {
for (int i=0;i<n;i++) {
for (int j=i, k=0;k<n;j++, k++) {
if ((j%n)==o) continue;
if ((j-1)%n==o) {
if (power[j%n]<power[(j-2+n)%n]&&k!=0) break;
else sum+=power[j%n];
continue;
}
if ((power[j%n]<power[(j-1)%n])&&k!=0) break;
else sum+=power[j%n];
}
if (sum>max) max=sum;
sum=0;
}
}
cout << max;
} |
# 2016073, 2024-09-28 11:10:38, -----------------P-- (5%)
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
int Circle[n];
for(int i=0 ; i<n ; i++) {
cin>>Circle[i];
}
int mx = -1;
for(int i=0 ; i<n ; i++) {
int Power = 0;
int Beads[n];
for(int j=0 ; j<n-i ; j++) {
Beads[j] = Circle[i+j];
}
for(int j=n-i, k=0 ; k<i ; j++, k++) {
Beads[j] = Circle[k];
}
int bef;
for(int j=0 ; j<n ; j++) {
if(j == 0) {
Power += Beads[0];
if(Power > mx) {
mx = Power;
}
bef = Beads[0];
continue;
}
Power += Beads[j];
if(Power > mx) {
mx = Power;
}
if(bef < Beads[j]) {
break;
}
bef = Beads[j];
}
}
cout<<mx;
} | # 2016270, 2024-09-28 11:30:19, -----------------P-- (5%)
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
int Circle[n];
for(int i=0 ; i<n ; i++) {
cin>>Circle[i];
}
int mx = -1;
for(int i=0 ; i<n ; i++) {
int Power = 0;
int Beads[n];
for(int j=0 ; j<n-i ; j++) {
Beads[j] = Circle[i+j];
}
for(int j=n-i, k=0 ; k<i ; j++, k++) {
Beads[j] = Circle[k];
}
int bef;
for(int j=0 ; j<n ; j++) {
if(j == 0) {
Power += Beads[0];
if(Power > mx) {
mx = Power;
}
bef = Beads[0];
continue;
}
Power += Beads[j];
if(Power > mx) {
mx = Power;
}
if(bef < Beads[j]) {
break;
}
bef = Beads[j];
}
}
for(int i=0 ; i<n ; i++) {
for(int a=0 ; a<n ; a++) {
if(a != i) {
int Del[n-1];
for(int b=0, c=0 ; c<n-1 ;) {
if(b == a) {
b++;
}
else {
Del[c] = Circle[b];
c++;
b++;
}
}
int Power = 0;
int Beads[n-1];
for(int j=0 ; j<n-1-i ; j++) {
Beads[j] = Del[i+j];
}
for(int j=n-1-i, k=0 ; k<i ; j++, k++) {
Beads[j] = Del[k];
}
int bef;
for(int j=0 ; j<n-1 ; j++) {
if(j == 0) {
Power += Beads[0];
if(Power > mx) {
mx = Power;
}
bef = Beads[0];
continue;
}
Power += Beads[j];
if(Power > mx) {
mx = Power;
}
if(bef < Beads[j]) {
break;
}
bef = Beads[j];
}
}
}
}
cout<<mx;
} | # 2016379, 2024-09-28 11:38:35, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
int Circle[n];
for(int i=0 ; i<n ; i++) {
cin>>Circle[i];
}
int mx = -1;
for(int i=0 ; i<n ; i++) {
int Power = 0;
int Beads[n];
for(int j=0 ; j<n-i ; j++) {
Beads[j] = Circle[i+j];
}
for(int j=n-i, k=0 ; k<i ; j++, k++) {
Beads[j] = Circle[k];
}
for(int j=0 ; j<n ; j++) {
Power += Beads[j];
if(Power > mx) {
mx = Power;
}
if((Beads[j+1] < Beads[j] && j < n-1-1) || j == n-1) {
break;
}
}
}
for(int i=0 ; i<n ; i++) {
// deleted index
for(int a=0 ; a<n ; a++) {
if(a != i) {
int Del[n-1];
for(int b=0, c=0 ; c<n-1 ;) {
if(b == a) {
b++;
}
else {
Del[c] = Circle[b];
c++;
b++;
}
}
int Power = 0;
int Beads[n-1];
for(int j=0 ; j<n-1-i ; j++) {
Beads[j] = Del[i+j];
}
for(int j=n-1-i, k=0 ; k<i ; j++, k++) {
Beads[j] = Del[k];
}
for(int j=0 ; j<n-1 ; j++) {
Power += Beads[j];
if(Power > mx) {
mx = Power;
}
if((Beads[j+1] < Beads[j] && j < n-1-1-1) || j == n-1-1) {
break;
}
}
}
}
}
cout<<mx;
} |
# 2018171, 2024-09-28 14:40:26, PPPPPPPPP----PP-P-P- (65%)
#include <iostream>
using namespace std;
int counting(int arr[], int n, int start){
int count = arr[start];
int prev = arr[start];
bool skip = false;
int j = 0;
for(int i=start+1; i!=start; i++){
i = (i%n);
if(arr[i] < prev){
if(!skip){ skip = true; }
else{ break; }
}else{
count += arr[i];
prev = arr[i];
}
j++;
}
return count;
}
int main(){
int n;
cin >> n;
int arr[n];
for(int i=0; i<n; i++){
cin >> arr[i];
}
int mx = 0;
for(int i=0; i<n; i++){
int count = counting(arr, n, i);
if(count > mx){ mx = count; }
}
cout << mx;
} | # 2018256, 2024-09-28 14:47:18, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
using namespace std;
int counting(int arr[], int n, int start){
int count = arr[start];
int prev = arr[start];
bool skip = false;
for(int i=start+1; i < (start+n); i++){
if(arr[i] < prev){
if(!skip){ skip = true; }
else{ break; }
}else{
count += arr[i];
prev = arr[i];
}
}
return count;
}
int main(){
int n;
cin >> n;
int arr[2*n];
for(int i=0; i<n; i++){
cin >> arr[i];
arr[n+i] = arr[i];
}
int mx = 0;
for(int i=0; i<n; i++){
int count = counting(arr, n, i);
if(count > mx){ mx = count; }
}
cout << mx;
} | # 2018544, 2024-09-28 15:08:59, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int counting(int arr[], int n, int start){
int mx = arr[start];
int d = 0;
for(int k = start; k < n+start; k++){
int prev = arr[start];
int c = 0;
for(int i = start + 1; i < (n+start); i++){
if(i == k){ continue; }
if(arr[i] < prev){
break;
}else{
c += arr[i];
prev = arr[i];
}
}
if(c > d){ d = c; }
}
return mx + d;
}
int main(){
int n;
cin >> n;
int arr[2*n];
for(int i=0; i<n; i++){
cin >> arr[i];
arr[n+i] = arr[i];
}
int mx = 0;
for(int i=0; i<n; i++){
int count = counting(arr, n, i);
if(count > mx){ mx = count; }
}
cout << mx;
} |
# 2018076, 2024-09-28 14:30:58, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int a[n];
for(int i = 0;i<n;i++){
cin >> a[i];
}
int max = 0;
for(int i = 0;i<n;i++){
bool check[n] ;
for(int i = 0;i<n;i++){
check[i] = true;
}
int inx = i;
int iny = i+1;
if(iny == n) iny = 0;
int score = a[inx];
check[inx] = false;
while (a[inx] <= a[iny] && check[iny])
{
score += a[iny];
check[iny] = false;
inx++;
iny++;
if(iny == n) iny = 0;
if(inx == n) inx = 0;
}
//score += a[inx];
if(max < score){
max = score;
}
}
cout << max;
} | # 2018462, 2024-09-28 15:02:29, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int a[n];
for(int i = 0;i<n;i++){
cin >> a[i];
}
int max = 0;
for(int i = 0;i<n;i++){
bool check[n] ;
for(int j = 0;j<n;j++){
check[j] = true;
}
int inx = i;
int iny = i+1;
if(iny == n) iny = 0;
int score = a[inx];
check[inx] = false;
while (a[inx] <= a[iny] && check[iny])
{
score += a[iny];
check[iny] = false;
inx++;
iny++;
if(iny == n) iny = 0;
if(inx == n) inx = 0;
}
//score += a[inx];
if(max < score){
max = score;
}
}
for(int i = 0;i < n;i++){
int b[n-1];
int bx = 0;
for(int j = 0;j < n;j++){
if(j != i){
b[bx] = a[j];
bx++;
}
}
for(int j = 0;j<n-1;j++){
int inx = j;
int iny = j+1;
if(iny == n-1) iny = 0;
bool check[n-1];
for(int j = 0;j<n-1;j++){
check[j] = true;
}
int score = a[inx];
check[inx] = false;
while (a[inx] <= a[iny] && check[iny])
{
score += a[iny];
check[iny] = false;
inx++;
iny++;
if(iny == n-1) iny = 0;
if(inx == n-1) inx = 0;
}
//score += a[inx];
if(max < score){
max = score;
}
}
}
cout << max;
} | # 2018503, 2024-09-28 15:05:46, PPPPPPPPPPPPPPPPPPPP (100%)
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int a[n];
for(int i = 0;i<n;i++){
cin >> a[i];
}
int max = 0;
for(int i = 0;i<n;i++){
bool check[n] ;
for(int j = 0;j<n;j++){
check[j] = true;
}
int inx = i;
int iny = i+1;
if(iny == n) iny = 0;
int score = a[inx];
check[inx] = false;
while (a[inx] <= a[iny] && check[iny])
{
score += a[iny];
check[iny] = false;
inx++;
iny++;
if(iny == n) iny = 0;
if(inx == n) inx = 0;
}
//score += a[inx];
if(max < score){
max = score;
}
}
for(int i = 0;i < n;i++){
int b[n-1];
int bx = 0;
for(int j = 0;j < n;j++){
if(j != i){
b[bx] = a[j];
//cout << b[bx] << " ";
bx++;
}
}
//cout << endl;
for(int j = 0;j < n-1;j++){
int inx = j;
int iny = j+1;
if(iny == n-1) iny = 0;
bool check[n-1];
for(int j = 0;j<n-1;j++){
check[j] = true;
}
int score = b[inx];
check[inx] = false;
while (b[inx] <= b[iny] && check[iny])
{
score += b[iny];
check[iny] = false;
inx++;
iny++;
if(iny == n-1) iny = 0;
if(inx == n-1) inx = 0;
}
//score += a[inx];
if(max < score){
max = score;
}
}
}
cout << max;
} |
# 2017962, 2024-09-28 14:21:10, PPPPPPPP---------P-- (45%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main(){
int n , max = 0;
cin >> n;
bool used[n];
int seq[n];
for(int i = 0 ; i < n ; i++){
int a;
cin >> a;
seq[i] = a;
}
int start = 0 , next = start + 1;
if(n == 1){
cout << seq[0];
return 0;
}
for(int i = 0 ; i < n ; i++){
for(int i = 0 ; i < n ; i++){
used[i] = false;
}
int sum = 0;
start = i;
next = start + 1;
sum = sum + seq[start];
used[start] = true;
if(next == n)
next = 0;
while(seq[start] <= seq[next] && !used[next]){
sum = sum + seq[next];
used[next] = true;
start = next;
next++;
if(next == n)
next = 0;
}
if(sum > max){
max = sum;
}
}
cout << max;
return 0;
} | # 2017980, 2024-09-28 14:22:31, PPPPPPPP---------P-- (45%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main(){
int n , max = 0;
cin >> n;
bool used[n];
int seq[n];
for(int i = 0 ; i < n ; i++){
int a;
cin >> a;
seq[i] = a;
}
int start = 0 , next = start + 1;
if(n == 1){
cout << seq[0];
return 0;
}
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
used[j] = false;
}
int sum = 0;
start = i;
next = start + 1;
sum = sum + seq[start];
used[start] = true;
if(next == n)
next = 0;
while(seq[start] <= seq[next] && !used[next]){
sum = sum + seq[next];
used[next] = true;
start = next;
next++;
if(next == n)
next = 0;
}
if(sum > max){
max = sum;
}
}
cout << max;
return 0;
} | # 2018056, 2024-09-28 14:29:07, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main(){
int n , max = 0;
cin >> n;
bool used[n];
int seq[n];
for(int i = 0 ; i < n ; i++){
int a;
cin >> a;
seq[i] = a;
}
int start = 0 , next = start + 1;
if(n == 1){
cout << seq[0];
return 0;
}
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
used[j] = false;
}
int sum = 0;
start = i;
next = start + 1;
sum = sum + seq[start];
used[start] = true;
if(next == n)
next = 0;
while(seq[start] <= seq[next] && !used[next]){
sum = sum + seq[next];
used[next] = true;
start = next;
next++;
if(next == n)
next = 0;
}
if(sum > max){
max = sum;
}
}
// delete
for(int a = 0 ; a < n ; a++){
int temp = seq[a];
seq[a] = -1;
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
used[j] = false;
}
if(i == a)
continue;
int sum = 0;
start = i;
next = start + 1;
if(seq[next] == -1){
next++;
}
sum = sum + seq[start];
used[start] = true;
if(next >= n)
next = 0;
while(seq[start] <= seq[next] && !used[next]){
sum = sum + seq[next];
used[next] = true;
start = next;
next++;
if(seq[next] == -1){
next++;
}
if(next >= n)
next = 0;
}
if(sum > max){
max = sum;
}
}
seq[a] = temp;
}
cout << max;
return 0;
} |
# 2016082, 2024-09-28 11:11:30, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
vector<int> a;
int nub=0;
int maxi=0;
for(int i=0; i<t; i++)
{
int temp;
cin>>temp;
a.push_back(temp);
}
for(int i=0; i<t; i++)
{
for(int j=0; j<t; j++)
{
if(a[j]>a[j+1])
{
break;
}
else
{
nub+=a[j];
}
}
if(nub>maxi)
{
maxi=nub;
}
nub=0;
a.push_back(a[0]);
a.erase(a.begin());
}
for(int i=0; i<t; i++)
{
for(int j=0; j<t; j++)
{
if(a[j]>a[j+1])
{
break;
}
else
{
nub+=a[j];
}
}
if(nub>maxi)
{
maxi=nub;
}
nub=0;
a.push_back(a[0]);
a.erase(a.begin());
}
cout<<maxi;
} | # 2016369, 2024-09-28 11:37:14, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
vector<int> a;
int nub=0;
int maxi=0;
for(int i=0; i<t; i++)
{
int temp;
cin>>temp;
a.push_back(temp);
}
for(int i=0; i<t; i++)
{
for(int j=0; j<t; j++)
{
if(a[j]>a[j+1])
{
break;
}
else
{
nub+=a[j];
}
}
if(nub>maxi)
{
maxi=nub;
}
nub=0;
vector<int> b;
for(int j=0; j<t-1; j++)
{
b.push_back(a[j]);
}
for(int j=0; j<t-1; j++)
{
for(int k=0; k<t-1; k++)
{
if(b[k]>b[k+1])
{
break;
}
else
{
nub+=b[k];
}
}
if(nub>maxi)
{
maxi=nub;
}
nub=0;
b.push_back(b[0]);
b.erase(b.begin());
}
a.push_back(a[0]);
a.erase(a.begin());
}
cout<<maxi;
} | # 2016556, 2024-09-28 11:49:38, PPPPPPPPPPPPPPPPPPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
vector<int> a;
int nub=0;
int maxi=0;
for(int i=0; i<t; i++)
{
int temp;
cin>>temp;
a.push_back(temp);
}
for(int i=0; i<t; i++)
{
for(int j=0; j<t; j++)
{
if(a[j]>a[j+1])
{
nub+=a[j];
goto out2;
}
else
{
nub+=a[j];
}
}
out2:
if(nub>maxi)
{
maxi=nub;
}
nub=0;
vector<int> b;
for(int j=0; j<t-1; j++)
{
b.push_back(a[j]);
}
for(int j=0; j<t-1; j++)
{
for(int k=0; k<t-1; k++)
{
if(b[k]>b[k+1])
{
nub+=b[k];
goto out1;
}
else
{
nub+=b[k];
}
}
out1:
if(nub>maxi)
{
maxi=nub;
}
nub=0;
b.push_back(b[0]);
b.erase(b.begin());
}
a.push_back(a[0]);
a.erase(a.begin());
}
cout<<maxi;
} |
# 2017977, 2024-09-28 14:22:15, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int n;
int bead[501];
int count(int start){
int sum = 0;
int last = 0;
for(int i = start; i < n; i++){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
for(int i = 0; i < start; i++){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
return sum;
}
int main(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> bead[i];
}
int max = 0;
int temp;
for(int start = 0; start < n; start++){
temp = count(start);
if(temp > max){
max = temp;
}
}
cout << max;
} | # 2018069, 2024-09-28 14:30:10, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int n;
int bead[501];
int counttoright(int start){
int sum = 0;
int last = 0;
for(int i = start; i < n; i++){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
for(int i = 0; i < start; i++){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
return sum;
}
int counttoleft(int start){
int sum = 0;
int last = 0;
for(int i = start; i >= 0; i--){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
for(int i = n; i > start; i--){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
return sum;
}
int main(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> bead[i];
}
int max = 0;
int temp;
//count to right
for(int start = 0; start < n; start++){
temp = counttoright(start);
if(temp > max){
max = temp;
}
}
//count to left
for(int start = 0; start < n; start++){
temp = counttoleft(start);
if(temp > max){
max = temp;
}
}
cout << max;
} | # 2018156, 2024-09-28 14:39:21, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int n;
int bead[501];
int newbead[501];
int counttoright(int start){
int sum = 0;
int last = 0;
for(int i = start; i < n; i++){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
for(int i = 0; i < start; i++){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
return sum;
}
int delcount(int start){
int sum = 0;
int last = 0;
for(int i = start; i < n-1; i++){
if(last > newbead[i]){
return sum;
}
sum += newbead[i];
last = newbead[i];
}
for(int i = 0; i < start; i++){
if(last > newbead[i]){
return sum;
}
sum += newbead[i];
last = newbead[i];
}
return sum;
}
int counttoleft(int start){
int sum = 0;
int last = 0;
for(int i = start; i >= 0; i--){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
for(int i = n; i > start; i--){
if(last > bead[i]){
return sum;
}
sum += bead[i];
last = bead[i];
}
return sum;
}
int main(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> bead[i];
}
int max = 0;
int temp;
//count to right
for(int start = 0; start < n; start++){
temp = counttoright(start);
if(temp > max){
max = temp;
}
}
//count to left
// for(int start = 0; start < n; start++){
// temp = counttoleft(start);
// if(temp > max){
// max = temp;
// }
// }
int countnew = 0;
for(int del = 0; del < n; del++){
countnew = 0;
for(int i = 0; i < n; i++){
if(i != del){
newbead[countnew] = bead[i];
countnew++;
}
}
for(int start = 0; start < n; start++){
temp = delcount(start);
if(temp > max){
max = temp;
}
}
}
cout << max;
}
/*
7
6 7 5 9 5 8 3
5
2 2 2 2 2
6
6 5 4 3 2 1
10
2 1 2 0 3 2 3 2 2 2
*/ |
# 2017574, 2024-09-28 13:44:10, -------------------- (0%)
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B;
int input;
for (int i = 0; i < N; i++) {
cin >> input;
B.push_back(input);
}
int highest = 0;
int sum = 0;
int pre = 0;
for (int i = 0; i < N; i++) {
pre = B[i];
sum+= B[i];
for (int j = i+1; j <= N; j++) {
if (j == N) {
j = 0;
}
if (B[j] < pre) {
break;
}
sum += B[j];
pre = B[j];
}
if (sum > highest) {
highest = sum;
}
}
cout << highest << endl;
} | # 2017658, 2024-09-28 13:54:58, -------------------- (0%)
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B;
int input;
for (int i = 0; i < N; i++) {
cin >> input;
B.push_back(input);
}
int highest = 0;
int pre = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
bool check = false;
for (int k = i + 1; k <= N; k++) {
sum = 0;
pre = B[i];
sum+= B[i];
if (k == i) {
break;
}
if (k == N && check == false) {
k = 0;
check = true;
}
for (int j = i+1; j <= N; j++) {
if (j == k) {
continue;
}
if (j == N) {
j = 0;
}
if (j == 0) {
break;
}
if (B[j] < pre) {
continue;;
}
sum += B[j];
pre = B[j];
}
if (sum > highest) {
highest = sum;
}
}
}
cout << highest << endl;
} | # 2017687, 2024-09-28 13:57:33, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B;
int input;
for (int i = 0; i < N; i++) {
cin >> input;
B.push_back(input);
}
int highest = 0;
int pre = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
bool check = false;
for (int k = i + 1; k <= N; k++) {
sum = 0;
pre = B[i];
sum+= B[i];
if (k == i) {
break;
}
if (k == N && check == false) {
k = 0;
check = true;
}
for (int j = i+1; j <= N; j++) {
if (j == k) {
continue;
}
if (j == N) {
j = 0;
}
if (j == i) {
break;
}
if (B[j] < pre) {
break;
}
sum += B[j];
pre = B[j];
}
if (sum > highest) {
highest = sum;
}
}
}
cout << highest << endl;
} |
# 2015739, 2024-09-28 10:37:14, P--P---P--------P--P (25%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int findmaxpoint(int n, int p[])
{
int mx = 0;
for (int i = 0; i < n; i++)
{
int x = p[i];
for (int j = 0; j < n; j++)
{
if (p[(i + j) % n] < p[(1 + i + j) % n])
{
x += p[(i + j + 1) % n];
}
else
{
break;
}
}
mx = max(mx, x);
//cout << i << ' ' << x << endl;
}
return mx;
}
int main()
{
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++)
{
cin >> p[i];
}
int mx = findmaxpoint(n, p);
for (int i = 0; i < n; i++)
{
int t[n - 1];
for (int j = 0; j < n - 1; j++){
t[j] = p[(i+j)%n];
}
mx = max(mx, findmaxpoint(n - 1, t));
}
cout << mx;
} | # 2015748, 2024-09-28 10:38:31, PPPPPPPPPPPPPPPPP-PP (95%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int findmaxpoint(int n, int p[])
{
int mx = 0;
for (int i = 0; i < n; i++)
{
int x = p[i];
for (int j = 0; j < n; j++)
{
if (p[(i + j) % n] <= p[(1 + i + j) % n])
{
x += p[(i + j + 1) % n];
}
else
{
break;
}
}
mx = max(mx, x);
//cout << i << ' ' << x << endl;
}
return mx;
}
int main()
{
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++)
{
cin >> p[i];
}
int mx = findmaxpoint(n, p);
for (int i = 0; i < n; i++)
{
int t[n - 1];
for (int j = 0; j < n - 1; j++){
t[j] = p[(i+j)%n];
}
mx = max(mx, findmaxpoint(n - 1, t));
}
cout << mx;
} | # 2015759, 2024-09-28 10:39:29, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int findmaxpoint(int n, int p[])
{
int mx = 0;
for (int i = 0; i < n; i++)
{
int x = p[i];
for (int j = 0; j < n-1; j++)
{
if (p[(i + j) % n] <= p[(1 + i + j) % n])
{
x += p[(i + j + 1) % n];
}
else
{
break;
}
}
mx = max(mx, x);
//cout << i << ' ' << x << endl;
}
return mx;
}
int main()
{
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++)
{
cin >> p[i];
}
int mx = findmaxpoint(n, p);
for (int i = 0; i < n; i++)
{
int t[n - 1];
for (int j = 0; j < n - 1; j++){
t[j] = p[(i+j)%n];
}
mx = max(mx, findmaxpoint(n - 1, t));
}
cout << mx;
} |
# 2018031, 2024-09-28 14:26:00, -------------------- (0%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int N;
cin >> N;
int ball[(N)*2];
for(int i=0; i<N; i++){
cin >> ball[i];
ball[N+i]=ball[i];
}
int MAX=0;
for(int i=0; i<N; i++){
int x=i, sum=ball[x];
while(x!=N+i-1){
if(ball[x]<=ball[x+1]){
sum+=ball[x];
}
else break;
x++;
}
//cout << sum << endl;
if(MAX<sum) MAX=sum;
}
cout << endl;
for(int i=0; i<N; i++){
int j=0;
int newball[N*2-2];
for(int k=0; k<N-1; k++){
if(j==i){
j++;
}
newball[k]=ball[j];
newball[N-1+k]=newball[k];
j++;
}
for(int k=0; k<N-1; k++){
int x=k, sum=newball[x];
while(x!=N-1+k){
if(newball[x]<=newball[x+1]) sum+=newball[x];
else break;
x++;
}
//cout << sum << endl;
if(MAX<sum) MAX=sum;
}
}
cout << MAX;
} | # 2018258, 2024-09-28 14:47:21, PPPPPPPPPPPPPPPPPPPP (100%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int N;
cin >> N;
int ball[(N)*2];
for(int i=0; i<N; i++){
cin >> ball[i];
ball[N+i]=ball[i];
}
int MAX=0;
for(int i=0; i<N; i++){
int x=i, sum=ball[x];
while(x<N+i-1){
if(ball[x]<=ball[x+1]){
sum+=ball[x+1];
}
else break;
x++;
}
//cout << sum << endl;
if(MAX<sum) MAX=sum;
}
//cout << endl;
for(int i=0; i<N; i++){
int j=0;
int newball[N*2-2];
for(int k=0; k<N-1; k++){
if(j==i){
j++;
}
newball[k]=ball[j];
newball[N-1+k]=newball[k];
j++;
}
//cout << "new" << endl;
for(int k=0; k<N-1; k++){
int x=k, sum=newball[x];
//cout << "before " << sum << endl;
while(x<N-1+k-1){
if(newball[x]<=newball[x+1]) sum+=newball[x+1];
else break;
x++;
}
//cout << sum << endl;
if(MAX<sum) MAX=sum;
}
}
cout << MAX;
} |
# 2015896, 2024-09-28 10:54:55, PPPPPPPPPPPPPPPPPPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int meditate(int start, vector<int> balls, int deleted)
{
if (balls.empty())
return 0;
if (deleted == -1)
{
int sum = 0;
vector<bool> seen;
for (int i = 0; i < balls.size(); ++i)
{
seen.push_back(false);
}
for (int i = start;; i = (i + 1) % balls.size())
{
if (seen[i])
return sum;
if (balls[i] > balls[(i + 1) % balls.size()])
{
sum += balls[i];
return sum;
}
sum += balls[i];
seen[i] = true;
}
}
else
{
int sum = 0;
vector<bool> seen;
for (int i = 0; i < balls.size(); ++i)
{
seen.push_back(false);
}
for (int i = start;; i = (i + 1) % balls.size())
{
if (i == deleted)
continue;
if (seen[i])
return sum;
if (balls[i] > balls[i+1==deleted?(i + 2) % balls.size():(i + 1) % balls.size()])
{
sum += balls[i];
return sum;
}
sum += balls[i];
seen[i] = true;
}
}
}
int main()
{
int n, maxSanity = 0;
vector<int> balls;
cin >> n;
for (int i = 0; i < n; ++i)
{
int temp;
cin >> temp;
balls.push_back(temp);
}
for (int i = 0; i < n; ++i)
{
for (int j = -1; j < n; ++j)
{
maxSanity = max(maxSanity, meditate(i, balls, j));
}
}
cout << maxSanity;
} | # 2015982, 2024-09-28 11:01:16, PPPPPPPPPPPPPPPPPPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int meditate(int start, vector<int> balls, int deleted)
{
if (balls.empty())
return 0;
if (deleted == -1)
{
int sum = 0;
vector<bool> seen;
for (int i = 0; i < balls.size(); ++i)
{
seen.push_back(false);
}
for (int i = start;; i = (i + 1) % balls.size())
{
if (seen[i])
return sum;
if (balls[i] > balls[(i + 1) % balls.size()])
{
sum += balls[i];
return sum;
}
sum += balls[i];
seen[i] = true;
}
}
else
{
int sum = 0;
vector<bool> seen;
for (int i = 0; i < balls.size(); ++i)
{
seen.push_back(false);
}
for (int i = start;; i = (i + 1) % balls.size())
{
if (i == deleted)
continue;
if (seen[i])
return sum;
if (balls[i] > balls[i + 1 == deleted ? (i + 2) % balls.size() : (i + 1) % balls.size()])
{
sum += balls[i];
return sum;
}
sum += balls[i];
seen[i] = true;
}
}
}
int main()
{
int n, maxSanity = 0;
vector<int> balls;
cin >> n;
for (int i = 0; i < n; ++i)
{
int temp;
cin >> temp;
balls.push_back(temp);
}
for (int i = 0; i < n; ++i)
{
for (int j = -1; j < n; ++j)
{
maxSanity = max(maxSanity, meditate(i, balls, j));
}
}
cout << maxSanity;
} |
# 2016429, 2024-09-28 11:41:37, PPPPPPPP---------P-- (45%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> beads(n, 0);
for(auto &e : beads){
int x;
cin >> x;
e = x;
}
int max = 0;
for(int i = 0; i < n; i++){ //start
int power = 0;
for(int j = 0; j < n; j++){
power += beads[j];
if(beads[j] > beads[j+1]) break;
}
if(power > max) max = power;
int keep = beads[0];
beads.erase(beads.begin(), beads.begin()+1);
beads.push_back(keep);
// cout << beads[0] << endl;
}
for(int i = 0; i < n; i++){
vector<int> v = beads;
v.erase(v.begin()+i, v.begin()+1+i);
for(int j = 0; j < n-1; j++){
int power = 0;
for(int k = 0; k < n-1; k++){
power += beads[k];
if(beads[k] > beads[k+1]) break;
}
if(power > max) max = power;
int keep = beads[0];
beads.erase(beads.begin(), beads.begin()+1);
beads.push_back(keep);
}
}
cout << max;
} | # 2016468, 2024-09-28 11:43:40, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> beads(n, 0);
for(auto &e : beads){
int x;
cin >> x;
e = x;
}
int max = 0;
for(int i = 0; i < n; i++){ //start
int power = 0;
for(int j = 0; j < n; j++){
power += beads[j];
if(beads[j] > beads[j+1]) break;
}
if(power > max) max = power;
int keep = beads[0];
beads.erase(beads.begin(), beads.begin()+1);
beads.push_back(keep);
// cout << beads[0] << endl;
}
for(int i = 0; i < n; i++){
vector<int> v = beads;
v.erase(v.begin()+i, v.begin()+1+i);
for(int j = 0; j < n-1; j++){
int power = 0;
for(int k = 0; k < n-1; k++){
power += v[k];
if(v[k] > v[k+1]) break;
}
if(power > max) max = power;
int keep = v[0];
v.erase(v.begin(), v.begin()+1);
v.push_back(keep);
}
}
cout << max;
} |
# 2018144, 2024-09-28 14:37:50, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
int power(int beads[],int size , int start){
int point = 0;
for(int i = 0; i < size; i++){
point += beads[(i+start) % size];
int current = beads[(i+start) % size];
int next = beads[(i+start+1) % size];
if(next < current){
break;
}
}
return point;
}
int findmax(int beads[], int size){
//no remove
int max = 0;
for (int i = 0; i < size; i++){
max = std::max(max, power(beads,size,i));
}
//with remove
int tempbeads[size - 1];
for(int i = 0; i < size; i++){
//creating tempbeads
int pos = 0;
for(int j = 0; j < size; j++){
if(j != i){
tempbeads[pos] = beads[j];
pos++;
}
}
for (int i = 0; i < size-1; i++){
max = std::max(max, power(tempbeads,size-1,i));
}
}
return max;
}
int main(){
int N;
std::cin >> N;
int beads[N];
for(int i = 0; i < N; i++){
std::cin >> beads[i];
}
std::cout << findmax(beads,N);
return 0;
} |
# 2015894, 2024-09-28 10:54:41, PPPPPPPPPPPPPPPPPPPP (100%)
#include "bits/stdc++.h"
using namespace std;
int countbead(int beads[] , int start ,int now){
int sum = 0 ;
for(int i = start ; i <= now ; i++){
if(i == now-1){
if(beads[i] > beads[0]){
sum += beads[i];
return sum;
}
else{
sum+=beads[i];
break;
}
}
else{
if(beads[i] > beads[i+1]){
sum += beads[i];
return sum;
}
else{
sum+=beads[i];
}
}
}
for(int i = 0 ; i < start ; i++){
if(beads[i] > beads[i+1]){
sum += beads[i];
return sum;
}
else{
sum+=beads[i];
}
}
return sum;
}
int main(){
int n; cin >> n;
int bead[n];
int mx = 0;
for(int i = 0 ; i < n ; i++) cin >> bead[i];
for(int i = 0 ; i < n ; i++){
int synbead[n-1];
for(int j = 0 ; j < n ; j++){
if(i<j) synbead[j-1] = bead[j];
if(i>j) synbead[j] = bead[j];
}
for(int j = 0 ; j < n-1 ; j++){
mx = max(countbead(synbead,j,n-1),mx);
}
}
for(int i = 0 ; i < n ; i++){
mx = max(countbead(bead,i,n),mx);
}
cout << mx <<endl;
} |
# 2017558, 2024-09-28 13:41:51, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int counttime(int ball[],int a,int start,int remove,bool doremove){
int count =0;
for(int i =start;i<start+a;i++){
if(doremove && remove == (i%a)){
continue;
}else if(doremove && remove == (i%a)+1){
int j =i %a;
if(ball[j]<=ball[(j+2)%a]){
count+=ball[j];
}else if(ball[j]>ball[(j+2)%a]){
count+=ball[j];
return count;
}
}else{
int j =i %a;
if(ball[j]<=ball[(j+1)%a]){
count+=ball[j];
}else if(ball[j]>ball[(j+1)%a]){
count+=ball[j];
return count;
}
}
}
return count;
}
int main(){
int max=0;
int n;
cin>>n;
int bread[n];
for(int i=0;i<n;i++){
cin>>bread[i];
}
for(int i =0;i<n;i++){
for(int j =0;j<n;j++){
int x =counttime(bread,n,i,j,false);
if(x>max){
max=x;
}
x=counttime(bread,n,i,j,true);
if(x>max){
max=x;
}
}
}
cout<<max;
return 0;
} |
# 2017499, 2024-09-28 13:35:19, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> bead(n);
for (int i=0; i < n; i++) cin >> bead[i];
int max = 0;
for (int i=0; i < n; i++){
int sum = 0;
for (int j=i; j < n+i; j++){
sum += bead[j%n];
if (bead[j%n] > bead[(j+1)%n]){
break;
}
}
if (sum > max) max = sum;
// cout << sum << endl;
}
for (int i=0; i < n; i++){
vector<int> temp;
for (int j=0; j < n; j++){
if (j != i) temp.push_back(bead[j]);
}
for (int k=0; k < n; k++){
int sum = 0;
for (int l=k; l < (n-1)+k; l++){
sum += temp[l%(n-1)];
// cout << temp[l%(n-1)] << " ";
if (temp[l%(n-1)] > temp[(l+1)%(n-1)]){break;}
}
if (sum > max) max = sum;
// cout << endl;
// cout << sum << endl;
}
temp.clear();
}
cout << max;
} |
# 2016994, 2024-09-28 12:44:38, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <vector>
using namespace std;
int n,sum,ans = 0;
vector<int> vct;
vector<int> vlr;
void calculate()
{
sum = vlr[0];
for (size_t i = 1; i < vlr.size(); i++)
{
if(vlr[i] < vlr[i-1]){break;}
sum += vlr[i];
}
ans = max(ans,sum);
}
void cloner()
{
for (size_t i = 0; i < vct.size(); i++)
{
vlr.push_back(vct[i]);
}
}
int main()
{
cin >> n;
int temp;
for (size_t i = 0; i < n; i++)
{
cin >> temp;
vct.push_back(temp);
}
cloner();
calculate();
for (size_t i = 0; i < vlr.size(); i++)
{
vlr.push_back(vlr[0]);
vlr.erase(vlr.begin());
calculate();
}
vlr.clear();
for (size_t i = 0; i < vct.size(); i++)
{
cloner();
vlr.erase(vlr.begin() + i);
calculate();
for (size_t j = 0; j < vlr.size(); j++)
{
vlr.push_back(vlr[0]);
vlr.erase(vlr.begin());
calculate();
}
vlr.clear();
}
cout << ans;
} |
# 2018300, 2024-09-28 14:51:04, PPPPPPPPPPPPPPPPPPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x[n];
int i,j,k,sum=0,max=-1;
for(i=0;i<n;i++){
cin>>x[i];
}
for(i=0;i<n;i++){
sum=0;
int a=0;
for(j=i;true;j++){
if(j==n){
j=0;
a=1;
}
if(j>=i&&a==1){
break;
}
if(j==n-1){
if(x[j]>x[0]){
sum+=x[j];
break;
}
else {
sum+=x[j];
}
}
else if(j<n){
if(x[j]>x[j+1]){
sum+=x[j];
break;
}
else sum+=x[j];
}
}
//cout<<i<<" "<<max<<" "<<sum<<endl;
if(max<sum){
max=sum;
}
}
for(k=0;k<n;k++){
for(i=0;i<n;i++){
sum=0;
int a=0;
for(j=i;true;j++){
if(j==n){
j=0;
a=1;
}
if(j>=i&&a==1){
break;
}
if(j==k){
continue;
}
else if(j+1!=k){
if(j==n-1){
if(x[j]>x[0]){
sum+=x[j];
break;
}
else {
sum+=x[j];
}
}
else if(j<n){
if(x[j]>x[j+1]){
sum+=x[j];
break;
}
else sum+=x[j];
}
}
else if(j==k){
continue;
}
else if(j+1==k){
if(j==n-1){
if(x[j]>x[1]){
sum+=x[j];
break;
}
else {
sum+=x[j];
}
}
else if(j==n-2){
if(x[j]>x[0]){
sum+=x[j];
break;
}
else {
sum+=x[j];
}
}
else if(j<n){
if(x[j]>x[j+2]){
sum+=x[j];
break;
}
else sum+=x[j];
}
}
}
//cout<<k<<" "<<i<<" "<<max<<" "<<sum<<endl;
if(max<sum){
max=sum;
}
}
}
cout<<max;
} |
# 2015821, 2024-09-28 10:46:18, PPPPPPPPPPPPPPPPPPPP (100%)
#include<iostream>
#include<string>
#include<cmath>
#include<iomanip>
int loca(int i,int j,int a){
if(i+j>=a)return (i+j-a);
else return(i+j);
}
int chax(int a ,int lu[] ){
int max=0;
for(int i=0;i<a;i++){
int re=0;
for(int j=1;j<=a;j++)
{
if(lu[loca(i,j,a)]<lu[loca(i,j-1,a)])
{
re+=lu[loca(i,j-1,a)];
break;
}
else re+=lu[loca(i,j-1,a)];
}
//std::cout<<re<<std::endl;
if(re>=max)max=re;
}
return max;
}
int main(){
int a=0;
std::cin>>a;
int lu[a],max=0;
for(int i=0;i<a;i++)std::cin>>lu[i];
max=chax(a,lu);
for(int i=0;i<a;i++){
int cu[a-1],ch=0;
for(int j=0;j<a;j++)
{
if(j==i)ch=1;
else
{
cu[j-ch]=lu[j];
}
}
if(max<chax(a-1,cu))max=chax(a-1,cu);
}
std::cout<<max<<std::endl;
} |
# 2017991, 2024-09-28 14:23:29, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
int num[n];
for (int i=0 ; i<n ; i++) {
cin>>num[i];
}
int total=0, most_total=0, cur=0;
for (int i=-1 ; i<n ; i++) { //cut
for (int j=0 ; j<n ; j++) { //start index
if (j!=i){
//begining
total = num[j];
cur=num[j];
for (int k=j+1 ; k<n+j ; k++) { //count index
if (k%n!=i) {
if (num[k%n]<cur) {
break;
}
cur=num[k%n];
total+=num[k%n];
}
}
if (total>most_total){
most_total=total;
}
}
}
}
cout<<most_total;
} |
# 2017710, 2024-09-28 14:00:39, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int bracelet[n];
for (int i = 0; i < n; i++)
{
cin >> bracelet[i];
}
int max_samarthi = INT32_MIN;
// calculate full bracelet first
for (int i = 0; i < n; i++) // i == start counting at which bead in bracelet
{
int samarthi = 0;
int current = bracelet[i], previous = bracelet[i];
for (int j = 0; j < n; j++) // j == add beads until current val < previous val
{
int index;
if (j + i >= n)
index = j + i - n;
else
index = j + i;
current = bracelet[index];
if (current < previous)
break;
samarthi += bracelet[index];
previous = current;
}
max_samarthi = max(max_samarthi, samarthi);
}
// try removing each beads, find max (no need to remember which bead was removed)
for (int skip = 0; skip < n; skip++)
{
for (int i = 0; i < n; i++) // i == start counting at which bead in bracelet
{
if (i == skip) continue;
int samarthi = 0;
int current = bracelet[i], previous = bracelet[i];
for (int j = 0; j < n; j++) // j == add beads until current val < previous val
{
if (j == skip) continue;
int index;
if (j + i >= n)
index = j + i - n;
else
index = j + i;
current = bracelet[index];
if (current < previous)
break;
samarthi += bracelet[index];
previous = current;
}
max_samarthi = max(max_samarthi, samarthi);
}
}
cout << max_samarthi << endl;
return 0;
} |
# 2017912, 2024-09-28 14:14:58, PPPPPPPPPPPPPPPPPPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> all;
for(int i{0};i<N;i++){
int x;
cin >> x;
all.push_back(x);
}
int ans{0};
for(int i{0};i<N;i++){
int sum{0};
for(int j{0},pos{i};j<N;j++,pos++){
sum += all[pos%N];
if(all[pos%N]>all[(pos+1)%N]) break;
}
if(sum>ans) ans = sum;
}
for(int k{0};k<N;k++){
vector<int> all2 = all;
auto it = all2.begin();
all2.erase(it+k);
for(int i{0};i<N-1;i++){
int sum{0};
for(int j{0},pos{i};j<N-1;j++,pos++){
sum += all2[pos%(N-1)];
if(all2[pos%(N-1)]>all2[(pos+1)%(N-1)]) break;
}
if(sum>ans) ans = sum;
}
}
cout << ans;
} |
# 2018167, 2024-09-28 14:40:01, PPPPPPPPPPPPPPPPPPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,previous,j,k,l,maxpower=0,power=0;
cin >> n;
int b[n],d[n-1];
for(i=0;i<n;i++){
cin >> b[i];
}
for(i=0;i<n;i++){
previous=i;
for(j=i;j<n;j++){
if(j==i||b[j]>=b[previous]){
power=power+b[j];
previous=j;
if(j==i-1||(i==0&&j==n-1)){
break;
}
if(j==n-1){
j=-1;
}
}
else{
break;
}
}
if(power>maxpower){
maxpower=power;
}
power=0;
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i<j){
d[j-1]=b[j];
}
if(i>j){
d[j]=b[j];
}
}
for(k=0;k<n-1;k++){
previous=k;
for(l=k;l<n-1;l++){
if(l==k||d[l]>=d[previous]){
power=power+d[l];
previous=l;
if(l==k-1||(k==0&&l==n-2)){
break;
}
if(l==n-2){
l=-1;
}
}
else{
break;
}
}
if(power>maxpower){
maxpower=power;
}
power=0;
}
}
cout << maxpower;
} |
# 2017813, 2024-09-28 14:08:13, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <vector>
using namespace std;
long long mostofpower (vector <int> bead) {
int n = bead.size();
long long most = 0;
for (int i=0;i<n;i++) {
int count = 0;
int sum = bead[i];
int index = i;
while (count < n-1) {
if (index!=n-1) {
if (bead[index]>bead[index+1]) break;
}
else if (bead[index]>bead[0]) break;
index++;
if (index>=n) index = 0;
sum+=bead[index];
count++;
}
if (most<sum) most = sum;
}
return most;
}
int main () {
int n;
cin >> n;
vector <int> bead;
for (int i=0;i<n;i++) {
int a;
cin >> a;
bead.push_back(a);
}
long long most = mostofpower(bead);
for (int j=0;j<n;j++) {
int index = j;
vector <int> onebead;
for (int i=0;i<n;i++) {
if (i==index) {
continue;
}
onebead.push_back(bead[i]);
}
long long onemost = mostofpower(onebead);
if (most<onemost) most = onemost;
}
cout << most;
} |
# 2017750, 2024-09-28 14:03:56, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <array>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
int beadPower[n] = {0};
for (int i = 0; i < n; i++)
{
cin >> beadPower[i];
}
int maxTotalBP = 0;
for (int i = 0; i < n; i++)
{
// i is the starting pos
int currentBP = 0;
for (int j = 0; j < n; j++)
{
int currentPos = (i + j) % n;
int nextPos = (currentPos + 1) % n;
currentBP += beadPower[currentPos];
if (beadPower[currentPos] > beadPower[nextPos])
{
break;
}
}
if (currentBP > maxTotalBP)
{
maxTotalBP = currentBP;
}
}
// another loop for newBead
int newBP[n - 1] = {0};
for (int i = 0; i < n; i++)
{
bool skipped = false;
for (int j = 0; j < n - 1; j++)
{
if (j == i)
{
skipped = true;
newBP[j] = beadPower[j + 1];
}
else if (skipped)
{
newBP[j] = beadPower[j + 1];
}
else
{
newBP[j] = beadPower[j];
}
}
for (int m = 0; m < (n - 1); m++)
{
int currentBP = 0;
for (int k = 0; k < (n-1); k++)
{
int currentPos = (m + k) % (n - 1);
int nextPos = (currentPos + 1) % (n - 1);
currentBP += newBP[currentPos];
if (newBP[currentPos] > newBP[nextPos])
{
break;
}
}
if (currentBP > maxTotalBP)
{
maxTotalBP = currentBP;
}
}
}
cout << maxTotalBP <<endl;
} |
# 2018037, 2024-09-28 14:26:34, PPPPPPPPPPPPPPPPPPPP (100%)
#include <iostream>
#include <vector>
using namespace std;
int get(vector<int> vec) {
int max = 0;
for (int i = 0; i < vec.size(); i++) {
int total = 0;
int pre = vec[i];
total += vec[i];
for (int i2 = 1; i2 < vec.size(); i2++) {
if (vec[(i + i2) % vec.size()] >= pre) {
total += vec[(i + i2) % vec.size()];
pre = vec[(i + i2) % vec.size()];
} else {
break;
}
if (total > max) {
max = total;
}
}
}
return max;
}
int main() {
int nums;
int max = 0;
cin >> nums;
vector<int> vec(nums);
for (int i = 0; i < nums; i++) {
cin >> vec[i];
}
max = get(vec);
for (int i = 0; i < nums; i++) {
vector<int> vec2 = vec;
vec2.erase(vec2.begin() + i);
int g = get(vec2);
if (g > max) {
max = g;
}
}
cout << max << endl;
} |
# 2015454, 2024-09-28 10:08:01, PPPPPPPPPPPPPPPPPPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int num[n];
int max = 0;
for(int i = 0;i < n;i++){
cin >> num[i];
}
for(int i = 0; i< n;i++){
int count = 0;
int t = i;
int prev = 0;
for(int j = 0;j < n;j++){
if(t==n)t = 0;
if(prev > num[t])break;
count += num[t];
prev = num[t];
t++;
}
if(count > max)max = count;
for(int j = 0;j < n;j++){
count = 0;
t = i;
prev = 0;
for(int k = 0;k < n;k++){
if(j == t){
t++;
continue;
}
if(t==n)t = 0;
if(prev > num[t])break;
count += num[t];
prev = num[t];
t++;
}
if(count > max)max = count;
}
}
cout << max;
return 0;
} |
# 2018019, 2024-09-28 14:24:57, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int bead[n * 2];
for (int i = 0; i < n; i++)
{
cin >> bead[i];
bead[i + n] = bead[i];
}
int max = 0;
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead[j];
if (bead[j] > bead[j + 1] || round > n - 1)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
cout << max << endl;
} | # 2018126, 2024-09-28 14:36:24, PPPPPPPPPPPPPPPPP-PP (95%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int bead[n * 2];
for (int i = 0; i < n; i++)
{
cin >> bead[i];
bead[i + n] = bead[i];
}
int max = 0;
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead[j];
if (bead[j] > bead[j + 1] || round > n - 1)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
for (int k = 0; k < n; k++)
{
int bead_cut[(n - 1) * 2];
for (int g = 0, h = 0; g < n; g++)
{
if (g == k)
{
continue;
}
bead_cut[h] = bead[g];
bead_cut[h + n - 1] = bead_cut[h];
h++;
}
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead_cut[j];
if (bead_cut[j] > bead_cut[j + 1] || round > n - 1)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
}
cout << max << endl;
} | # 2018212, 2024-09-28 14:43:22, PPPPPPPPPPPPPPPPP-PP (95%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int bead[n * 2];
for (int i = 0; i < n; i++)
{
cin >> bead[i];
bead[i + n] = bead[i];
}
int max = 0;
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead[j];
if (bead[j] > bead[j + 1] || round > n - 2)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
for (int k = 0; k < n; k++)
{
int bead_cut[(n - 1) * 2] = {0};
for (int g = 0, h = 0; g < n; g++)
{
if (g == k)
{
continue;
}
bead_cut[h] = bead[g];
bead_cut[h + n - 1] = bead_cut[h];
h++;
}
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead_cut[j];
if (bead_cut[j] > bead_cut[j + 1] || round > n - 2)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
}
cout << max << endl;
} | # 2018499, 2024-09-28 15:05:15, PPPPPPPPPPPPPPPPP-PP (95%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int bead[n * 2];
for (int i = 0; i < n; i++)
{
cin >> bead[i];
bead[i + n] = bead[i];
}
int max = 0;
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead[j];
if (bead[j] > bead[j + 1] || round > n - 2)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
for (int k = 0; k < n; k++)
{
int bead_cut[(n - 1) * 2] = {0};
for (int g = 0, h = 0; g < n; g++)
{
if (g == k)
{
continue;
}
bead_cut[h] = bead[g];
bead_cut[h + n - 1] = bead_cut[h];
h++;
}
for (int i = 0; i < n - 1; i++)
{
int total = 0;
for (int j = i, round = 0; j < (n - 1)* 2; j++)
{
total += bead_cut[j];
if (bead_cut[j] > bead_cut[j + 1] || round > n - 2)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
}
cout << max << endl;
} | # 2018725, 2024-09-28 15:16:58, PPPPPPPPPPPPPPPPP-PP (95%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int bead[n * 2];
for (int i = 0; i < n; i++)
{
cin >> bead[i];
bead[i + n] = bead[i];
}
int max = 0;
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead[j];
if (bead[j] > bead[j + 1] || round > n - 1)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
for (int k = 0; k < n; k++)
{
int bead_cut[(n - 1) * 2] = {0};
for (int g = 0, h = 0; g < n; g++)
{
if (g == k)
{
continue;
}
bead_cut[h] = bead[g];
bead_cut[h + n - 1] = bead_cut[h];
h++;
}
for (int i = 0; i < n - 1; i++)
{
int total = 0;
for (int j = i, round = 0; j < (n - 1)* 2; j++)
{
total += bead_cut[j];
if (bead_cut[j] > bead_cut[j + 1] || round > n - 1)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
}
cout << max << endl;
} | # 2018790, 2024-09-28 15:18:56, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int bead[n * 2];
for (int i = 0; i < n; i++)
{
cin >> bead[i];
bead[i + n] = bead[i];
}
int max = 0;
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead[j];
if (bead[j] > bead[j + 1] || round > n - 1)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
// for (int k = 0; k < n; k++)
// {
// int bead_cut[(n - 1) * 2] = {0};
// for (int g = 0, h = 0; g < n; g++)
// {
// if (g == k)
// {
// continue;
// }
// bead_cut[h] = bead[g];
// bead_cut[h + n - 1] = bead_cut[h];
// h++;
// }
// for (int i = 0; i < n - 1; i++)
// {
// int total = 0;
// for (int j = i, round = 0; j < (n - 1)* 2; j++)
// {
// total += bead_cut[j];
// if (bead_cut[j] > bead_cut[j + 1] || round > n - 1)
// {
// break;
// }
// round++;
// }
// if (total > max)
// {
// max = total;
// }
// }
// }
cout << max << endl;
} | # 2018823, 2024-09-28 15:19:40, PPPPPPPPPPPPPPPPP-PP (95%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n = 0;
cin >> n;
int bead[n * 2];
for (int i = 0; i < n; i++)
{
cin >> bead[i];
bead[i + n] = bead[i];
}
int max = 0;
for (int i = 0; i < n; i++)
{
int total = 0;
for (int j = i, round = 0; j < n * 2; j++)
{
total += bead[j];
if (bead[j] > bead[j + 1] || round > n - 2)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
for (int k = 0; k < n; k++)
{
int bead_cut[(n - 1) * 2] = {0};
for (int g = 0, h = 0; g < n; g++)
{
if (g == k)
{
continue;
}
bead_cut[h] = bead[g];
bead_cut[h + n - 1] = bead_cut[h];
h++;
}
for (int i = 0; i < n - 1; i++)
{
int total = 0;
for (int j = i, round = 0; j < (n - 1)* 2; j++)
{
total += bead_cut[j];
if (bead_cut[j] > bead_cut[j + 1] || round > n - 2)
{
break;
}
round++;
}
if (total > max)
{
max = total;
}
}
}
cout << max << endl;
} |
# 2015937, 2024-09-28 10:57:18, xxxxxxxxxxxxxxxxxxxx (0%)
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n+5];
for(int i=0; i<n; i++)
{
cin >> a[i];
}
int count = n;
// find start
int total[100]={};
for(int i=0; i<n; i++)
{
int now , next;
now = i;
total[i] = a[i];
for(int j=0; j<n; j++)
{
next = (now+1)%n;
// check
if(a[now]<=a[next])
{
// condition
total[i] += a[next];
}
else
{
break;
}
now = next;
}
//cout << total << endl;
}
// if delete 1 ball
int new_a[n+5];
int k=0;
for(int i=0; i<n; i++)
{
//new_a[n+5] = {};
k=0;
for(int j=0; j<n-1; j++)
{
if(k==i)
{
k++;
}
new_a[j]=a[k];
k++;
//cout << new_a[j] << " ";
}
//cout << endl;
for(int b=0; b<n-1; b++)
{
int now , next;
now = b;
total[count] = new_a[b];
for(int c=0; c<n-1; c++)
{
next = (now+1)%(n-1);
// check
if(new_a[now]<=new_a[next])
{
// condition
total[count] += new_a[next];
}
else
{
break;
}
now = next;
}
//cout << total[count] << endl;
count++;
//cout << total << endl;
}
}
int max = -9999;
for(int i=0; i<count; i++)
{
if(total[i]>max)
max = total[i];
}
cout << max ;
} | # 2015950, 2024-09-28 10:58:47, PPPPPxxxxxxxxxxxxxxx (25%)
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n+5];
for(int i=0; i<n; i++)
{
cin >> a[i];
}
int count = n;
// find start
int total[100000]={};
for(int i=0; i<n; i++)
{
int now , next;
now = i;
total[i] = a[i];
for(int j=0; j<n; j++)
{
next = (now+1)%n;
// check
if(a[now]<=a[next])
{
// condition
total[i] += a[next];
}
else
{
break;
}
now = next;
}
//cout << total << endl;
}
// if delete 1 ball
int new_a[n+5];
int k=0;
for(int i=0; i<n; i++)
{
//new_a[n+5] = {};
k=0;
for(int j=0; j<n-1; j++)
{
if(k==i)
{
k++;
}
new_a[j]=a[k];
k++;
//cout << new_a[j] << " ";
}
//cout << endl;
for(int b=0; b<n-1; b++)
{
int now , next;
now = b;
total[count] = new_a[b];
for(int c=0; c<n-1; c++)
{
next = (now+1)%(n-1);
// check
if(new_a[now]<=new_a[next])
{
// condition
total[count] += new_a[next];
}
else
{
break;
}
now = next;
}
//cout << total[count] << endl;
count++;
//cout << total << endl;
}
}
int max = -9999;
for(int i=0; i<count; i++)
{
if(total[i]>max)
max = total[i];
}
cout << max << endl ;
} | # 2015956, 2024-09-28 10:59:34, xxxxxxxxxxxxxxxxxxxx (0%)
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n+5];
for(int i=0; i<n; i++)
{
cin >> a[i];
}
int count = n;
// find start
int total[1000000000000]={};
for(int i=0; i<n; i++)
{
int now , next;
now = i;
total[i] = a[i];
for(int j=0; j<n; j++)
{
next = (now+1)%n;
// check
if(a[now]<=a[next])
{
// condition
total[i] += a[next];
}
else
{
break;
}
now = next;
}
//cout << total << endl;
}
// if delete 1 ball
int new_a[n+5];
int k=0;
for(int i=0; i<n; i++)
{
//new_a[n+5] = {};
k=0;
for(int j=0; j<n-1; j++)
{
if(k==i)
{
k++;
}
new_a[j]=a[k];
k++;
//cout << new_a[j] << " ";
}
//cout << endl;
for(int b=0; b<n-1; b++)
{
int now , next;
now = b;
total[count] = new_a[b];
for(int c=0; c<n-1; c++)
{
next = (now+1)%(n-1);
// check
if(new_a[now]<=new_a[next])
{
// condition
total[count] += new_a[next];
}
else
{
break;
}
now = next;
}
//cout << total[count] << endl;
count++;
//cout << total << endl;
}
}
int max = -9999;
for(int i=0; i<count; i++)
{
if(total[i]>max)
max = total[i];
}
cout << max << endl ;
} | # 2015963, 2024-09-28 11:00:01, xxxxxxxxxxxxxxxxxxxx (0%)
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n+5];
for(int i=0; i<n; i++)
{
cin >> a[i];
}
int count = n;
// find start
int total[1000000000]={};
for(int i=0; i<n; i++)
{
int now , next;
now = i;
total[i] = a[i];
for(int j=0; j<n; j++)
{
next = (now+1)%n;
// check
if(a[now]<=a[next])
{
// condition
total[i] += a[next];
}
else
{
break;
}
now = next;
}
//cout << total << endl;
}
// if delete 1 ball
int new_a[n+5];
int k=0;
for(int i=0; i<n; i++)
{
//new_a[n+5] = {};
k=0;
for(int j=0; j<n-1; j++)
{
if(k==i)
{
k++;
}
new_a[j]=a[k];
k++;
//cout << new_a[j] << " ";
}
//cout << endl;
for(int b=0; b<n-1; b++)
{
int now , next;
now = b;
total[count] = new_a[b];
for(int c=0; c<n-1; c++)
{
next = (now+1)%(n-1);
// check
if(new_a[now]<=new_a[next])
{
// condition
total[count] += new_a[next];
}
else
{
break;
}
now = next;
}
//cout << total[count] << endl;
count++;
//cout << total << endl;
}
}
int max = -9999;
for(int i=0; i<count; i++)
{
if(total[i]>max)
max = total[i];
}
cout << max << endl ;
} | # 2016021, 2024-09-28 11:04:39, PPPPPPPPPPPPPPPPP-PP (95%)
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n+5];
for(int i=0; i<n; i++)
{
cin >> a[i];
}
int count = n;
int max = -9999;
// find start
int total=0;
for(int i=0; i<n; i++)
{
int now , next;
now = i;
total = a[i];
for(int j=0; j<n; j++)
{
next = (now+1)%n;
// check
if(a[now]<=a[next])
{
// condition
total += a[next];
}
else
{
break;
}
now = next;
}
//cout << total << endl;
if(total>max)
max = total;
}
// if delete 1 ball
int new_a[n+5];
int k=0;
for(int i=0; i<n; i++)
{
//new_a[n+5] = {};
k=0;
for(int j=0; j<n-1; j++)
{
if(k==i)
{
k++;
}
new_a[j]=a[k];
k++;
//cout << new_a[j] << " ";
}
//cout << endl;
for(int b=0; b<n-1; b++)
{
int now , next;
now = b;
total = new_a[b];
for(int c=0; c<n-1; c++)
{
next = (now+1)%(n-1);
// check
if(new_a[now]<=new_a[next])
{
// condition
total += new_a[next];
}
else
{
break;
}
now = next;
}
//cout << total << endl;
count++;
if(total>max)
max = total;
}
}
cout << max << endl ;
} | # 2016045, 2024-09-28 11:07:44, PPPPPP-P---PPPPPP-PP (75%)
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n+5];
for(int i=0; i<n; i++)
{
cin >> a[i];
}
int count = n;
int max = -9999;
// find start
int total=0;
for(int i=0; i<n; i++)
{
int now , next;
now = i;
total = a[i];
for(int j=0; j<n; j++)
{
next = (now+1)%n;
// check
if(a[now]<=a[next])
{
// condition
total += a[next];
}
else
{
break;
}
now = next;
}
//cout << total << endl;
if(total>max)
max = total;
}
// if delete 1 ball
int new_a[n+5];
int k=0;
for(int i=0; i<n; i++)
{
//new_a[n+5] = {};
k=0;
for(int j=0; j<n-1; j++)
{
if(k==i)
{
k++;
}
new_a[j]=a[k];
k++;
//cout << new_a[j] << " ";
}
//cout << endl;
for(int b=0; b<n-1; b++)
{
int now , next;
now = b;
total = new_a[b];
for(int c=0; c<n-1; c++)
{
next = (now+1)%(n-1);
// check
if(new_a[now]<=new_a[next])
{
// condition
total += new_a[next];
}
else
{
break;
}
now = next;
}
//cout << total << endl;
count++;
if(total>max)
max = total;
}
}
bool repeat;
for(int i=0; i<n-1; i++)
{
if(a[i]==a[i+1])
repeat = true;
else repeat = false;
}
if(repeat==true)
max = max-a[0];
cout << max << endl ;
} |
# 2015831, 2024-09-28 10:47:13, PPPPPPPPPPPPPPPPP-PP (95%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int amt;
cin >> amt;
int arr[amt];
for (int i = 0; i < amt; ++i)
{
cin >> arr[i];
}
int max_num = 0;
for (int i = 0; i < amt; ++i)
{
int tmp_arr[amt];
int idx = 0;
for (int f = amt - i; f < amt; ++f)
{
tmp_arr[idx] = arr[f];
idx++;
}
for (int b = 0; b < amt - i; ++b)
{
tmp_arr[idx] = arr[b];
idx++;
}
int tmp_sum = 0;
for (int j = 0; j < amt; ++j)
{
tmp_sum += tmp_arr[j];
if (tmp_arr[j] > tmp_arr[j + 1])
break;
}
if (tmp_sum > max_num)
max_num = tmp_sum;
}
for (int i = 0; i < amt; ++i)
{
for (int ig = 0; ig < amt; ++ig)
{
int tmp_arr[amt - 1];
int idx = 0;
for (int f = amt - i; f < amt; ++f)
{
if (f == ig)
continue;
tmp_arr[idx] = arr[f];
idx++;
}
for (int b = 0; b < amt - i; ++b)
{
if (b == ig)
continue;
tmp_arr[idx] = arr[b];
idx++;
}
int tmp_sum = 0;
for (int j = 0; j < amt; ++j)
{
tmp_sum += tmp_arr[j];
if (tmp_arr[j] > tmp_arr[j + 1])
break;
}
if (tmp_sum > max_num)
max_num = tmp_sum;
}
}
cout << max_num;
} |
# 2015681, 2024-09-28 10:31:33, -----------------P-- (5%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0,past = arr[i];
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j == n) j = 0;
if(!shit){
sum+= arr[j];
if(past < arr[j]){
shit = true;
}
past = arr[j];
}
suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
int sum = suparr[i][1],past = suparr[i][1];
for (int k = 2; k < n; k++){
sum+= suparr[i][k];
if(past < suparr[i][k]){
break;
}
past = suparr[i][k];
}
if(sum > max)max = sum;
}
cout << max;
} | # 2015984, 2024-09-28 11:01:19, --P-P------------P-- (15%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0,past = arr[i];
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j >= n) j = 0;
if(!shit){
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
break;
}
}
if(arr[j] > arr[j+1]){
shit = true;
}
past = arr[j];
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0,past = suparr[i][t];
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
past = suparr[i][j];
}
if(sum > max)max = sum;
}
}
cout << max;
} | # 2016001, 2024-09-28 11:02:53, --P-P------P---P-PPP (35%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0;
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j >= n) j = 0;
if(!shit){
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
break;
}
continue;
}
if(arr[j] > arr[j+1]){
shit = true;
}
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0;
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
continue;
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
}
if(sum > max)max = sum;
}
}
cout << max;
} | # 2016062, 2024-09-28 11:09:22, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0;
for (int k = 0,j = i; k < n; k++,j++){
if(j == n)j = 0;
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
break;
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
continue;
}
if(arr[j] > arr[j+1]){
break;
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0;
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
continue;
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
}
if(sum > max)max = sum;
}
}
cout << max;
} | # 2016111, 2024-09-28 11:14:18, -PPPPPPPPPPPP-PPPPPP (90%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0;
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j >= n) j = 0;
if(!shit){
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
shit = true;
continue;
}
}
if(arr[j] > arr[j+1]){
shit = true;
}
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0;
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
continue;
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
}
if(sum > max)max = sum;
}
}
cout << max;
} | # 2016118, 2024-09-28 11:15:15, -PPPPPPPPPPPP-PPP-PP (85%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
if(n == 1){
cout << n;
return 0;
}
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0;
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j >= n) j = 0;
if(!shit){
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
shit = true;
continue;
}
}
if(arr[j] > arr[j+1]){
shit = true;
}
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0;
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
continue;
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
}
if(sum > max)max = sum;
}
}
cout << max;
} | # 2016128, 2024-09-28 11:15:59, -PPPPPPPPPPPP-PPPPPP (90%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
if(n == 0){
cout << 0;
return 0;
}
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0;
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j >= n) j = 0;
if(!shit){
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
shit = true;
continue;
}
}
if(arr[j] > arr[j+1]){
shit = true;
}
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0;
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
continue;
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
}
if(sum > max)max = sum;
}
}
cout << max;
} | # 2016136, 2024-09-28 11:16:41, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
if(n = 1){
int a;
cin >> a;
cout << a;
return 0;
}
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0;
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j >= n) j = 0;
if(!shit){
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
shit = true;
continue;
}
}
if(arr[j] > arr[j+1]){
shit = true;
}
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0;
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
continue;
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
}
if(sum > max)max = sum;
}
}
cout << max;
} | # 2016138, 2024-09-28 11:16:50, -PPP-PPPPPPPP-PPP-PP (80%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
if(n == 1){
int a;
cin >> a;
cout << a;
return 0;
}
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0;
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j >= n) j = 0;
if(!shit){
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
shit = true;
continue;
}
}
if(arr[j] > arr[j+1]){
shit = true;
}
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0;
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
continue;
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
}
if(sum > max)max = sum;
}
}
cout << max;
} | # 2016143, 2024-09-28 11:17:07, -PPPPPPPPPPPP-PPPPPP (90%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int arr[n];
int suparr[n][n];
int max = -1;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++){
int sum = 0;
bool shit = false;
for (int k = 0,j = i; k < n; k++,j++){
if(j >= n) j = 0;
if(!shit){
sum+= arr[j];
if(j == n-1){
if(arr[n-1] > arr[0]){
shit = true;
continue;
}
}
if(arr[j] > arr[j+1]){
shit = true;
}
}
if(k == 0)suparr[i][k] = 0;
else suparr[i][k] = arr[j];
}
if(sum > max)max = sum;
}
for (int i = 0; i < n; i++){
for (int t = 1; t < n; t++){
int sum = 0;
for (int k = 0,j = t; k < n-1; k++,j++){
if(j == n)j=1;
sum += suparr[i][j];
if(j == n-1){
if(suparr[i][n-1] > suparr[i][1]){
break;
}
continue;
}
if(suparr[i][j] > suparr[i][j+1]){
break;
}
}
if(sum > max)max = sum;
}
}
cout << max;
} |
# 2017898, 2024-09-28 14:13:53, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, sum = 0, max = -1;
cin >> n;
int power[n], powernew[n];
for (int i = 0; i < n; i++)
{
cin >> power[i];
}
for (int i = 0; i < n; i++)
{
if(power[i] >= power[i + 1] && i + 1 < n)
{
sum += power[i];
}
if (power[i] < power[i + 1] && i + 1 < n)
{
sum = 0;
}
if (sum > max)
{
max = sum;
}
}
int temp;
for (int j = 0; j < n; j++)
{
for (int i = 0; i < n; i++)
{
powernew[i] = power[i];
}
for (int i = j; i < n; i++)
{
temp = powernew[i];
powernew[i] = powernew[i + 1];
powernew[i + 1] = temp;
}
for (int i = 0; i < n - 1; i++)
{
if(power[i] >= power[i + 1] && i + 1 < n)
{
sum += power[i];
}
if (power[i] < power[i + 1] && i + 1 < n)
{
sum = 0;
}
if (sum > max)
{
max = sum;
}
}
}
cout << max;
} | # 2017915, 2024-09-28 14:15:55, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, sum = 0, max = -1;
cin >> n;
int power[n], powernew[n];
for (int i = 0; i < n; i++)
{
cin >> power[i];
}
for (int i = 0; i < n; i++)
{
if(power[i] <= power[i + 1] && i + 1 < n)
{
sum += power[i];
}
if (power[i] > power[i + 1] && i + 1 < n)
{
sum = 0;
}
if (sum > max)
{
max = sum;
}
}
int temp;
for (int j = 0; j < n; j++)
{
for (int i = 0; i < n; i++)
{
powernew[i] = power[i];
}
for (int i = j; i < n; i++)
{
temp = powernew[i];
powernew[i] = powernew[i + 1];
powernew[i + 1] = temp;
}
for (int i = 0; i < n - 1; i++)
{
if(power[i] <= power[i + 1] && i + 1 < n)
{
sum += power[i];
}
if (power[i] > power[i + 1] && i + 1 < n)
{
sum = 0;
}
if (sum > max)
{
max = sum;
}
}
}
cout << max;
} | # 2017930, 2024-09-28 14:17:31, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, sum = 0, max = -1;
cin >> n;
int power[n], powernew[n];
for (int i = 0; i < n; i++)
{
cin >> power[i];
}
for (int i = 0; i < n; i++)
{
if(power[i] <= power[i + 1] && i + 1 < n)
{
sum += power[i];
}
if (power[i] > power[i + 1] && i + 1 < n)
{
sum = 0;
}
if (sum > max)
{
max = sum;
}
}
cout << max;
} | # 2017970, 2024-09-28 14:21:50, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, sum = 0, max = -1;
cin >> n;
int power[n], powernew[n];
for (int i = 0; i < n; i++)
{
cin >> power[i];
}
for (int i = 0; i < n; i++)
{
if(power[i] <= power[i + 1])
{
sum += power[i];
}
if (power[i] > power[i + 1])
{
sum = 0;
}
if (sum > max)
{
max = sum;
}
}
cout << max;
} | # 2018060, 2024-09-28 14:29:16, --P-P------------P-- (15%)
#include <iostream>
using namespace std;
int main(){
int n, sum = 0, max = -1;
cin >> n;
int power[n], powernew[n];
bool first = true;
for (int i = 0; i < n; i++)
{
cin >> power[i];
}
for (int i = 0; i < n; i++)
{
if(power[i] <= power[i + 1])
{
sum += power[i];
}
if (power[i] > power[i + 1])
{
sum += power[i];
if (sum > max)
{
max = sum;
}
sum = 0;
}
if (i == n - 1 && first)
{
first = false;
i = 0;
if (power[n - 1] <= power[i])
{
sum += power[i];
}
if (power[i] > power[i + 1])
{
sum += power[i];
if (sum > max)
{
max = sum;
}
sum = 0;
}
}
if (sum > max)
{
max = sum;
}
}
cout << max;
} | # 2018456, 2024-09-28 15:02:25, PPPP-PPPPPPPPPPPP-PP (90%)
#include <iostream>
using namespace std;
int main(){
int n, sum = 0, max = -1;
cin >> n;
int power[n], powernew[n - 1];
bool first = true;
for (int i = 0; i < n; i++)
{
cin >> power[i];
}
for (int i = 0; i < n; i++)
{
if(power[i] <= power[i + 1])
{
sum += power[i];
}
if (power[i] > power[i + 1])
{
sum += power[i];
if (sum > max)
{
max = sum;
}
sum = 0;
}
if (i == n - 1 && first)
{
first = false;
i = 0;
if (power[n - 1] <= power[i])
{
sum += power[i];
}
if (power[i] > power[i + 1])
{
sum += power[i];
if (sum > max)
{
max = sum;
}
sum = 0;
}
}
if (sum > max)
{
max = sum;
}
}
for (int j = 0; j < n; j++)
{
bool second = true;
int k = 0;
for (int i = 0; i < n - 1; i++)
{
if (i == j)
{
k++;
}
powernew[i] = power[k];
k++;
}
for (int i = 0; i < n - 1; i++)
{
if(powernew[i] <= powernew[i + 1])
{
sum += powernew[i];
}
if (powernew[i] > powernew[i + 1])
{
sum += powernew[i];
if (sum > max)
{
max = sum;
}
sum = 0;
}
if (i == n - 2 && second)
{
second = false;
i = 0;
if (powernew[n - 2] <= powernew[i])
{
sum += powernew[i];
}
if (powernew[i] > powernew[i + 1])
{
sum += powernew[i];
if (sum > max)
{
max = sum;
}
sum = 0;
}
}
if (sum > max)
{
max = sum;
}
}
}
cout << max;
} |
# 2016022, 2024-09-28 11:04:42, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a[1000];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int sum = 0;
int m = 0;
bool go = false;
for (int i = 0; i < n; i++)
{
sum = 0;
go = false;
for (int j = i; j < n; j++)
{
sum += a[j];
if (j == n - 1)
{
if (a[j] > a[0])
{
go = true;
break;
}
}
if (a[j] > a[j + 1])
{
go = true;
break;
}
}
for (int j = 0; j < i && go == false; j++)
{
sum += a[j];
if (a[j] > a[j + 1])
{
go = true;
break;
}
}
if (sum > m)
{
cout << i << " 1 " << sum << endl;
}
m = max(m, sum);
}
for (int k = 0; k < n; k++)
{
for (int i = 0; i < n; i++)
{
sum = 0;
go = false;
if (i == k)
{
continue;
}
for (int j = i; j < n; j++)
{
if (j == k)
{
continue;
}
sum += a[j];
if (j == n - 1 && k == 0)
{
if (a[j] > a[1])
{
go = true;
break;
}
}
else if (j + 1 == k)
{
if(j == n-2)
{
if (a[j] > a[0])
{
go = true;
break;
}
}
else if (a[j] > a[j+2])
{
go = true;
break;
}
}
else if (j == n - 1)
{
if (a[j] > a[0])
{
go = true;
break;
}
}
else if (a[j] > a[j + 1])
{
go = true;
break;
}
}
for (int j = 0; j < i && go == false; j++)
{
if (j == k)
{
continue;
}
sum += a[j];
if(j == i-2 && j+1 == k)
{
break;
}
else if (j + 1 == k)
{
if (a[j] > a[j + 2])
{
go = true;
break;
}
}
else if (a[j] > a[j + 1])
{
go = true;
break;
}
}
/*if(k == 5)
{
cout << i << " " << sum << endl;
}
if (sum > m)
{
cout << i << " 2 " << sum << " " << k << endl;
}*/
m = max(m, sum);
}
}
cout << m << endl;
return 0;
} | # 2016029, 2024-09-28 11:05:49, PPPP-PPPPPPPPPPPP-PP (90%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a[1000];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int sum = 0;
int m = 0;
bool go = false;
for (int i = 0; i < n; i++)
{
sum = 0;
go = false;
for (int j = i; j < n; j++)
{
sum += a[j];
if (j == n - 1)
{
if (a[j] > a[0])
{
go = true;
break;
}
}
if (a[j] > a[j + 1])
{
go = true;
break;
}
}
for (int j = 0; j < i && go == false; j++)
{
sum += a[j];
if (a[j] > a[j + 1])
{
go = true;
break;
}
}
m = max(m, sum);
}
for (int k = 0; k < n; k++)
{
for (int i = 0; i < n; i++)
{
sum = 0;
go = false;
if (i == k)
{
continue;
}
for (int j = i; j < n; j++)
{
if (j == k)
{
continue;
}
sum += a[j];
if (j == n - 1 && k == 0)
{
if (a[j] > a[1])
{
go = true;
break;
}
}
else if (j + 1 == k)
{
if(j == n-2)
{
if (a[j] > a[0])
{
go = true;
break;
}
}
else if (a[j] > a[j+2])
{
go = true;
break;
}
}
else if (j == n - 1)
{
if (a[j] > a[0])
{
go = true;
break;
}
}
else if (a[j] > a[j + 1])
{
go = true;
break;
}
}
for (int j = 0; j < i && go == false; j++)
{
if (j == k)
{
continue;
}
sum += a[j];
if(j == i-2 && j+1 == k)
{
break;
}
else if (j + 1 == k)
{
if (a[j] > a[j + 2])
{
go = true;
break;
}
}
else if (a[j] > a[j + 1])
{
go = true;
break;
}
}
/*if(k == 5)
{
cout << i << " " << sum << endl;
}
if (sum > m)
{
cout << i << " 2 " << sum << " " << k << endl;
}*/
m = max(m, sum);
}
}
cout << m << endl;
return 0;
} |
# 2017528, 2024-09-28 13:38:45, PPPP-PPP------------ (35%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> marbles;
for(int i=0; i<N; i++){
int temp;
cin >> temp;
marbles.push_back(temp);
}
// count func
int maxsum = 0;
for(int i=0; i<marbles.size(); i++){
int sum = marbles[i];
for(int j=i; j<marbles.size(); j++){
if(marbles[j] > marbles[j+1]){
if(maxsum < sum){
maxsum = sum;
}
break;
} else {
sum+= marbles[j+1];
}
}
}
cout << maxsum;
} | # 2017629, 2024-09-28 13:51:57, PPPP-PPPPPPPP-PPP-PP (85%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> marbles;
vector<int> tempmarbles;
for(int i=0; i<N; i++){
int temp;
cin >> temp;
marbles.push_back(temp);
}
for(int i=0; i<N; i++){;
tempmarbles.push_back(marbles[i]);
}
// count func
int maxsum = 0;
for(int i=0; i<marbles.size(); i++){
int sum = marbles[i];
for(int j=i; j<marbles.size(); j++){
if(marbles[j] > marbles[j+1]){
if(maxsum < sum){
maxsum = sum;
}
break;
} else {
sum+= marbles[j+1];
}
}
}
for(int l=0; l<tempmarbles.size()+1; l++){
tempmarbles.erase(tempmarbles.begin()+l);
for(int i=0; i<tempmarbles.size(); i++){
int sum = tempmarbles[i];
for(int j=i; j<tempmarbles.size(); j++){
if(tempmarbles[j] > tempmarbles[j+1]){
if(maxsum < sum){
maxsum = sum;
}
break;
} else {
sum+= tempmarbles[j+1];
}
}
}
tempmarbles.insert(tempmarbles.begin()+l, marbles[l]);
}
cout << maxsum;
} |
# 2018077, 2024-09-28 14:31:08, PPPPPPPP---PPPPPPPPP (85%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<string>
using namespace std;
int main(){
int bestpossible = 0;
int counting=0;
int N ; cin >> N;
int arrball[N] = {0};
int arrballrm1[N-1] = {0};
for(int i = 0;i<N;i++){
cin >> arrball[i];
}
int previous = 10001;
int bc=0;
//1st not del and counting left to right
for(int i = 0;i<2*N-1;i++){
//cout << "i ="<<i<<endl;
int c = i;
if(c>= N) c -= N;
if (arrball[c] > previous||bc==N-1) {
if(arrball[c]<=previous) counting += arrball[c];
if(counting > bestpossible)bestpossible = counting;
counting = arrball[c];
bc = 1;
previous = arrball[c];
}
else {
counting += arrball[c];
previous = arrball[c];
bc += 1;
}
}
//cout << bestpossible;
//2nd not del and counting right to left.
counting = 0;
previous =10001;
bc = 0;
for(int i = N-1;i>-1*N+1;i--){
//cout << "i ="<<i<<endl;
int c = i;
if(c<0) c += N;
if (arrball[c] > previous||bc==N-1) {
if(arrball[c]<=previous) counting += arrball[c];
if(counting > bestpossible)bestpossible = counting;
counting = arrball[c];
bc = 1;
previous = arrball[c];
}
else {
counting += arrball[c];
previous = arrball[c];
bc += 1;
}
}
//cout << bestpossible << endl;
//3rd delete one and left to right
counting = 0;
previous =10001;
bc = 0;
for(int k = 0;k<N;k++){
for(int j = 0;j<N;j++){
if(j<k) arrballrm1[j] = arrball[j];
else if(j==k) continue;
else arrballrm1[j-1] = arrball[j];
}
/*for(int j = 0;j<N-1;j++){
cout << arrballrm1[j] << " ";
}cout << endl;*/
for(int i = 0;i<2*(N-1)-1;i++){
//cout << "i ="<<i<<endl;
int c = i;
if(c>= N-1) c -= (N-1);
if (arrballrm1[c] > previous||bc==N-2) {
if(arrballrm1[c]<=previous) counting += arrballrm1[c];
if(counting > bestpossible)bestpossible = counting;
counting = arrballrm1[c];
bc = 1;
previous = arrballrm1[c];
}
else {
counting += arrballrm1[c];
//cout << "counting sum by" << arrballrm1[c] << endl;
previous = arrballrm1[c];
bc += 1;
}
}
}
//cout << bestpossible;
//last
counting = 0;
previous =10001;
bc = 0;
for(int k = 0;k<N;k++){
for(int j = 0;j<N;j++){
if(j<k) arrballrm1[j] = arrball[j];
else if(j==k) continue;
else arrballrm1[j-1] = arrball[j];
}
/*for(int j = 0;j<N-1;j++){
cout << arrballrm1[j] << " ";
}cout << endl;*/
for(int i = N-2;i>-1*(N-1)+1;i--){
//cout << "i ="<<i<<endl;
int c = i;
if(c<0) c += N-1;
if (arrballrm1[c] > previous||bc==N-2) {
if(arrballrm1[c]<=previous) counting += arrballrm1[c];
if(counting > bestpossible)bestpossible = counting;
counting = arrballrm1[c];
bc = 1;
previous = arrballrm1[c];
}
else {
counting += arrballrm1[c];
previous = arrballrm1[c];
bc += 1;
}
}
}
cout << bestpossible << endl;
} |
# 2016152, 2024-09-28 11:18:46, PP--PPPP---------P-- (35%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T = 0, Max = INT_MIN;
cin >> N;
int P[N+5], count = 0, P1, P2, D;
vector<int> sum[N+5];
for(int i = 0; i < N; i++) {
cin >> P[i];
}
for(int j = 0; j < N; j++) {
P1 = (j+T) % N;
count = P[P1];
T = 0;
while(true) {
P1 = (j+T) % N;
P2 = (j+T+1) % N;
if(P[P1] <= P[P2]) {
count += P[P2];
// cout << P1 << " " << P2 << " " << count << endl;
}
else {
break;
}
T++;
}
sum[j].push_back(count);
}
for(int j = 0; j < N; j++) {
for(int i = 0; i < sum[j].size(); i++) {
if(sum[j][i] > Max) {
Max = sum[j][i];
}
}
}
cout << Max;
return 0;
} | # 2016501, 2024-09-28 11:45:45, PP--PPPPPPPPPP--PTPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T = 0, Max = INT_MIN;
cin >> N;
int P[N+5], count = 0, P1, P2, D;
vector<int> sum[N+5];
for(int i = 0; i < N; i++) {
cin >> P[i];
}
for(int D = 0; D < N; D++) {
T = 0;
for(int j = 0; j < N; j++) {
if(D != 0) {
P1 = (j+T) % (N-1);
if(P1 >= D) P1++;
}
else {
P1 = (j+T) % N;
}
count = P[P1];
T = 0;
while(true) {
if(D != 0) {
P1 = (j+T) % (N-1);
P2 = (j+T+1) % (N-1);
if(P1 >= D) P1++;
if(P2 >= D) P2++;
}
else {
P1 = (j+T) % N;
P2 = (j+T+1) % N;
}
if(P[P1] <= P[P2]) {
count += P[P2];
// cout << T << " " << j << " " << P[P1] << " " << P[P2] << " " << P1 << " " << P2 << " " << count << endl;
}
else {
break;
}
T++;
}
sum[j].push_back(count);
}
}
for(int j = 0; j < N; j++) {
for(int i = 0; i < sum[j].size(); i++) {
if(sum[j][i] > Max) {
Max = sum[j][i];
}
}
}
cout << Max;
return 0;
} | # 2016575, 2024-09-28 11:50:43, P------------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main() {
bool eq = false;
int N, T = 0, Max = INT_MIN;
cin >> N;
int P[N+5], count = 0, P1, P2, D;
vector<int> sum[N+5];
for(int i = 0; i < N; i++) {
cin >> P[i];
}
for(int i = 0; i < N-1; i++) {
if(P[i] == P[i+1]) {
cout << P[0] * N;
return 0;
}
}
for(int D = 0; D < N; D++) {
T = 0;
for(int j = 0; j < N; j++) {
if(D != 0) {
P1 = (j+T) % (N-1);
if(P1 >= D) P1++;
}
else {
P1 = (j+T) % N;
}
count = P[P1];
T = 0;
while(true) {
if(D != 0) {
P1 = (j+T) % (N-1);
P2 = (j+T+1) % (N-1);
if(P1 >= D) P1++;
if(P2 >= D) P2++;
}
else {
P1 = (j+T) % N;
P2 = (j+T+1) % N;
}
if(P[P1] <= P[P2]) {
count += P[P2];
// cout << T << " " << j << " " << P[P1] << " " << P[P2] << " " << P1 << " " << P2 << " " << count << endl;
}
else {
break;
}
T++;
}
sum[j].push_back(count);
}
}
for(int j = 0; j < N; j++) {
for(int i = 0; i < sum[j].size(); i++) {
if(sum[j][i] > Max) {
Max = sum[j][i];
}
}
}
cout << Max;
return 0;
} | # 2016587, 2024-09-28 11:51:28, P------------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main() {
bool eq = false;
int N, T = 0, Max = INT_MIN;
cin >> N;
int P[N+5], count = 0, P1, P2, D;
vector<int> sum[N+5];
for(int i = 0; i < N; i++) {
cin >> P[i];
}
for(int i = 0; i < N-1; i++) {
if(P[i] == P[i+1]) {
cout << P[0] * N;
return 0;
}
}
for(int D = 0; D < N; D++) {
T = 0;
for(int j = 0; j < N; j++) {
if(D != 0) {
P1 = (j+T) % (N-1);
if(P1 >= D) P1++;
}
else {
P1 = (j+T) % N;
}
count = P[P1];
T = 0;
while(true) {
if(D != 0) {
P1 = (j+T) % (N-1);
P2 = (j+T+1) % (N-1);
if(P1 >= D) P1++;
if(P2 >= D) P2++;
}
else {
P1 = (j+T) % N;
P2 = (j+T+1) % N;
}
if(P[P1] <= P[P2]) {
count += P[P2];
// cout << T << " " << j << " " << P[P1] << " " << P[P2] << " " << P1 << " " << P2 << " " << count << endl;
}
else {
break;
}
T++;
}
sum[j].push_back(count);
}
}
for(int j = 0; j < N; j++) {
for(int i = 0; i < sum[j].size(); i++) {
if(sum[j][i] > Max) {
Max = sum[j][i];
}
}
}
cout << Max;
return 0;
} | # 2016593, 2024-09-28 11:51:41, PP--PPPPPPPPPP--PTPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
bool eq = false;
int N, T = 0, Max = INT_MIN;
cin >> N;
int P[N+5], count = 0, P1, P2, D;
vector<int> sum[N+5];
for(int i = 0; i < N; i++) {
cin >> P[i];
}
// for(int i = 0; i < N-1; i++) {
// if(P[i] == P[i+1]) {
// cout << P[0] * N;
// return 0;
// }
// }
for(int D = 0; D < N; D++) {
T = 0;
for(int j = 0; j < N; j++) {
if(D != 0) {
P1 = (j+T) % (N-1);
if(P1 >= D) P1++;
}
else {
P1 = (j+T) % N;
}
count = P[P1];
T = 0;
while(true) {
if(D != 0) {
P1 = (j+T) % (N-1);
P2 = (j+T+1) % (N-1);
if(P1 >= D) P1++;
if(P2 >= D) P2++;
}
else {
P1 = (j+T) % N;
P2 = (j+T+1) % N;
}
if(P[P1] <= P[P2]) {
count += P[P2];
// cout << T << " " << j << " " << P[P1] << " " << P[P2] << " " << P1 << " " << P2 << " " << count << endl;
}
else {
break;
}
T++;
}
sum[j].push_back(count);
}
}
for(int j = 0; j < N; j++) {
for(int i = 0; i < sum[j].size(); i++) {
if(sum[j][i] > Max) {
Max = sum[j][i];
}
}
}
cout << Max;
return 0;
} |
# 2017630, 2024-09-28 13:51:58, P--P---P--------P--- (20%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(all<1){
break;
}
all--;
if(pra[a]>=pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
if(all<1){
break;
}
if(pra[a]<pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(all<1){
break;
}
all--;
if(pra[a]>=pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
}
}
cout<<max;
} | # 2017646, 2024-09-28 13:53:39, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
if(all<1){
break;
}
if(pra[a]<pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
}
}
cout<<max;
} | # 2017694, 2024-09-28 13:58:16, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
if(all<1){
break;
}
if(pra[a]<pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
}
}
cout<<max;
} | # 2017749, 2024-09-28 14:03:49, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
all++;
if(sum>max){
max = sum;
}
break;
}
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
}
}
cout<<max;
} | # 2017755, 2024-09-28 14:04:21, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
}
}
cout<<max;
} | # 2017760, 2024-09-28 14:04:35, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
if(all<1){
break;
}
if(pra[a]<pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
}
}
cout<<max;
} | # 2018147, 2024-09-28 14:38:29, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
all++;
if(sum>max){
max = sum;
}
break;
}
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
if(sum>max){
max = sum;
}
break;
}
}
if(sum>max){
max = sum;
}
}
}
cout<<max;
} | # 2018266, 2024-09-28 14:47:51, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
break;
}
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
if(sum>max){
max = sum;
}
if(all<1){
break;
}
all--;
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
}
}
cout<<max;
} | # 2018288, 2024-09-28 14:50:19, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
}
}
cout<<max;
} | # 2018305, 2024-09-28 14:51:32, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018360, 2024-09-28 14:55:19, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
for(int j=0;j<all;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018383, 2024-09-28 14:56:59, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<tmp;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018409, 2024-09-28 14:59:14, -P-P-PPPP----PP-P-P- (50%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<all;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<all;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018423, 2024-09-28 15:00:05, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<all;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018453, 2024-09-28 15:02:17, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<all;j++,a++){
if(a>2*n-1){
break;
}
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018506, 2024-09-28 15:05:57, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<all;j++,a++){
if(a>2*n-1){
break;
}
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
//inverse
vector<int> inverse;
for(int i=n-1;i>=0;i--){
inverse.push_back(pra[i]);
}
for(int i=0;i<n;i++){
inverse.push_back(inverse[i]);
}
for(int i=0;i<n;i++){
inverse.push_back(inverse[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=inverse[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=inverse[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(inverse[a]>inverse[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(inverse[a]<=inverse[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<all;j++,a++){
if(a>2*n-1){
break;
}
sum+=inverse[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(inverse[a]>inverse[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018578, 2024-09-28 15:10:30, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<all;j++,a++){
if(a>2*n-1){
break;
}
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018689, 2024-09-28 15:15:42, PPPPPPPPP-----P--P-- (55%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<10;j++,a++){
if(a>2*n-1){
break;
}
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018699, 2024-09-28 15:16:01, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<1000;j++,a++){
if(a>2*n-1){
break;
}
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018707, 2024-09-28 15:16:21, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<100000;j++,a++){
if(a>2*n-1){
break;
}
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018732, 2024-09-28 15:17:03, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<1;j++,a++){
if(a>2*n-1){
break;
}
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018760, 2024-09-28 15:18:06, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<1;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018773, 2024-09-28 15:18:21, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<100000;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} | # 2018801, 2024-09-28 15:19:07, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> pra;
int elm;
for(int i=0;i<n;i++){
cin>>elm;
pra.push_back(elm);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
for(int i=0;i<n;i++){
pra.push_back(pra[i]);
}
int max=0;
int pos;
for(int i=0;i<n;i++){
int all=n;
int a=i;
pos=pra[a];
int sum=0;
for(int j=0;j<n;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]<=pra[a+2]){
a = a+2;
int tmp = all;
for(int j=0;j<all;j++,a++){
sum+=pra[a];
all--;
if(sum>max){
max = sum;
}
if(all<1){
break;
}
if(pra[a]>pra[a+1]){
break;
}
}
}
if(sum>max){
max = sum;
}
}
cout<<max;
} |
# 2016002, 2024-09-28 11:02:59, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
int c=0, cu=0;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i]) break;
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
} | # 2016006, 2024-09-28 11:03:20, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
int c=0, cu=0;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i]) break;
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
//cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
} | # 2016099, 2024-09-28 11:13:03, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
int c=0, cu=0;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
} | # 2016102, 2024-09-28 11:13:23, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
int c=0, cu=0;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
} | # 2016156, 2024-09-28 11:18:53, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
if(n>2){
int c=0, cu=0;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
}else if(n=2){
cout << l[0] + l[1];
}else if(n=1){
cout << l[0];
}else{
cout << "0";
}
} | # 2016162, 2024-09-28 11:19:21, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
if(n>2){
int c=0, cu=0;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
}else if(n=2){
cout << l[0] + l[1];
}else if(n=1){
cout << l[0];
}else{
cout << "0";
}
} | # 2016174, 2024-09-28 11:20:25, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
if(n>2){
int c=0, cu=0;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
}else if(n==2){
cout << l[0] + l[1];
}else if(n==1){
cout << l[0];
}else{
cout << "0";
}
} | # 2016223, 2024-09-28 11:25:04, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
if(n>2){
int c=0, cu=0;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
}else if(n==2){
cout << l[0] + l[1];
}else if(n==1){
cout << l[0];
}else{
cout << "0";
}
} | # 2016228, 2024-09-28 11:25:25, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
if(n>2){
int c=0, cu=0;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
}else if(n==2){
cout << l[0] + l[1];
}else if(n==1){
cout << l[0];
}else{
cout << "0";
}
} | # 2016303, 2024-09-28 11:32:37, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n];
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
//if(n>2){
int c=0, cu=0;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = 0;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
//}else if(n==2){
// cout << l[0] + l[1];
//}else if(n==1){
// cout << l[0];
//}else{
// cout << "0";
//}
} | # 2016352, 2024-09-28 11:36:02, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << "-1";
} | # 2016354, 2024-09-28 11:36:11, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << "-2";
} | # 2016357, 2024-09-28 11:36:21, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << "-3";
} | # 2016358, 2024-09-28 11:36:30, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << "-4";
} | # 2016360, 2024-09-28 11:36:40, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << "-10";
} | # 2016363, 2024-09-28 11:36:50, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << "-9";
} | # 2016366, 2024-09-28 11:36:58, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << "-8";
} | # 2016405, 2024-09-28 11:40:12, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n], cu;
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
cu = min(cu,l[i]);
}
//if(n>2){
int c=0, cuu=cu;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = cuu;
c = 0;
}
int result=0;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
//}else if(n==2){
// cout << l[0] + l[1];
//}else if(n==1){
// cout << l[0];
//}else{
// cout << "0";
//}
} | # 2016423, 2024-09-28 11:41:23, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
int l[n], re[n], cu;
for(int i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
cu = min(cu,l[i]);
}
//if(n>2){
int c=0, cuu=cu;
bool jump = true;
for(int j=0;j<n;j++){
int i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = cuu;
c = 0;
}
int result=cuu;
for(int i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
//}else if(n==2){
// cout << l[0] + l[1];
//}else if(n==1){
// cout << l[0];
//}else{
// cout << "0";
//}
} | # 2016473, 2024-09-28 11:43:58, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
long long main(){
long long n;
cin >> n;
cin.ignore();
long long l[n], re[n];
for(long long i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
//if(n>2){
long long c=0, cu=0;
bool jump = true;
for(long long j=0;j<n;j++){
long long i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = 0;
c = 0;
}
long long result=0;
for(long long i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
//}else if(n==2){
// cout << l[0] + l[1];
//}else if(n==1){
// cout << l[0];
//}else{
// cout << "0";
//}
} | # 2016480, 2024-09-28 11:44:23, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
cin.ignore();
long long l[n], re[n];
for(long long i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
//if(n>2){
long long c=0, cu=0;
bool jump = true;
for(long long j=0;j<n;j++){
long long i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = 0;
c = 0;
}
long long result=0;
for(long long i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
//}else if(n==2){
// cout << l[0] + l[1];
//}else if(n==1){
// cout << l[0];
//}else{
// cout << "0";
//}
} | # 2016783, 2024-09-28 11:59:18, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
cin.ignore();
long long l[n], re[n];
for(long long i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
//if(n>2){
long long c=0, cu=0;
bool jump = true;
for(long long j=0;j<n;j++){
long long i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
cout << re[j] << endl;
cu = 0;
c = 0;
}
long long result=0;
for(long long i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
//}else if(n==2){
// cout << l[0] + l[1];
//}else if(n==1){
// cout << l[0];
//}else{
// cout << "0";
//}
} | # 2016797, 2024-09-28 11:59:40, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
cin.ignore();
long long l[n], re[n];
for(long long i=0;i<n;i++){
cin >> l[i];
re[i] = 0;
}
//if(n>2){
long long c=0, cu=0;
bool jump = true;
for(long long j=0;j<n;j++){
long long i=j;
while(i<n){
if(cu > l[i] && jump == true){
i++;
if(i == n) i=0;
jump = false;
c++;
if(c == n) break;
continue;
}
if(cu > l[i] && jump == false){
break;
}
re[j] += l[i];
cu = l[i];
c++;
if(c == n) break;
i++;
if(i == n) i=0;
}
jump = true;
//cout << re[j] << endl;
cu = 0;
c = 0;
}
long long result=0;
for(long long i=0;i<n;i++){
if(re[i]>result){
result = re[i];
}
}
cout << result;
//}else if(n==2){
// cout << l[0] + l[1];
//}else if(n==1){
// cout << l[0];
//}else{
// cout << "0";
//}
} |
# 2015809, 2024-09-28 10:44:57, P------P------------ (10%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n){
return 0;
}
int cnt=po[0];
for(int i=0;i<n;i++){
if(po[i]<po[i+1]){
cnt+=po[i+1];
}
else{
break;
}
}
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n],mm=0;
for(int i=0;i<n;i++){
cin>>p[i];
}
mm = max(mm,power(0,p,0));
cout<<mm;
} | # 2015895, 2024-09-28 10:54:43, -------------------- (0%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*2){
return 0;
}
int cnt=po[0];
for(int i=0;i<n;i++){
if(po[i]<po[i+1]&&po[i]<=po[i+1]){
cnt+=po[i+1];
cout<<cnt<<" "<<start<<" "<<po[1]<<endl;
}
else{
break;
}
}
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n],mm=0;
for(int i=0;i<n;i++){
cin>>p[i];
}
mm = max(mm,power(0,p,0));
cout<<mm;
} | # 2015898, 2024-09-28 10:55:02, P------P------------ (10%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*2){
return 0;
}
int cnt=po[0];
for(int i=0;i<n;i++){
if(po[i]<po[i+1]&&po[i]<=po[i+1]){
cnt+=po[i+1];
//cout<<cnt<<" "<<start<<" "<<po[1]<<endl;
}
else{
break;
}
}
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n],mm=0;
for(int i=0;i<n;i++){
cin>>p[i];
}
mm = max(mm,power(0,p,0));
cout<<mm;
} | # 2015988, 2024-09-28 11:01:45, -------------------- (0%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*2){
cout<<maX;
return 0;
}
int cnt=po[0];
for(int i=0;i<n;i++){
if(po[i]<po[i+1]&&po[i]<=po[i+1]){
cnt+=po[i+1];
}
else{
break;
}
}
cout<<maX<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n],mm=0;
for(int i=0;i<n;i++){
cin>>p[i];
}
int ck=power(0,p,0);
} | # 2015997, 2024-09-28 11:02:34, P--P---P------------ (15%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*2){
cout<<maX;
return 0;
}
int cnt=po[0];
for(int i=0;i<n;i++){
if(po[i]<po[i+1]&&po[i]<=po[i+1]){
cnt+=po[i+1];
}
else{
break;
}
}
//cout<<maX<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n],mm=0;
for(int i=0;i<n;i++){
cin>>p[i];
}
int ck=power(0,p,0);
} | # 2016069, 2024-09-28 11:10:11, P--P---P------------ (15%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start,int skip){
if(start==n*4){
cout<<maX;
return 0;
}
int cnt=po[0];
bool sck = 1;
for(int i=0;i<n;i++){
if(skip>0&&i==skip&&sck){
sck = 0;
cnt+=po[i+2];
i++;
continue;
}
if(po[i]<po[i+1]&&po[i]<=po[i+1]){
cnt+=po[i+1];
}
else{
break;
}
}
//cout<<maX<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
if(start>n*2)
skip++;
power(maX,po,start,skip);
return maX;
}
int main(){
cin>>n;
int p[n],mm=0;
for(int i=0;i<n;i++){
cin>>p[i];
}
int ck=power(0,p,0,0);
} | # 2016433, 2024-09-28 11:41:49, P--P---P------------ (15%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start,int skip){
if(start==n*4){
cout<<maX;
return 0;
}
int cnt=po[0];
bool sck = 1;
for(int i=0;i<n;i++){
if(skip>0&&po[i]>po[i+1]&&sck){
if(po[i]<po[i+2]&&po[i]<=po[i+1]){
cnt+=po[i+1];
sck = 0;
i+=2;
continue;
}
}
if(po[i]<po[i+1]&&po[i]<=po[i+1]){
cnt+=po[i+1];
}
else{
break;
}
}
//cout<<maX<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
if(start>n*2)
skip++;
power(maX,po,start,skip);
return maX;
}
int main(){
cin>>n;
int p[n],mm=0;
for(int i=0;i<n;i++){
cin>>p[i];
}
int ck=power(0,p,0,0);
} | # 2016544, 2024-09-28 11:49:11, PPPP-PPPP----PP-P-P- (60%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*4){
cout<<maX;
return 0;
}
int cnt=po[0];
bool sck = 1;
for(int i=0;i<n;i++){
if(po[i]>po[i+1]&&sck==1){
if(po[i]<=po[i+2]){
cnt+=po[i+2];
sck = 0;
i+=2;
}
}
if(po[i]<=po[i+1]){
cnt+=po[i+1];
}
else{
break;
}
}
//cout<<maX<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n],mm=0;
for(int i=0;i<n;i++){
cin>>p[i];
}
int ck=power(0,p,0);
} | # 2016592, 2024-09-28 11:51:40, PPPP-PPPP----PP-P-P- (60%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*3){
cout<<maX;
return 0;
}
int cnt=po[0];
bool sck = 1;
for(int i=0;i<n;i++){
if(po[i]>po[i+1]&&sck==1){
if(po[i]<=po[i+2]){
cnt+=po[i+2];
sck = 0;
i+=2;
}
}
if(po[i]<=po[i+1]){
cnt+=po[i+1];
}
else{
break;
}
}
//cout<<maX<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n];
for(int i=0;i<n;i++){
cin>>p[i];
}
int ck=power(0,p,0);
} | # 2016609, 2024-09-28 11:52:31, PPPP-PPPP----PP-P-P- (60%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*3){
cout<<maX;
return 0;
}
int cnt=po[0];
bool sck = 1;
for(int i=0;i<n;i++){
if(po[i]>po[i+1]&&sck==1&&i+2<n){
if(po[i]<=po[i+2]){
cnt+=po[i+2];
sck = 0;
i+=2;
}
}
if(po[i]<=po[i+1]){
cnt+=po[i+1];
}
else{
break;
}
}
//cout<<maX<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n];
for(int i=0;i<n;i++){
cin>>p[i];
}
int ck=power(0,p,0);
} | # 2016725, 2024-09-28 11:57:46, PPPPPPPPP----PP-PPP- (70%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*3){
cout<<maX;
return 0;
}
int cnt=po[0];
bool sck = 1;
for(int i=0;i<n;i++){
if(po[i]>po[i+1]&&sck==1&&i+2<n){
if(po[i]<=po[i+2]){
cnt+=po[i+2];
sck = 0;
i+=2;
//cout<<cnt<<" "<<start<<endl;
}
}
if(po[i]<=po[i+1]&&i+1<n){
cnt+=po[i+1];
//cout<<cnt<<" "<<start<<endl;
}
else{
break;
}
}
//cout<<cnt<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n];
for(int i=0;i<n;i++){
cin>>p[i];
}
power(0,p,0);
} | # 2016811, 2024-09-28 12:00:00, PPPPPPPPP----PP-PPP- (70%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int power(int maX,int po[],int start){
if(start==n*4){
cout<<maX;
return 0;
}
int cnt=po[0];
bool sck = 1;
for(int i=0;i<n;i++){
if(po[i]>po[i+1]&&sck==1&&i+2<n){
if(po[i]<=po[i+2]){
cnt+=po[i+2];
sck = 0;
i+=2;
//cout<<cnt<<" "<<start<<endl;
}
}
if(po[i]<=po[i+1]&&i+1<n){
cnt+=po[i+1];
//cout<<cnt<<" "<<start<<endl;
}
else{
break;
}
}
//cout<<cnt<<" "<<start<<endl;
maX =max(maX,cnt);
int a,b;
for(int i=0;i<n;i++){
if(i==0){
a = po[i];
po[i] = po[n-1];
continue;
}
b = po[i];
po[i] = a;
a = b;
}
start++;
power(maX,po,start);
return maX;
}
int main(){
cin>>n;
int p[n];
for(int i=0;i<n;i++){
cin>>p[i];
}
power(0,p,0);
} |
# 2017985, 2024-09-28 14:22:50, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
#define ll long double
int main(){
ios_base::sync_with_stdio(false);
int m, max_val = 0, cur_sum;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, del, prev;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = 0;
j = (i + 1) % m;
while(j != i && (bead[j] >= prev || del < 1) ){
if(bead[j] < prev) del = 1;
else {
cur_sum += bead[j];
prev = bead[j];
}
j = (j + 1) % m;
}
max_val = max(max_val, cur_sum);
}
cout << max_val;
return 0;
} | # 2018130, 2024-09-28 14:36:39, P--P---P--------P--- (20%)
#include <bits/stdc++.h>
using namespace std;
#define ll long double
int main(){
ios_base::sync_with_stdio(false);
int m, max_val = 0, cur_sum;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, del, prev;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = 0;
j = (i + 1) % m;
while(j != i && (bead[j] >= prev || del < 1) ){
if(bead[j] <= prev) del = 1;
else {
cur_sum += bead[j];
prev = bead[j];
}
j = (j + 1) % m;
}
max_val = max(max_val, cur_sum);
}
cout << max_val;
return 0;
} | # 2018133, 2024-09-28 14:36:50, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
#define ll long double
int main(){
ios_base::sync_with_stdio(false);
int m, max_val = 0, cur_sum;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, del, prev;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = 0;
j = (i + 1) % m;
while(j != i && (bead[j] >= prev || del < 1) ){
if(bead[j] < prev) del = 1;
else {
cur_sum += bead[j];
prev = bead[j];
}
j = (j + 1) % m;
}
max_val = max(max_val, cur_sum);
}
cout << max_val;
return 0;
} | # 2018160, 2024-09-28 14:39:30, TTTTTTTTTTTTTTTTTTTT (0%)
#include <bits/stdc++.h>
using namespace std;
#define ll long double
int main(){
ios_base::sync_with_stdio(false);
int m, max_val = 0, cur_sum;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, del, prev;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = 0;
j = (i + 1) % m;
while(j != i && (bead[j] >= prev || del < 1) ){
if(bead[j] < prev) del = 1;
else {
cur_sum += bead[j];
prev = bead[j];
}
j =+ 1;
j %= m;
}
max_val = max(max_val, cur_sum);
}
cout << max_val;
return 0;
} | # 2018170, 2024-09-28 14:40:26, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
#define ll long double
int main(){
ios_base::sync_with_stdio(false);
int m, max_val = 0, cur_sum;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, del, prev;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = 0;
j = (i + 1) % m;
while(j != i && (bead[j] >= prev || del < 1) ){
if(bead[j] < prev) del = 1;
else {
cur_sum += bead[j];
prev = bead[j];
}
j++;
j = (j % m);
}
max_val = max(max_val, cur_sum);
}
cout << max_val;
return 0;
} | # 2018292, 2024-09-28 14:50:30, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ios_base::sync_with_stdio(false);
ll m, max_val = 0, cur_sum;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, del, prev;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = 0;
j = (i + 1) % m;
while(j != i && (prev <= bead[j] || del < 1) ){
if(bead[j] < prev) del = 1;
else {
cur_sum += bead[j];
prev = bead[j];
}
j++;
j = (j % m);
}
max_val = max(max_val, cur_sum);
}
cout << max_val;
return 0;
} | # 2018366, 2024-09-28 14:56:03, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll m, max_val = 0, cur_sum = 0;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, del, prev;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = 0;
j = (i + 1) % m;
while(j != i && (prev <= bead[j] || del < 1) ){
if(bead[j] < prev) del = 1;
else {
cur_sum += bead[j];
prev = bead[j];
}
j++;
j = (j % m);
}
max_val = max(max_val, cur_sum);
}
cout << max_val;
return 0;
} | # 2018792, 2024-09-28 15:18:57, P-TPTTTP--T--TTTT-TP (20%)
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
void Bcount(int s_index, int curr_index, int prev, int size, bool del, int cur_sum, int &max_val, const vector<int> &bead){
if((bead[curr_index] < prev && del) || (s_index == curr_index)){
max_val = max(max_val, cur_sum);
return;
}
//use delete
if(!del) Bcount(s_index, (curr_index + 1) % size, prev, size, true, cur_sum, max_val, bead);
//not use delete
if(bead[curr_index] > prev) Bcount(s_index, (curr_index + 1) % size, bead[curr_index], size, false, cur_sum + bead[curr_index], max_val, bead);
return;
}
int main(){
int m, max_val = 0, cur_sum = 0;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, prev;
bool del;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = false;
j = (i + 1) % m;
Bcount(i, j, prev, m, false, cur_sum, max_val, bead);
}
cout << max_val;
return 0;
} | # 2018804, 2024-09-28 15:19:10, PPTTTTTPTTT-TTTTTTTP (20%)
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
void Bcount(int s_index, int curr_index, int prev, int size, bool del, int cur_sum, int &max_val, const vector<int> &bead){
if((bead[curr_index] < prev && del) || (s_index == curr_index)){
max_val = max(max_val, cur_sum);
return;
}
//use delete
if(!del) Bcount(s_index, (curr_index + 1) % size, prev, size, true, cur_sum, max_val, bead);
//not use delete
if(bead[curr_index] >= prev) Bcount(s_index, (curr_index + 1) % size, bead[curr_index], size, false, cur_sum + bead[curr_index], max_val, bead);
return;
}
int main(){
int m, max_val = 0, cur_sum = 0;
cin >> m;
vector<int> bead(m);
vector<bool> visited(m, false);
for(int i = 0; i < m; i++) cin >> bead[i];
int j, prev;
bool del;
for(int i = 0; i < m; i++){
cur_sum = prev = bead[i];
del = false;
j = (i + 1) % m;
Bcount(i, j, prev, m, false, cur_sum, max_val, bead);
}
cout << max_val;
return 0;
} |
# 2018096, 2024-09-28 14:33:13, --------P----PP-P-P- (25%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
int n, m, k = 0;
int sum = 0, max = 0;
cin >> n;
int a[n];
bool t = true;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n ; i++)
{
//cout << i << endl << endl;
for(int j = i; j < n + i; j++)
{
//if(j == i && i == 3)cout << a[(j%n) -k];
if(a[((j - k) % n)] <= a[((j+1) % n)])
{
sum = sum + a[((j-k) % n)];
k = 0;
}
else if(t)
{
//if(i == 3)cout << a[j % n];
t = false;
k = 1;
}
else
{
sum = sum + a[j % n];
//if(i == 3)cout << a[j % n];
break;
}
}
k = 0;
if(sum >= max)
{
max = sum;
m = i;
}
sum = 0;
t = true;
}
cout << max << endl;
return 0;
} | # 2018114, 2024-09-28 14:34:59, --------P----PP-P-P- (25%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
int n, m, k = 0;
long long sum = 0, max = 0;
cin >> n;
long long a[n];
bool t = true;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n ; i++)
{
//cout << i << endl << endl;
for(int j = i; j < n + i; j++)
{
//if(j == i && i == 3)cout << a[(j%n) -k];
if(a[((j - k) % n)] <= a[((j+1) % n)])
{
sum = sum + a[((j-k) % n)];
k = 0;
}
else if(t)
{
//if(i == 3)cout << a[j % n];
t = false;
k = 1;
}
else
{
sum = sum + a[j % n];
//if(i == 3)cout << a[j % n];
break;
}
}
k = 0;
if(sum >= max)
{
max = sum;
m = i;
}
sum = 0;
t = true;
}
cout << max << endl;
return 0;
} | # 2018213, 2024-09-28 14:43:24, PPPPPPPPP----PP-PPP- (70%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
int n, m, k = 0;
long long sum = 0, max = 0, Nsum = 0, Nmax = 0;
cin >> n;
long long a[n];
bool t = true;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n ; i++)
{
//cout << i << endl << endl;
for(int j = i; j < n + i; j++)
{
//if(j == i)cout << a[(j%n) -k];
if(a[((j - k) % n)] <= a[((j+1) % n)])
{
sum = sum + a[((j-k) % n)];
k = 0;
}
else if(t)
{
//if(i == 3)cout << a[j % n];
t = false;
k = 1;
}
else
{
sum = sum + a[(j - k) % n];
//if(i == 3)cout << a[j % n];
break;
}
}
for(int j = i; j < n + i; j++)
{
//if(j == i)cout << a[(j%n) -k];
if(a[((j) % n)] <= a[((j+1) % n)])
{
Nsum = Nsum + a[((j) % n)];
k = 0;
}
else
{
Nsum = Nsum + a[(j) % n];
//if(i == 3)cout << a[j % n];
break;
}
}
k = 0;
if(sum >= max)
{
max = sum;
m = i;
}
if(Nmax <= Nsum)
{
Nmax = Nsum;
}
sum = 0;
Nsum = 0;
t = true;
}
if(max > Nmax)cout << max << endl;
if(max <= Nmax)cout << Nmax << endl;
return 0;
} | # 2018314, 2024-09-28 14:52:33, PPPPPPPPP----PP-P-P- (65%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
int n, m, k = 0;
long long sum = 0, max = 0, Nsum = 0, Nmax = 0;
cin >> n;
long long a[n];
bool t = true;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n ; i++)
{
//cout << i << endl << endl;
for(int j = i; j <= n + i; j++)
{
//if(j == i)cout << a[(j%n) -k];
if(a[((j - k) % n)] <= a[((j+1) % n)])
{
sum = sum + a[((j-k) % n)];
k = 0;
}
else if(t)
{
//if(i == 3)cout << a[j % n];
t = false;
k = 1;
}
else
{
sum = sum + a[(j - k) % n];
//if(i == 3)cout << a[j % n];
break;
}
}
for(int j = i; j <= n + i; j++)
{
//if(j == i)cout << a[(j%n) -k];
if(a[((j) % n)] <= a[((j+1) % n)])
{
Nsum = Nsum + a[((j) % n)];
k = 0;
}
else
{
Nsum = Nsum + a[(j) % n];
//if(i == 3)cout << a[j % n];
break;
}
}
k = 0;
if(sum >= max)
{
max = sum;
m = i;
}
if(Nmax <= Nsum)
{
Nmax = Nsum;
}
sum = 0;
Nsum = 0;
t = true;
}
if(max > Nmax)cout << max << endl;
if(max <= Nmax)cout << Nmax << endl;
return 0;
} | # 2018321, 2024-09-28 14:53:05, PPPPPPPPP----PP-PPP- (70%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
int n, m, k = 0;
long long sum = 0, max = 0, Nsum = 0, Nmax = 0;
cin >> n;
long long a[n];
bool t = true;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n ; i++)
{
//cout << i << endl << endl;
for(int j = i; j < n + i; j++)
{
//if(j == i)cout << a[(j%n) -k];
if(a[((j - k) % n)] <= a[((j+1) % n)])
{
sum = sum + a[((j-k) % n)];
k = 0;
}
else if(t)
{
//if(i == 3)cout << a[j % n];
t = false;
k = 1;
}
else
{
sum = sum + a[(j - k) % n];
//if(i == 3)cout << a[j % n];
break;
}
}
for(int j = i; j < n + i; j++)
{
//if(j == i)cout << a[(j%n) -k];
if(a[((j) % n)] <= a[((j+1) % n)])
{
Nsum = Nsum + a[((j) % n)];
k = 0;
}
else
{
Nsum = Nsum + a[(j) % n];
//if(i == 3)cout << a[j % n];
break;
}
}
k = 0;
if(sum >= max)
{
max = sum;
m = i;
}
if(Nmax <= Nsum)
{
Nmax = Nsum;
}
sum = 0;
Nsum = 0;
t = true;
}
if(max > Nmax)cout << max << endl;
if(max <= Nmax)cout << Nmax << endl;
return 0;
} | # 2018387, 2024-09-28 14:57:15, PPPPPPPPP----PP-PPP- (70%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
int n, m, k = 0;
long long sum = 0, max = 0, Nsum = 0, Nmax = 0;
cin >> n;
long long a[n];
bool t = true;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n ; i++)
{
for(int j = i; j < n + i; j++)
{
if(a[((j - k) % n)] <= a[((j+1) % n)])
{
sum = sum + a[((j-k) % n)];
k = 0;
}
else if(t)
{
t = false;
k = 1;
}
else
{
sum = sum + a[(j - k) % n];
break;
}
}
for(int j = i; j < n + i; j++)
{
if(a[((j) % n)] <= a[((j+1) % n)])
{
Nsum = Nsum + a[((j) % n)];
}
else
{
Nsum = Nsum + a[(j) % n];
break;
}
}
k = 0;
if(sum >= max)
{
max = sum;
m = i;
}
if(Nmax <= Nsum)
{
Nmax = Nsum;
}
sum = 0;
Nsum = 0;
t = true;
}
if(max > Nmax)cout << max << endl;
if(max <= Nmax)cout << Nmax << endl;
return 0;
} | # 2018504, 2024-09-28 15:05:49, PPPPPPPPP----PP-PPP- (70%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
int n, k = 0;
long long sum = 0, max = 0, Nsum = 0, Nmax = 0;
cin >> n;
long long a[n];
bool t = true;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n ; i++)
{
for(int j = i; j < n + i; j++)
{
if(a[((j - k) % n)] <= a[((j+1) % n)])
{
sum = sum + a[((j-k) % n)];
k = 0;
}
else if(t)
{
t = false;
k = 1;
}
else
{
sum = sum + a[(j - k) % n];
break;
}
}
for(int j = i; j < n + i; j++)
{
if(a[((j) % n)] <= a[((j+1) % n)])
{
Nsum = Nsum + a[((j) % n)];
}
else
{
Nsum = Nsum + a[(j) % n];
break;
}
}
k = 0;
if(sum >= max)
{
max = sum;
}
if(Nmax <= Nsum)
{
Nmax = Nsum;
}
sum = 0;
Nsum = 0;
t = true;
}
if(max > Nmax)cout << max << endl;
if(max <= Nmax)cout << Nmax << endl;
return 0;
} | # 2018585, 2024-09-28 15:10:47, PPPPPPPPP----PP-PPP- (70%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
int main()
{
int n, k = 0;
long long sum = 0, max = 0, Nsum = 0, Nmax = 0;
cin >> n;
long long a[500];
bool t = true;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n ; i++)
{
for(int j = i; j < n + i; j++)
{
if(a[((j - k) % n)] <= a[((j+1) % n)])
{
sum = sum + a[((j-k) % n)];
k = 0;
}
else if(t)
{
t = false;
k = 1;
}
else
{
sum = sum + a[(j - k) % n];
break;
}
}
for(int j = i; j < n + i; j++)
{
if(a[((j) % n)] <= a[((j+1) % n)])
{
Nsum = Nsum + a[((j) % n)];
}
else
{
Nsum = Nsum + a[(j) % n];
break;
}
}
k = 0;
if(sum >= max)
{
max = sum;
}
if(Nmax <= Nsum)
{
Nmax = Nsum;
}
sum = 0;
Nsum = 0;
t = true;
}
if(max > Nmax)cout << max << endl;
if(max <= Nmax)cout << Nmax << endl;
return 0;
} |
# 2015844, 2024-09-28 10:48:48, ----P---P-----P-PPP- (30%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ; cin >> n;
int arr[1000];
for (int i = 0 ; i < n ; i++){
cin >> arr[i] ;
arr[n+i] = arr[i];
}
double mx = 0 ;
for (int i = 0 ; i < n ; i++) {
double sum = arr[i];
bool check = true;
for (int j = i + 1; j < n + i ; j++){
sum += arr[j];
if (arr[j] < arr[j - 1]){
sum -= arr[j];
mx = max(mx,sum);
if (check) check = false;
else break;
}
}
if (check) mx = max(mx,sum);
}
cout << mx << endl;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2015870, 2024-09-28 10:52:25, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ; cin >> n;
int arr[1000];
for (int i = 0 ; i < n ; i++){
cin >> arr[i] ;
arr[n+i] = arr[i];
}
double mx = 0 ;
for (int i = 0 ; i < n ; i++) {
double sum = arr[i];
bool check = true;
double before = arr[i];
for (int j = i + 1; j < n + i ; j++){
sum += arr[j];
if (arr[j] < before){
sum -= arr[j];
mx = max(mx,sum);
if (check) {
check = false ;
before = arr[j - 1];
}
else break;
} else before = arr[j];
}
if (check) mx = max(mx,sum);
}
cout << mx << endl;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2015879, 2024-09-28 10:53:01, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ; cin >> n;
int arr[1000];
for (int i = 0 ; i < n ; i++){
cin >> arr[i] ;
arr[n+i] = arr[i];
}
double mx = 0 ;
for (int i = 0 ; i < n ; i++) {
double sum = arr[i];
bool check = true;
double before = arr[i];
for (int j = i + 1; j < n + i + 1; j++){
sum += arr[j];
if (arr[j] < before){
sum -= arr[j];
mx = max(mx,sum);
if (check) {
check = false ;
before = arr[j - 1];
}
else break;
} else before = arr[j];
}
if (check) mx = max(mx,sum);
}
cout << mx << endl;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2016402, 2024-09-28 11:40:00, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ; cin >> n;
int arr[1000];
for (int i = 0 ; i < n ; i++){
cin >> arr[i] ;
arr[n+i] = arr[i];
}
double mx = 0 ;
for (int i = 0 ; i < n ; i++) {
double sum = arr[i];
bool check = true;
double before = arr[i];
for (int j = i + 1; j < n + i + 1; j++){
sum += arr[j];
if (arr[j] < before){
sum -= arr[j];
mx = max(mx,sum);
if (check) {
check = false ;
before = arr[j - 1];
}
else break;
} else before = arr[j];
}
if (check) mx = max(mx,sum);
}
cout << mx << endl;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2016546, 2024-09-28 11:49:18, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ; cin >> n;
int arr[n*2];
for (int i = 0 ; i < n ; i++){
cin >> arr[i] ;
arr[n+i] = arr[i];
}
double mx = 0 ;
for (int i = 0 ; i < n ; i++) {
double sum = arr[i];
bool check = true;
double before = arr[i];
for (int j = i + 1; j < n + i + 1; j++){
sum += arr[j];
if (arr[j] < before){
sum -= arr[j];
mx = max(mx,sum);
if (check) {
check = false ;
before = arr[j - 1];
}
else break;
} else before = arr[j];
}
if (check) mx = max(mx,sum);
}
cout << mx << endl;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2016606, 2024-09-28 11:52:26, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ; cin >> n;
int arr[n*2];
for (int i = 0 ; i < n ; i++){
cin >> arr[i] ;
arr[n+i] = arr[i];
}
if (n == 1) {
cout << arr[0];
return 0;
}
double mx = 0 ;
for (int i = 0 ; i < n ; i++) {
double sum = arr[i];
bool check = true;
double before = arr[i];
for (int j = i + 1; j < n + i + 1; j++){
sum += arr[j];
if (arr[j] < before){
sum -= arr[j];
mx = max(mx,sum);
if (check) {
check = false ;
before = arr[j - 1];
}
else break;
} else before = arr[j];
}
if (check) mx = max(mx,sum);
}
cout << mx << endl;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2016715, 2024-09-28 11:57:25, PPPPPPPPP----PP-P-P- (65%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ; cin >> n;
int arr[n*2];
for (int i = 0 ; i < n ; i++){
cin >> arr[i] ;
arr[n+i] = arr[i];
}
if (n == 1) {
cout << arr[0];
return 0;
}
double mx = 0 ;
for (int i = 0 ; i < n ; i++) {
double sum = arr[i];
bool check = true;
double before = arr[i];
for (int j = i + 1; j < n + i + 1; j++){
sum += arr[j];
if (arr[j] < before){
sum -= arr[j];
if (check) {
check = false ;
before = arr[j - 1];
}
else break;
} else before = arr[j];
mx = max(mx,sum);
}
if (check) mx = max(mx,sum);
}
cout << mx << endl;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2016721, 2024-09-28 11:57:39, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ; cin >> n;
int arr[1500];
for (int i = 0 ; i < n ; i++){
cin >> arr[i] ;
arr[n+i] = arr[i];
}
if (n == 1) {
cout << arr[0];
return 0;
}
double mx = 0 ;
for (int i = 0 ; i < n ; i++) {
double sum = arr[i];
bool check = true;
double before = arr[i];
for (int j = i + 1; j < n + i + 1; j++){
sum += arr[j];
if (arr[j] < before){
sum -= arr[j];
mx = max(mx,sum);
if (check) {
check = false ;
before = arr[j - 1];
}
else break;
} else before = arr[j];
}
if (check) mx = max(mx,sum);
}
cout << mx << endl;
}
/*
7
6 7 5 9 5 8 3
*/ |
# 2016064, 2024-09-28 11:09:38, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=-1;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=0;i<n;i++)
{
bool skp=0;int sum=0,tmp=-1;
for(int j=i;j<n+i;j++)
{
if(arr[j%n] < tmp)
{
if(!skp)skp=1;
else break;
}
else
{
sum += arr[j%n];
tmp=arr[j%n];
}
}
// cout << arr[j%n] << " ";
// }cout << "\n";
mx = max(sum,mx);
}
cout << mx;
} | # 2016092, 2024-09-28 11:12:39, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=0;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=0;i<n;i++)
{
bool skp=0;int sum=0,tmp=-1;
for(int j=i;j<n+i;j++)
{
if(arr[j%n] < tmp)
{
if(!skp)skp=1;
else break;
}
else
{
sum += arr[j%n];
tmp=arr[j%n];
}
}
// cout << arr[j%n] << " ";
// }cout << "\n";
mx = max(sum,mx);
}
cout << mx;
} | # 2016574, 2024-09-28 11:50:36, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=0;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=0;i<n;i++)
{
bool skp=0;int sum=0,tmp=-1;
for(int j=i;j<n+i;j++)
{
if(arr[j%n] < tmp)
{
if(!skp)skp=1;
else break;
}
sum += arr[j%n];
tmp=arr[j%n];
}
// cout << arr[j%n] << " ";
// cout << "\n";
mx = max(sum,mx);
}
cout << mx;
} | # 2016577, 2024-09-28 11:50:50, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=0;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=0;i<n;i++)
{
bool skp=0;int sum=0,tmp=-1;
for(int j=i;j<n+i;j++)
{
if(arr[j%n] < tmp)
{
if(!skp)skp=1;
else break;
}
else
{
sum += arr[j%n];
tmp=arr[j%n];
}
}
// cout << arr[j%n] << " ";
// cout << "\n";
mx = max(sum,mx);
}
cout << mx;
} | # 2016600, 2024-09-28 11:52:04, -P-----P------------ (10%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=0;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=0;i<n;i++)
{
bool skp=0;int sum=0,tmp;
for(int j=i;j<n+i;j++)
{
if(arr[j%n] < tmp)
{
if(!skp)skp=1;
else break;
}
else
{
sum += arr[j%n];
tmp=arr[j%n];
}
}
// cout << arr[j%n] << " ";
// cout << "\n";
mx = max(sum,mx);
}
cout << mx;
} | # 2016604, 2024-09-28 11:52:16, -P----P-P----------- (15%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=0;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=0;i<n;i++)
{
bool skp=0;int sum=0,tmp;
for(int j=i;j<n+i;j++)
{
if(arr[j%n] < tmp)
{
if(!skp)skp=1;
else break;
}
else
{
sum += arr[j%n];
tmp=arr[j%n];
}
}
// cout << arr[j%n] << " ";
// cout << "\n";
mx = max(sum,mx);
}
cout << mx;
} | # 2016610, 2024-09-28 11:52:32, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=0;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=0;i<n;i++)
{
bool skp=0;int sum=0,tmp=-1;
for(int j=i;j<n+i;j++)
{
if(arr[j%n] < tmp)
{
if(!skp)skp=1;
else break;
}
else
{
sum += arr[j%n];
tmp=arr[j%n];
}
}
// cout << arr[j%n] << " ";
// cout << "\n";
mx = max(sum,mx);
}
cout << mx;
} |
# 2017726, 2024-09-28 14:02:08, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main (){
int n , sum , ans = 0 , c , d;
cin >> n;
int a[n];
for(int i = 0 ; i < n ; i++)cin >> a[i];
for(int i = 0 ; i < n ; i++){
sum = 0;
sum += a[i];
c = a[i];
d = 0;
for(int j = 1 ; j < n - i ; j++){
if(c <= a[i+j]){
sum += a[i+j];
c = a[i+j];
}else d++;
if(d==2) break;
}
for(int k = 0 ; k < i ; k++){
if(c <= a[k]){
sum += a[k];
c = a[k];
}else d++;
if(d==2) break;
}
cout << sum << endl;
if(sum > ans)ans = sum;
}
cout << ans;
} | # 2017886, 2024-09-28 14:13:19, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main (){
int n , sum , ans = 0 , c , d;
cin >> n;
int a[n];
for(int i = 0 ; i < n ; i++)cin >> a[i];
for(int i = 0 ; i < n ; i++){
sum = 0;
sum += a[i];
c = a[i];
d = 0;
for(int j = 1 ; j < n - i ; j++){
if(c <= a[i+j]){
sum += a[i+j];
c = a[i+j];
}else d++;
if(d==2) break;
}
if(d != 2){
for(int k = 0 ; k < i ; k++){
if(c <= a[k]){
sum += a[k];
c = a[k];
}else d++;
if(d==2) break;
}
}
if(sum > ans)ans = sum;
}
cout << ans;
} | # 2018066, 2024-09-28 14:29:44, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main (){
int n , sum , ans = 0 , c , d;
cin >> n;
int a[n];
for(int i = 0 ; i < n ; i++)cin >> a[i];
for(int i = 0 ; i < n ; i++){
sum = 0;
sum += a[i];
c = a[i];
d = 0;
for(int j = 1 ; j < n - i ; j++){
if(c <= a[i+j]){
sum += a[i+j];
c = a[i+j];
}else d++;
if(d==2) break;
}
if(d != 2){
for(int k = 0 ; k < i ; k++){
if(c <= a[k]){
sum += a[k];
c = a[k];
}else d++;
if(d==2) break;
}
}
if(sum > ans)ans = sum;
}
cout << ans;
} | # 2018125, 2024-09-28 14:36:11, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main (){
int n , sum , ans = 0 , c , d;
cin >> n;
int a[n];
for(int i = 0 ; i < n ; i++)cin >> a[i];
for(int i = 0 ; i < n ; i++){
sum = 0;
sum += a[i];
c = a[i];
d = 0;
for(int j = 1 ; j < n - i ; j++){
if(c <= a[i+j]){
sum += a[i+j];
c = a[i+j];
}else d++;
if(d==2) break;
}
if(d != 2){
for(int k = 0 ; k < i ; k++){
if(c <= a[k]){
sum += a[k];
c = a[k];
}else d++;
if(d==2) break;
}
}
if(sum > ans)ans = sum;
}
cout << ans;
} | # 2018183, 2024-09-28 14:41:44, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main (){
long long n , sum , ans = 0 , c , d;
cin >> n;
long long a[n];
for(int i = 0 ; i < n ; i++)cin >> a[i];
for(int i = 0 ; i < n ; i++){
sum = 0;
sum += a[i];
c = a[i];
d = 0;
for(int j = 1 ; j < n - i ; j++){
if(c <= a[i+j]){
sum += a[i+j];
c = a[i+j];
}else d++;
if(d==2) break;
}
if(d != 2){
for(int k = 0 ; k < i ; k++){
if(c <= a[k]){
sum += a[k];
c = a[k];
}else d++;
if(d==2) break;
}
}
if(sum > ans)ans = sum;
}
cout << ans;
} | # 2018664, 2024-09-28 15:14:41, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main (){
long long n , sum = 0 , ans = 0 , c , d;
cin >> n;
long long a[n];
for(int i = 0 ; i < n ; i++)cin >> a[i];
for(int i = 0 ; i < n ; i++){
sum = 0;
sum += a[i];
c = a[i];
d = 0;
for(int j = 1 ; j < n - i ; j++){
if(c <= a[i+j]){
sum += a[i+j];
c = a[i+j];
}else d++;
if(d==2) break;
}
if(d != 2){
for(int k = 0 ; k < i ; k++){
if(c <= a[k]){
sum += a[k];
c = a[k];
}else d++;
if(d==2) break;
}
}
if(sum > ans)ans = sum;
}
cout << ans;
} |
# 2017577, 2024-09-28 13:44:18, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
bool ck;
int main()
{
int n,mx=INT_MIN;
cin >>n;
int pw[n+n];
for (int i = 0 ; i<n; i++)
{
cin>>pw[i];
pw[n+i] = pw[i];
}
for (int i = 0 ; i <n;i++){
int pp=0;
ck = false;
for(int j = 0;j<n;j++)
{
if (pw[i+j]<=pw[i+j+1])
{
pp +=pw[i+j];
// cout <<pw[i+j]<<" ";
}
else{
pp += pw[i+j];
// cout <<pw[i+j]<<" ";
if(ck ==false&&pw[i+j+2]>=pw[i+j]) j++,ck=1;
else break;
}
}
// cout <<endl;
mx = max(mx,pp);
}
cout <<mx;
} | # 2017632, 2024-09-28 13:52:02, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
bool ck;
int main()
{
int n,mx=INT_MIN;
cin >>n;
int pw[n+n];
for (int i = 0 ; i<n; i++)
{
cin>>pw[i];
pw[n+i] = pw[i];
}
for (int i = 0 ; i <n;i++){
int pp=0;
ck = false;
for(int j = 0;j<n;j++)
{
if (pw[i+j]<=pw[i+j+1])
{
pp +=pw[i+j];
// cout <<pw[i+j]<<" ";
}
else{
pp += pw[i+j];
// cout <<pw[i+j]<<" ";
if(ck ==false&&pw[i+j+2]>=pw[i+j]&&pw[i+j]>pw[i+j+1]) j++,ck=1;
else break;
}
}
// cout <<endl;
mx = max(mx,pp);
}
cout <<mx;
} | # 2017653, 2024-09-28 13:54:13, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
bool ck;
int main()
{
int n,mx=INT_MIN;
cin >>n;
int pw[n+n];
for (int i = 0 ; i<n; i++)
{
cin>>pw[i];
pw[n+i] = pw[i];
}
for (int i = 0 ; i <n;i++){
long long pp=0;
ck = false;
for(int j = 0;j<n;j++)
{
if (pw[i+j]<=pw[i+j+1])
{
pp +=pw[i+j];
// cout <<pw[i+j]<<" ";
}
else{
pp += pw[i+j];
// cout <<pw[i+j]<<" ";
if(ck ==false&&pw[i+j+2]>=pw[i+j]&&pw[i+j]>pw[i+j+1]) j++,ck=1;
else break;
}
}
// cout <<endl;
mx = max(mx,pp);
}
cout <<mx;
} | # 2017654, 2024-09-28 13:54:25, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
bool ck;
int main()
{
int n,mx=INT_MIN;
cin >>n;
int pw[n+n];
for (int i = 0 ; i<n; i++)
{
cin>>pw[i];
pw[n+i] = pw[i];
}
for (int i = 0 ; i <n;i++){
int pp=0;
ck = false;
for(int j = 0;j<n;j++)
{
if (pw[i+j]<=pw[i+j+1])
{
pp +=pw[i+j];
// cout <<pw[i+j]<<" ";
}
else{
pp += pw[i+j];
// cout <<pw[i+j]<<" ";
if(ck ==false&&pw[i+j+2]>=pw[i+j]&&pw[i+j]>pw[i+j+1]) j++,ck=1;
else break;
}
}
// cout <<endl;
mx = max(mx,pp);
}
cout <<mx;
} | # 2017973, 2024-09-28 14:21:51, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
bool ck;
int main()
{
int n,mx=INT_MIN;
cin >>n;
int pw[n+n];
for (int i = 0 ; i<n; i++)
{
cin>>pw[i];
pw[n+i] = pw[i];
}
for (int i = 0 ; i <n;i++){
long long pp=0;
ck = false;
for(int j = 0;j<n;j++)
{
if (pw[i+j]<=pw[i+j+1])
{
pp +=pw[i+j];
// cout <<pw[i+j]<<" ";
}
else{
pp += pw[i+j];
// cout <<pw[i+j]<<" ";
if(ck ==false&&pw[i+j+2]>=pw[i+j]&&pw[i+j]>pw[i+j+1]) j++,ck=1;
else break;
}
}
// cout <<endl;
mx = max(mx,pp);
}
cout <<mx;
} | # 2017974, 2024-09-28 14:22:02, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
bool ck;
int main()
{
int n,mx=INT_MIN;
cin >>n;
int pw[n+n];
for (int i = 0 ; i<n; i++)
{
cin>>pw[i];
pw[n+i] = pw[i];
}
for (int i = 0 ; i <n;i++){
int pp=0;
ck = false;
for(int j = 0;j<n;j++)
{
if (pw[i+j]<=pw[i+j+1])
{
pp +=pw[i+j];
// cout <<pw[i+j]<<" ";
}
else{
pp += pw[i+j];
// cout <<pw[i+j]<<" ";
if(ck ==false&&pw[i+j+2]>=pw[i+j]&&pw[i+j]>pw[i+j+1]) j++,ck=1;
else break;
}
}
// cout <<endl;
mx = max(mx,pp);
}
cout <<mx;
} |
# 2017729, 2024-09-28 14:02:20, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
using namespace std;
int main(){
int n,sum=0,point,now,most=0,c=0;
bool skip=1,nowdel=0;
cin >> n;
int i,prakum[n];
for(i=0;i<n;++i){
cin >> prakum[i];
}
for(i=0;i<n;++i){
skip=1;
nowdel=0;
c=0;
sum=0;
point=i;
if(i==n-1){
now=0;
}else{
now=i+1;
}
sum+=prakum[i];
while((prakum[now]>=prakum[point]||skip)&&c<n-1){
if(prakum[now]<prakum[point]){
nowdel=1;
skip=0;
now++;
if(now>=n){
now=0;
}
if(point>=n){
point=0;
}
c++;
}else{
sum+=prakum[now];
if(nowdel){
point++;
nowdel=0;
if(point>=n){
point=0;
}
}
now++;
point++;
if(now>=n){
now=0;
}
if(point>=n){
point=0;
}
c++;
}
}
if(sum>most){
most=sum;
}
}
cout << most;
return 0;
} | # 2018073, 2024-09-28 14:30:45, -------------------- (0%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
int i, prakum[n],newprakum[n-1];
for(i=0;i<n;++i){
cin >> prakum[i];
}
bool del=1;
int j,sum=0,point,now,c=0,most=0;
for(i=0;i<n;++i){
del=1;
for(j=0;j<n-1;++j){
if(j==i){
del=0;
}
if(del){
newprakum[j]=prakum[j];
}else{
newprakum[j]=prakum[j+1];
}
}
for(j=0;j<n-1;++j){
sum=0;
c=0;
point=j;
now=j+1;
sum+=newprakum[point];
if(now>=n-1){
now=0;
}
while(newprakum[now]>=newprakum[point]&&c<n-1){
sum+=newprakum[now];
c++;
point++;
now++;
if(now>=n-1){
now=0;
}
if(point>=n-1){
point=0;
}
}
}
if(sum>most){
most=sum;
}
}
cout << most;
} | # 2018078, 2024-09-28 14:31:17, -------------------- (0%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
int i, prakum[n],newprakum[n-1];
for(i=0;i<n;++i){
cin >> prakum[i];
}
bool del=1;
int j,sum=0,point,now,c=0,most=0;
for(i=0;i<n;++i){
del=1;
for(j=0;j<n-1;++j){
if(j==i){
del=0;
}
if(del){
newprakum[j]=prakum[j];
}else{
newprakum[j]=prakum[j+1];
}
}
for(j=0;j<n-1;++j){
sum=0;
c=0;
point=j;
now=j+1;
sum+=newprakum[point];
if(now>=n-1){
now=0;
}
while(newprakum[now]>=newprakum[point]&&c<n-1){
sum+=newprakum[now];
c++;
point++;
now++;
if(now>=n-1){
now=0;
}
if(point>=n-1){
point=0;
}
}
}
if(sum>most){
most=sum;
}
}
cout << most;
} | # 2018092, 2024-09-28 14:32:45, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
using namespace std;
int main(){
int n,sum=0,point,now,most=0,c=0;
bool skip=1,nowdel=0;
cin >> n;
int i,prakum[n];
for(i=0;i<n;++i){
cin >> prakum[i];
}
for(i=0;i<n;++i){
skip=1;
nowdel=0;
c=0;
sum=0;
point=i;
if(i==n-1){
now=0;
}else{
now=i+1;
}
sum+=prakum[i];
while((prakum[now]>=prakum[point]||skip)&&c<n-1){
if(prakum[now]<prakum[point]){
nowdel=1;
skip=0;
now++;
if(now>=n){
now=0;
}
if(point>=n){
point=0;
}
c++;
}else{
sum+=prakum[now];
if(nowdel){
point++;
nowdel=0;
if(point>=n){
point=0;
}
}
now++;
point++;
if(now>=n){
now=0;
}
if(point>=n){
point=0;
}
c++;
}
}
if(sum>most){
most=sum;
}
}
cout << most;
return 0;
} | # 2018118, 2024-09-28 14:35:11, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
using namespace std;
int main(){
int n,sum=0,point,now,most=0,c=0;
bool skip=1,nowdel=0;
cin >> n;
int i,prakum[n];
for(i=0;i<n;++i){
cin >> prakum[i];
}
for(i=0;i<n;++i){
skip=1;
nowdel=0;
c=0;
sum=0;
point=i;
if(i==n-1){
now=0;
}else{
now=i+1;
}
sum+=prakum[i];
while((prakum[now]>=prakum[point]||skip)&&c<n-1){
if(prakum[now]<prakum[point]){
nowdel=1;
skip=0;
now++;
if(now>=n){
now=0;
}
c++;
}else{
sum+=prakum[now];
if(nowdel){
point++;
nowdel=0;
if(point>=n){
point=0;
}
}
now++;
point++;
if(now>=n){
now=0;
}
if(point>=n){
point=0;
}
c++;
}
}
if(sum>most){
most=sum;
}
}
cout << most;
return 0;
} | # 2018680, 2024-09-28 15:15:26, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
using namespace std;
int main(){
int n,sum=0,point=0,now=0,most=0,c=0;
bool skip=1,nowdel=0;
cin >> n;
int i,prakum[n];
for(i=0;i<n;++i){
cin >> prakum[i];
}
for(i=0;i<n;++i){
skip=1;
nowdel=0;
c=0;
sum=0;
point=i;
if(i==n-1){
now=0;
}else{
now=i+1;
}
sum+=prakum[i];
while((prakum[now]>=prakum[point]||skip)&&c<n-1){
if(prakum[now]<prakum[point]){
nowdel=1;
skip=0;
now++;
if(now>=n){
now=0;
}
c++;
}else{
sum+=prakum[now];
if(nowdel){
point++;
nowdel=0;
if(point>=n){
point=0;
}
}
now++;
point++;
if(now>=n){
now=0;
}
if(point>=n){
point=0;
}
c++;
}
}
if(sum>=most){
most=sum;
}
}
cout << most;
return 0;
} |
# 2017992, 2024-09-28 14:23:31, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int num, arr[1000], mx = 0;
cin >> num;
for (int i = 0; i < num; i++)
{
cin >> arr[i];
arr[i + num] = arr[i];
}
for (int sta = 0; sta < num; sta++)
{
int sum = arr[sta], cnt = 0;
//cout << sum << " " ;
for (int i = sta + 1; i < sta + num; i++)
{
if (arr[i] < arr[i - 1])
{
if (arr[i + 1] >= arr[i - 1] && i + 1 < sta + num && cnt < 1)
{
//cout << arr[i + 1] << " ";
sum += arr[i + 1];
cnt++;
i++;
}
else
{
break;
}
}
else
{
//cout << arr[i] << " ";
sum += arr[i];
}
}
//cout << " -> " << sum << "\n";
if (sum > mx)
{
mx = sum;
}
}
cout << mx;
return 0;
} | # 2018057, 2024-09-28 14:29:10, -------------------- (0%)
#include<iostream>
#include<cmath>
#include<climits>
using namespace std;
int maxx = INT_MIN;
int main()
{
int n;
cin>>n;
int check[n + 2] = {};
bool use[n + 2] = {};// 0 use 1 dont use
for(int i=1;i<=n;i++)
{
cin>>check[i];
}
// 1 2 3 4 5 6 7
// 2 3 4 5 6 7 1
// 3 4 5 6 7 1 2
// 3
// 4
// 5
// 6
// dont erase
int check_index = 0;
for(int i=1;i<=n;i++)
{
int sum = 0;
bool stop = 0;
for(int j=1;j<=n;j++)
{
if(stop == 0)
{
if(j == 1)
{
sum += check[check_index % (n-1)];
}
else if(j != 1)
{
if(check[j] > check[j-1])sum += check[check_index % (n-1)];
else
{
stop = 1;
continue;
}
}
}
check_index += 1;
}
cout<<sum<<endl;
maxx = max(maxx,sum);
}
// erase
check_index = 0;
for(int i=1;i<=n;i++)
{
use[i] = 1;
for(int k = 1;k<=n;k++)
{
int sum = 0;
bool stop = 0;
int old;
for(int j=1;j<=n;j++)
{
if(stop == 0&&use[i] == 0)
{
if(j == 1)
{
sum += check[check_index % (n-1)];
old = check[check_index % (n-1)];
}
else if(j != 1)
{
if(check[j] > old)sum += check[check_index % (n-1)];
else
{
stop = 1;
continue;
}
}
}
}
maxx = max(maxx,sum);
use[i] = 0;
cout<<sum<<endl;
}
}
cout<<maxx;
} | # 2018064, 2024-09-28 14:29:22, Compilation error (0%)
#include<iostream>
#include<cmath>
#include<climits>
using namespace std;
int maxx = INT_MIN;
int main()
{
int n;
cin>>n;
int check[n + 2] = {};
bool use[n + 2] = {};// 0 use 1 dont use
for(int i=1;i<=n;i++)
{
cin>>check[i];
}
// 1 2 3 4 5 6 7
// 2 3 4 5 6 7 1
// 3 4 5 6 7 1 2
// 3
// 4
// 5
// 6
// dont erase
int check_index = 0;
for(int i=1;i<=n;i++)
{
int sum = 0;#include <bits/stdc++.h>
using namespace std;
int main()
{
int num, arr[1000], mx = 0;
cin >> num;
for (int i = 0; i < num; i++)
{
cin >> arr[i];
arr[i + num] = arr[i];
}
for (int sta = 0; sta < num; sta++)
{
int sum = arr[sta], cnt = 0;
//cout << sum << " " ;
for (int i = sta + 1; i < sta + num; i++)
{
if (arr[i] < arr[i - 1])
{
if (arr[i + 1] >= arr[i - 1] && i + 1 < sta + num && cnt < 1)
{
//cout << arr[i + 1] << " ";
sum += arr[i + 1];
cnt++;
i++;
}
else
{
break;
}
}
else
{
//cout << arr[i] << " ";
sum += arr[i];
}
}
//cout << " -> " << sum << "\n";
if (sum > mx)
{
mx = sum;
}
}
cout << mx;
return 0;
}
bool stop = 0;
for(int j=1;j<=n;j++)
{
if(stop == 0)
{
if(j == 1)
{
sum += check[check_index % (n-1)];
}
else if(j != 1)
{
if(check[j] > check[j-1])sum += check[check_index % (n-1)];
else
{
stop = 1;
continue;
}
}
}
check_index += 1;
}
cout<<sum<<endl;
maxx = max(maxx,sum);
}
// erase
check_index = 0;
for(int i=1;i<=n;i++)
{
use[i] = 1;
for(int k = 1;k<=n;k++)
{
int sum = 0;
bool stop = 0;
int old;
for(int j=1;j<=n;j++)
{
if(stop == 0&&use[i] == 0)
{
if(j == 1)
{
sum += check[check_index % (n-1)];
old = check[check_index % (n-1)];
}
else if(j != 1)
{
if(check[j] > old)sum += check[check_index % (n-1)];
else
{
stop = 1;
continue;
}
}
}
}
maxx = max(maxx,sum);
use[i] = 0;
cout<<sum<<endl;
}
}
cout<<maxx;
} | # 2018065, 2024-09-28 14:29:36, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int num, arr[1000], mx = 0;
cin >> num;
for (int i = 0; i < num; i++)
{
cin >> arr[i];
arr[i + num] = arr[i];
}
for (int sta = 0; sta < num; sta++)
{
int sum = arr[sta], cnt = 0;
//cout << sum << " " ;
for (int i = sta + 1; i < sta + num; i++)
{
if (arr[i] < arr[i - 1])
{
if (arr[i + 1] >= arr[i - 1] && i + 1 < sta + num && cnt < 1)
{
//cout << arr[i + 1] << " ";
sum += arr[i + 1];
cnt++;
i++;
}
else
{
break;
}
}
else
{
//cout << arr[i] << " ";
sum += arr[i];
}
}
//cout << " -> " << sum << "\n";
if (sum > mx)
{
mx = sum;
}
}
cout << mx;
return 0;
} | # 2018174, 2024-09-28 14:40:46, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int num, arr[2000], mx = 0;
cin >> num;
for (int i = 0; i < num; i++)
{
cin >> arr[i];
arr[i + num] = arr[i];
}
for (int sta = 0; sta < num; sta++)
{
int sum = arr[sta], cnt = 0;
//cout << sum << " " ;
for (int i = sta + 1; i < sta + num; i++)
{
if (arr[i] < arr[i - 1])
{
if (arr[i + 1] >= arr[i - 1] && i + 1 < sta + num && cnt < 1)
{
//cout << arr[i + 1] << " ";
sum += arr[i + 1];
cnt++;
i++;
}
else
{
break;
}
}
else
{
//cout << arr[i] << " ";
sum += arr[i];
}
}
//cout << " -> " << sum << "\n";
if (sum > mx)
{
mx = sum;
}
}
cout << mx;
return 0;
} |
# 2015965, 2024-09-28 11:00:06, ------------x----x-- (0%)
#include <bits/stdc++.h>
using namespace std;
int main () {
int num , high = 0 ;
cin >> num;
int power[num] ;
for (int i = 0 ; i < num ; i++)
{
cin >> power[i] ;
}
// no del
for (int i = 0 ; i< num ; i ++)
{
int time_cal = 0 ;
int cal = 0;
for (int ii =0 ; ii< num ; ii ++ )
{
time_cal = time_cal % num ;
time_cal = ii + i ;
cal += power[time_cal] ;
}
if (cal > high)
{
high = cal ;
}
}
cout << high ;
// have del
return 0;
} | # 2016104, 2024-09-28 11:13:31, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main () {
int num , high = 0 ;
cin >> num;
int power[num] ;
for (int i = 0 ; i < num ; i++)
{
cin >> power[i] ;
}
// no del
for (int i = 0 ; i< num ; i ++)
{
int time_cal = 0 ;
int cal = 0;
for (int ii =0 ; ii< num ; ii ++ )
{
time_cal = ii + i ;
time_cal = time_cal % num ;
cal += power[time_cal] ;
if (power[(time_cal + 1) % num ] <power[time_cal])
{
break;
}
}
if (cal > high)
{
high = cal ;
}
}
cout << high ;
// have del
return 0;
} | # 2016491, 2024-09-28 11:45:15, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main () {
int num , high = 0 ;
cin >> num;
int power[num] ;
for (int i = 0 ; i < num ; i++)
{
cin >> power[i] ;
}
// no del
for (int i = 0 ; i< num ; i ++)
{
int time_cal = 0 ;
int cal = 0;
for (int ii =0 ; ii< num ; ii ++ )
{
time_cal = ii + i ;
time_cal = time_cal % num ;
cal += power[time_cal] ;
if (power[(time_cal + 1) % num ] <power[time_cal])
{
break;
}
}
if (cal > high)
{
high = cal ;
}
}
// have del
for ( int iii =0 ; iii < num ; iii ++)
{
for (int i = 0 ; i< num ; i ++)
{
int time_cal = 0 ;
int cal = 0;
for (int ii =0 ; ii< num ; ii ++ )
{
time_cal = ii + i ;
time_cal = time_cal % num ;
if (time_cal == (iii + 1) % num )
{
if (power[(time_cal ) % num ] < power[(time_cal + num - 2 ) % num ])
{
break;
}
}
if (time_cal != iii)
{
cal += power[time_cal] ;
}
if (((time_cal + 1 ) % num ) == iii)
{
continue;
}
if (power[(time_cal + 1) % num ] <power[time_cal])
{
break;
}
}
if (cal > high)
{
high = cal ;
}
}
}
cout << high ;
return 0;
} | # 2016622, 2024-09-28 11:52:58, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main () {
long long num , high = 0 ;
cin >> num;
int power[num] ;
for (int i = 0 ; i < num ; i++)
{
cin >> power[i] ;
}
// no del
for (int i = 0 ; i< num ; i ++)
{
int time_cal = 0 ;
long long cal = 0;
for (int ii =0 ; ii< num ; ii ++ )
{
time_cal = ii + i ;
time_cal = time_cal % num ;
cal += power[time_cal] ;
if (power[(time_cal + 1) % num ] <power[time_cal])
{
break;
}
}
if (cal >= high)
{
high = cal ;
}
}
// have del
for ( int iii =0 ; iii < num ; iii ++)
{
for (int i = 0 ; i< num ; i ++)
{
int time_cal = 0 ;
long long cal = 0;
for (int ii =0 ; ii< num ; ii ++ )
{
time_cal = ii + i ;
time_cal = time_cal % num ;
if (time_cal == (iii + 1) % num )
{
if (power[(time_cal ) % num ] < power[(time_cal + num - 2 ) % num ])
{
break;
}
}
if (time_cal != iii)
{
cal += power[time_cal] ;
}
if (((time_cal + 1 ) % num ) == iii)
{
continue;
}
if (power[(time_cal + 1) % num ] <power[time_cal])
{
break;
}
}
if (cal > high)
{
high = cal ;
}
}
}
cout << high ;
return 0;
} |
# 2015711, 2024-09-28 10:33:48, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,maxBead,maxPow=0,del=0;
cin>>n;
int bead[n],backbead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
//cout<<bead[i]<<" "<<endl;//
}
for(int i=0;i<n;i++){
backbead[n-1-i]=bead[i];
}
for(int i=0;i<n;i++){
int sum=bead[i];
maxBead=bead[i];
del=0;
//cout<<sum;//
//cout<<bead[i]<<" ";//
for(int j=1;j<=n-1;j++){
//cout<<(i+j)%n<<" ";//
if(maxBead<=bead[(i+j)%n]){
maxBead=bead[(i+j)%n];
sum+=bead[(i+j)%n];
//cout<<bead[(i+j)%n];//
}
else{
del+=1;
}
if(del>1)break;
}
maxPow=max(maxPow,sum);
//cout<<":"<<sum<<endl;//
//cout<<endl;//
}
cout<<maxPow;
return 0;
} | # 2016376, 2024-09-28 11:37:53, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,maxBead,maxPow=0,del=0;
cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
//cout<<bead[i]<<" "<<endl;//
}
for(int i=0;i<n;i++){
int sum=bead[i];
maxBead=bead[i];
del=0;
//cout<<sum;//
//cout<<bead[i]<<" ";//
for(int j=1;j<=n-1;j++){
//cout<<(i+j)%n<<" ";//
if(maxBead<=bead[(i+j)%n]){
maxBead=bead[(i+j)%n];
sum+=bead[(i+j)%n];
//cout<<bead[(i+j)%n];//
}
else{
del+=1;
}
if(del>1)break;
}
maxPow=max(maxPow,sum);
//cout<<":"<<sum<<endl;//
//cout<<endl;//
}
cout<<maxPow;
return 0;
} | # 2016532, 2024-09-28 11:48:17, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,maxBead,maxPow=0,del=0;
cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
//cout<<bead[i]<<" "<<endl;//
}
for(int i=0;i<n;i++){
int sum=bead[i];
maxBead=bead[i];
del=0;
//cout<<sum;//
//cout<<bead[i]<<" ";//
for(int j=1;j<=n-1;j++){
//cout<<(i+j)%n<<" ";//
if(maxBead<=bead[(i+j)%n]){
maxBead=bead[(i+j)%n];
sum+=bead[(i+j)%n];
//cout<<bead[(i+j)%n];//
}
else{
del+=1;
}
if(del>1)break;
}
maxPow=max(maxPow,sum);
cout<<":"<<sum<<endl;//
cout<<endl;//
}
cout<<maxPow;
return 0;
} | # 2016541, 2024-09-28 11:48:58, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,maxBead,maxPow=0,del=0;
cin>>n;
int bead[n];
for(int i=0;i<n;i++){
cin>>bead[i];
//cout<<bead[i]<<" "<<endl;//
}
for(int i=0;i<n;i++){
int sum=bead[i];
maxBead=bead[i];
del=0;
//cout<<sum;//
//cout<<bead[i]<<" ";//
for(int j=1;j<=n-1;j++){
//cout<<(i+j)%n<<" ";//
if(maxBead<=bead[(i+j)%n]){
maxBead=bead[(i+j)%n];
sum+=bead[(i+j)%n];
//cout<<bead[(i+j)%n];//
}
else{
del+=1;
}
if(del>1)break;
}
maxPow=max(maxPow,sum);
//cout<<":"<<sum<<endl;//
//cout<<endl;//
}
cout<<maxPow;
return 0;
} |
# 2016289, 2024-09-28 11:31:50, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
vector<int> marble;
int main(){
int num;
cin >> num;
for (int i =0; i< num; i++){
int power;
cin >> power;
marble.emplace_back(power);
}
int Maxpower = 0;
for (int i =0; i< marble.size(); i++){
int sumPower = marble[i];
//cout << marble[i] << " ";
bool del = false;
int nextMarble = i+1;
int Lastmarble = marble[i];
while (true){
if (nextMarble == marble.size()){
nextMarble = 0;
}
if (nextMarble == i)
break;
//cout << "Next Marble = " <<marble[nextMarble] << endl;
if (Lastmarble > marble[nextMarble]) // if current is more than
{
//cout << Lastmarble << " Morethan " << marble[nextMarble] << endl;
if (del == false){
del = true;
//cout << "Check next";
goto CheckNext;
}
else{
Lastmarble = marble[nextMarble];
break;
}
}
else{
Lastmarble = marble[nextMarble];
sumPower+= marble[nextMarble];
//cout << "Sum : " << sumPower << endl;
}
CheckNext:
nextMarble++;
}
Maxpower = max(sumPower,Maxpower);
}
cout << Maxpower;
} | # 2016330, 2024-09-28 11:34:36, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
vector<int> marble;
int main(){
int num;
cin >> num;
for (int i =0; i< num; i++){
int power;
cin >> power;
marble.emplace_back(power);
}
long long Maxpower = 0;
for (int i =0; i< marble.size(); i++){
long long sumPower = marble[i];
//cout << marble[i] << " ";
bool del = false;
int nextMarble = i+1;
int Lastmarble = marble[i];
while (true){
if (nextMarble == marble.size()){
nextMarble = 0;
}
if (nextMarble == i)
break;
//cout << "Next Marble = " <<marble[nextMarble] << endl;
if (Lastmarble > marble[nextMarble]) // if current is more than
{
//cout << Lastmarble << " Morethan " << marble[nextMarble] << endl;
if (del == false){
del = true;
//cout << "Check next";
goto CheckNext;
}
else{
Lastmarble = marble[nextMarble];
break;
}
}
else{
Lastmarble = marble[nextMarble];
sumPower+= marble[nextMarble];
//cout << "Sum : " << sumPower << endl;
}
CheckNext:
nextMarble++;
}
Maxpower = max(sumPower,Maxpower);
}
cout << Maxpower;
} | # 2016370, 2024-09-28 11:37:40, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
vector<int> marble;
int main(){
int num;
cin >> num;
for (int i =0; i< num; i++){
int power;
cin >> power;
marble.emplace_back(power);
}
long long Maxpower = 0;
for (int i =0; i< marble.size(); i++){
long long sumPower = marble[i];
//cout << marble[i] << " ";
bool del = false;
int nextMarble = i+1;
int Lastmarble = marble[i];
while (true){
if (nextMarble == marble.size()){
nextMarble = 0;
}
if (nextMarble == i)
break;
//cout << "Next Marble = " <<marble[nextMarble] << endl;
if (Lastmarble > marble[nextMarble]) // if current is more than
{
//cout << Lastmarble << " Morethan " << marble[nextMarble] << endl;
if (del == false){
del = true;
//cout << "Check next";
goto CheckNext;
}
else{
Lastmarble = marble[nextMarble];
break;
}
}
else{
Lastmarble = marble[nextMarble];
sumPower+= marble[nextMarble];
//cout << "Sum : " << sumPower << endl;
}
CheckNext:
nextMarble++;
}
Maxpower = max(sumPower,Maxpower);
}
cout << int(Maxpower);
} | # 2016669, 2024-09-28 11:55:18, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
vector<int> marble;
int main(){
int num;
cin >> num;
for (int i =0; i< num; i++){
int power;
cin >> power;
marble.emplace_back(power);
}
long long Maxpower = 0;
for (int i =0; i< marble.size(); i++){
long long sumPower = marble[i];
//cout << marble[i] << " ";
bool del = false;
int nextMarble = i+1;
int Lastmarble = marble[i];
while (true){
if (nextMarble == marble.size()){
nextMarble = 0;
}
if (nextMarble == i)
break;
//cout << "Next Marble = " <<marble[nextMarble] << endl;
if (Lastmarble > marble[nextMarble]) // if current is more than
{
//cout << Lastmarble << " Morethan " << marble[nextMarble] << endl;
if (del == false){
del = true;
//cout << "Check next";
goto CheckNext;
}
else{
Lastmarble = marble[nextMarble];
break;
}
}
else{
Lastmarble = marble[nextMarble];
sumPower+= marble[nextMarble];
//cout << "Sum : " << sumPower << endl;
}
CheckNext:
nextMarble++;
}
Maxpower = max<long long>(sumPower,Maxpower);
}
cout << Maxpower;
} |
# 2015686, 2024-09-28 10:32:03, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int beadsCount;
cin >> beadsCount;
int beadPower;
int beads[beadsCount];
for (int i = 0; i < beadsCount; i++) {
cin >> beadPower;
beads[i] = beadPower;
}
int maxPower = 0, currentPower = 0, removeCounter = 1;
for (int startingBead = 0; startingBead < beadsCount; startingBead++) {
for (int i = startingBead; i < startingBead + beadsCount; i++) {
currentPower += beads[i % beadsCount];
if (beads[(i + 1) % beadsCount] < beads[i % beadsCount]) {
if (removeCounter > 0) {
if (beads[(i + 2) % beadsCount] < beads[i % beadsCount]) {break;}
--removeCounter;
++i;
continue;
} else {
break;
}
}
}
maxPower = max(maxPower, currentPower);
currentPower = 0;
removeCounter = 1;
}
cout << maxPower << endl; // it just works
} | # 2015824, 2024-09-28 10:46:42, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int beadsCount;
cin >> beadsCount;
int beadPower;
int beads[beadsCount];
for (int i = 0; i < beadsCount; i++) {
cin >> beadPower;
beads[i] = beadPower;
}
int maxPower = 0, currentPower = 0, removeCounter = 1;
for (int startingBead = 0; startingBead < beadsCount; startingBead++) {
for (int i = startingBead; i < startingBead + beadsCount; i++) {
currentPower += beads[i % beadsCount];
if (beads[(i + 1) % beadsCount] < beads[i % beadsCount]) {
if (removeCounter > 0) {
if (beads[(i + 2) % beadsCount] < beads[i % beadsCount]) {break;}
--removeCounter;
++i;
continue;
} else {
break;
}
}
}
maxPower = max(maxPower, currentPower);
currentPower = 0;
removeCounter = 1;
}
cout << maxPower << endl;
} | # 2015925, 2024-09-28 10:56:59, P--P---P--------P--- (20%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int beadsCount;
cin >> beadsCount;
int beadPower;
int beads[beadsCount];
for (int i = 0; i < beadsCount; i++) {
cin >> beadPower;
beads[i] = beadPower;
}
int maxPower = 0, currentPower = 0, removeCounter = 1;
for (int startingBead = 0; startingBead < beadsCount; startingBead++) {
for (int i = startingBead; i < startingBead + beadsCount; i++) {
currentPower += beads[i % beadsCount];
if (beads[(i + 1) % beadsCount] <= beads[i % beadsCount]) {
if (removeCounter > 0) {
if (beads[(i + 2) % beadsCount] <= beads[i % beadsCount]) {break;}
--removeCounter;
++i;
continue;
} else {
break;
}
}
}
maxPower = max(maxPower, currentPower);
currentPower = 0;
removeCounter = 1;
}
cout << maxPower << endl;
} | # 2015939, 2024-09-28 10:57:29, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int beadsCount;
cin >> beadsCount;
int beadPower;
int beads[beadsCount];
for (int i = 0; i < beadsCount; i++) {
cin >> beadPower;
beads[i] = beadPower;
}
int maxPower = 0, currentPower = 0, removeCounter = 1;
for (int startingBead = 0; startingBead < beadsCount; startingBead++) {
for (int i = startingBead; i < startingBead + beadsCount; i++) {
currentPower += beads[i % beadsCount];
if (beads[(i + 1) % beadsCount] < beads[i % beadsCount]) {
if (removeCounter > 0) {
if (beads[(i + 2) % beadsCount] < beads[i % beadsCount]) {break;}
--removeCounter;
++i;
continue;
} else {
break;
}
}
}
maxPower = max(maxPower, currentPower);
currentPower = 0;
removeCounter = 1;
}
cout << maxPower << endl;
} |
# 2015875, 2024-09-28 10:52:38, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,max=0;
cin >> n;
int a[n];
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i<n;i++){
bool rm=0;
int sum=0;
int *p;
p=a+i;
for(int j=0;j<n;j++){
int num=*p;
sum+=num;
// cout << *p <<" ";
if(p==a+n-1){
p=a;
}else p++;
if(num>*p){
if(!rm){
rm=1;
if(p==a+n-1)p=a;
else p++;
j++;
if(num>*p)break;
}
else break;
}
}
if(sum>max)max=sum;
// cout << sum << endl;
}
cout <<max;
} | # 2016333, 2024-09-28 11:35:02, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,max=0;
cin >> n;
int a[n];
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i<n;i++){
bool rm=0;
int sum=0;
int *p;
p=a+i;
for(int j=0;j<n;j++){
int num=*p;
sum+=num;
// cout << *p <<" ";
if(p==a+n-1){
p=a;
}else p++;
if(num>*p){
if(!rm){
rm=1;
if(p==a+n-1)p=a;
else p++;
j++;
if(num>*p)break;
}
else break;
}
}
if(sum>max)max=sum;
// cout << sum << endl;
}
cout <<max;
} | # 2016351, 2024-09-28 11:35:58, PPPPPPPPP----PP-PPP- (70%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long n,max=0;
cin >> n;
long a[n];
for(long i=0;i<n;i++)cin >> a[i];
for(long i=0;i<n;i++){
bool rm=0;
long sum=0;
long *p;
p=a+i;
for(long j=0;j<n;j++){
long num=*p;
sum+=num;
// cout << *p <<" ";
if(p==a+n-1){
p=a;
}else p++;
if(num>*p){
if(!rm){
rm=1;
if(p==a+n-1)p=a;
else p++;
j++;
if(num>*p)break;
}
else break;
}
}
if(sum>max)max=sum;
// cout << sum << endl;
}
cout <<max;
} |
# 2017623, 2024-09-28 13:51:08, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll ans=0,last,cnt=0,now=0;
int mark=1;
int n;
vector<int> vec;
cin>>n;
vec.resize(n*2+1);
for(int i=1;i<=n;i++){
cin>>vec[i];
vec[i+n]=vec[i];
}
for(int i=1;i<=n;i++){
now=vec[i];
last=vec[i];
cnt=1;
mark=1;
for(int j=i+1;j<=i+n-1;j++){
if(last>vec[j]){
if(mark==1){
mark=0;
continue;
}else{
break;
}
}
cnt++;
//cout<<now<<" "<<vec[j]<<endl;
now+= vec[j];
last = vec[j];
if(cnt==n){
cout<<now;
return 0;
}
}
if(now>ans){
ans = now;
}
}
cout<<ans;
} | # 2017638, 2024-09-28 13:52:59, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll ans=0,last,cnt=0,now=0;
int mark=1;
ll n;
vector<int> vec;
cin>>n;
vec.resize(n*2+1);
for(int i=1;i<=n;i++){
cin>>vec[i];
vec[i+n]=vec[i];
}
for(int i=1;i<=n;i++){
now=vec[i];
last=vec[i];
cnt=1;
mark=1;
for(int j=i+1;j<=i+n-1;j++){
if(last>vec[j]){
if(mark==1){
mark=0;
continue;
}else{
break;
}
}
cnt++;
//cout<<now<<" "<<vec[j]<<endl;
now+= vec[j];
last = vec[j];
if(cnt==n){
cout<<now;
return 0;
}
}
if(now>ans){
ans = now;
}
}
cout<<ans;
} | # 2017725, 2024-09-28 14:02:06, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll ans=0,last,cnt=0,now=0;
int mark=1;
int n;
vector<int> vec;
cin>>n;
vec.resize(n*2+1);
for(int i=1;i<=n;i++){
cin>>vec[i];
vec[i+n]=vec[i];
}
for(int i=1;i<=n;i++){
now=vec[i];
last=vec[i];
cnt=1;
mark=1;
for(int j=i+1;j<=i+n-1;j++){
if(last>vec[j]){
if(mark==1){
mark=0;
continue;
}else{
break;
}
}
cnt++;
//cout<<now<<" "<<vec[j]<<endl;
now+= vec[j];
last = vec[j];
// if(cnt==n){
// cout<<now;
// return 0;
// }
}
if(now>ans){
ans = now;
}
}
cout<<ans;
} |
# 2015786, 2024-09-28 10:43:13, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <vector>
using namespace std;
int n;
vector<int> olo, olo_keep;
int best = 0;
int main(){
cin >> n;
for(int i = 0; i<n; i++){
int o;
cin >> o;
olo.push_back(o);
}
olo_keep = olo;
// for(auto i : olo_keep){
// cout << i;
// }
for(int i=0; i<n; i++){
int cut = 0, now = i, sum = 0, count = 1;
sum += olo[i];
while(count < n){
// cout << i << " " << now << " " << sum << endl;
if(now == olo.size()-1){
// cout << "111" << endl;
if(olo[now] <= olo[0]){
now = 0;
sum += olo[now];
}
else{
break;
}
}
else if(olo[now] <= olo[now+1] && now+1 < olo.size()){
// cout << "222" << endl;
now++;
sum += olo[now];
}
else if(olo[now] >= olo[now+1] && cut == 0 && now+1 < olo.size()){
// cout << "333" << endl;
olo.erase(olo.begin() + (now+1));
cut = 1;
}
else{
// cout << "444" << endl;
break;
}
count++;
}
if(best < sum) best = sum;
olo = olo_keep;
}
cout << best;
} | # 2015825, 2024-09-28 10:46:47, PPPPPPPPP----PP-PTP- (65%)
#include <iostream>
#include <vector>
using namespace std;
int n;
vector<int> olo, olo_keep;
int best = 0;
int main(){
cin >> n;
for(int i = 0; i<n; i++){
int o;
cin >> o;
olo.push_back(o);
}
olo_keep = olo;
// for(auto i : olo_keep){
// cout << i;
// }
for(int i=0; i<n; i++){
int cut = 0, now = i, sum = 0, count = 1;
sum += olo[i];
while(true){
// cout << i << " " << now << " " << sum << endl;
if(now == olo.size()-1){
// cout << "111" << endl;
if(olo[now] <= olo[0]){
now = 0;
sum += olo[now];
}
else{
break;
}
}
else if(olo[now] <= olo[now+1] && now+1 < olo.size()){
// cout << "222" << endl;
now++;
sum += olo[now];
}
else if(olo[now] >= olo[now+1] && cut == 0 && now+1 < olo.size()){
// cout << "333" << endl;
olo.erase(olo.begin() + (now+1));
cut = 1;
}
else{
// cout << "444" << endl;
break;
}
count++;
}
if(best < sum) best = sum;
olo = olo_keep;
}
cout << best;
} | # 2015828, 2024-09-28 10:47:00, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <vector>
using namespace std;
int n;
vector<int> olo, olo_keep;
int best = 0;
int main(){
cin >> n;
for(int i = 0; i<n; i++){
int o;
cin >> o;
olo.push_back(o);
}
olo_keep = olo;
// for(auto i : olo_keep){
// cout << i;
// }
for(int i=0; i<n; i++){
int cut = 0, now = i, sum = 0, count = 1;
sum += olo[i];
while(count < n){
// cout << i << " " << now << " " << sum << endl;
if(now == olo.size()-1){
// cout << "111" << endl;
if(olo[now] <= olo[0]){
now = 0;
sum += olo[now];
}
else{
break;
}
}
else if(olo[now] <= olo[now+1] && now+1 < olo.size()){
// cout << "222" << endl;
now++;
sum += olo[now];
}
else if(olo[now] >= olo[now+1] && cut == 0 && now+1 < olo.size()){
// cout << "333" << endl;
olo.erase(olo.begin() + (now+1));
cut = 1;
}
else{
// cout << "444" << endl;
break;
}
count++;
}
if(best < sum) best = sum;
olo = olo_keep;
}
cout << best;
} |
# 2018271, 2024-09-28 14:48:08, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int arr[num];
int max = 0;
for(int i = 0;i<num;i++){
cin >> arr[i];
}
int now;
int then;
for(int i = 0;i<num;i++){
int temparr[num];
for(int i = 0;i<num-1;i++){
temparr[i+1] = arr[i];
}
temparr[0] = arr[num-1];
for(int i = 0;i<num;i++){
arr[i] = temparr[i];
}
int temp = 0;
int check = 1;
now = arr[0];
then = arr[0+1];
while(now <= then){
if(check == num)break;
temp = temp + now;
now = arr[check];
then = arr[1+check];
if(1+check == num){
then = arr[0];
}
check++;
}
if(temp > max){
max = temp;
}
now = arr[0];
then = arr[1];
temp = 0;
int pass = 0;
check = 1;
while(pass<2){
if(check == num)break;
if(now > then){
then = arr[check+1];
if(1+check == num){
then = arr[0];
}
pass++;
} else{
temp = temp + now;
now = arr[check];
then = arr[1+check];
if(1+check == num){
then = arr[0];
}
}
check++;
//cout << temp << " ";
}
temp = temp + now;
//cout << temp <<endl;
if(temp > max){
max = temp;
}
}
cout << max;
} | # 2018278, 2024-09-28 14:49:50, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int arr[num];
int max = 0;
for(int i = 0;i<num;i++){
cin >> arr[i];
}
int now;
int then;
for(int i = 0;i<num;i++){
int temparr[num];
for(int i = 0;i<num-1;i++){
temparr[i+1] = arr[i];
}
temparr[0] = arr[num-1];
for(int i = 0;i<num;i++){
arr[i] = temparr[i];
}
int temp = 0;
int check = 1;
now = arr[0];
then = arr[0+1];
while(now <= then){
if(check == num)break;
temp = temp + now;
now = arr[check];
then = arr[1+check];
if(1+check == num){
then = arr[0];
}
check++;
}
if(temp > max){
max = temp;
}
now = arr[0];
then = arr[1];
temp = 0;
int pass = 0;
check = 1;
while(pass<2){
if(check == num)break;
if(now > then){
then = arr[check+1];
if(1+check == num){
then = arr[0];
}
if(now > then)break;
pass++;
} else{
temp = temp + now;
now = arr[check];
then = arr[1+check];
if(1+check == num){
then = arr[0];
}
}
check++;
//cout << temp << " ";
}
temp = temp + now;
//cout << temp <<endl;
if(temp > max){
max = temp;
}
}
cout << max;
} | # 2018745, 2024-09-28 15:17:27, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int arr[num];
int max = 0;
for(int i = 0;i<num;i++){
cin >> arr[i];
}
int now;
int then;
int temparr[num];
for(int i = 0;i<num-1;i++){
temparr[i+1] = arr[i];
}
temparr[0] = arr[num-1];
for(int i = 0;i<num;i++){
arr[i] = temparr[i];
}
for(int i = 0;i<num;i++){
int temparr[num];
for(int i = 0;i<num-1;i++){
temparr[i+1] = arr[i];
}
temparr[0] = arr[num-1];
for(int i = 0;i<num;i++){
arr[i] = temparr[i];
}
int temp = 0;
int check = 1;
now = arr[0];
then = arr[0+1];
while(now <= then){
if(check == num)break;
temp = temp + now;
now = arr[check];
then = arr[1+check];
if(1+check == num){
then = arr[0];
}
check++;
}
if(temp > max){
max = temp;
}
now = arr[0];
then = arr[1];
temp = 0;
int pass = 0;
check = 1;
while(pass<2){
if(check == num)break;
if(now > then){
then = arr[check+1];
if(1+check == num){
then = arr[0];
}
if(now > then)break;
pass++;
} else{
temp = temp + now;
now = arr[check];
then = arr[1+check];
if(1+check == num){
then = arr[0];
}
}
check++;
//cout << temp << " ";
}
temp = temp + now;
//cout << temp <<endl;
if(temp > max){
max = temp;
}
}
cout << max;
} |
# 2017911, 2024-09-28 14:14:55, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ball[n];
for(int i=0;i<n;i++){
cin>>ball[i];
}
vector<vector<int>> pa;
//no delete
for(int i=0;i<n;i++){// choose start
vector<int> ei;
int countt = 0;
int j=i;
int q=j+1;
if(q > n-1) q = 0;
while(ball[j] <= ball[q] && countt != n-1){
//cout<<ball[j]<<' ';
ei.push_back(ball[j]);
j++;
q++;
countt++;
if(q > n-1) q = 0;
if(j > n-1) j = 0;
}
//cout<<ball[j];
ei.push_back(ball[j]);
pa.push_back(ei);
//cout<<endl;
}
int sama[n];
for(int i=0;i<n;i++) sama[i] = 0;
int c=0;
for(auto &a:pa){
for(auto &s:a){
//cout<<s<<' ';
sama[c] += s;
}
//cout<<endl;
c++;
}
cout<<*max_element(sama, sama+n);
//for(int h:sama) cout<<h<<' ';
return 0;
} | # 2018537, 2024-09-28 15:08:20, PPPPPPPPP----PP-PPP- (70%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ball[n];
for(int i=0;i<n;i++){
cin>>ball[i];
}
vector<vector<int>> pa;
vector<int> del;
//no delete
for(int i=0;i<n;i++){// choose start
vector<int> ei;
int countt = 0;
int j=i;
int q=j+1;
if(q > n-1) q = 0;
bool skip = false;
while(ball[j] <= ball[q] && countt != n-1){
//cout<<ball[j]<<' ';
ei.push_back(ball[j]);
j++;
q++;
countt++;
if(q > n-1) q = 0;
if(j > n-1) j = 0;
}
//cout<<ball[j];
del.push_back(q);
ei.push_back(ball[j]);
pa.push_back(ei);
//cout<<endl;
}
int sama[n];
for(int i=0;i<n;i++) sama[i] = 0;
int c=0;
for(auto &a:pa){
for(auto &s:a){
//cout<<s<<' ';
sama[c] += s;
}
//cout<<endl;
c++;
}
//for(int h:sama) cout<<h<<' ';
del[n-1] = 0;
vector<vector<int>> test;
for(int i=0;i<n;i++){
vector<int> one;
for(int j=0;j<n;j++){
//test[i][j] = ball[j];
if(j != del[i]){
//test[i][j] = ball[j];
//test[i][j] = 999;
one.push_back(ball[j]);
}
}
test.push_back(one);
}
//cout<<endl;
for(auto Aa:test){
for(auto one:Aa){
//cout<<one<<' ';
}
//cout<<endl;
}
//cout<<endl;
vector<vector<int>> ans;
//delete
for(int i=0;i<n-1;i++){// choose start
int countt = 0;
int j=i;
int q=j+1;
if(q > n-1-1) q = 0;
vector<int> oo;
while(test[i][j] <= test[i][q] && countt != n-1-1){
//cout<<test[i][j]<<' ';
oo.push_back(test[i][j]);
j++;
q++;
countt++;
if(q > n-1-1) q = 0;
if(j > n-1-1) j = 0;
}
oo.push_back(test[i][j]);
//cout<<test[i][j]<<' ';
ans.push_back(oo);
//cout<<endl;
}
int maxx = 0;
for(auto a:ans){
int sasd = 0;
for(auto b:a){
//cout<<b<<' ';
sasd += b;
}
if(sasd > maxx) maxx = sasd;
//cout<<endl;
}
cout<<max(maxx, *max_element(sama, sama+n));
return 0;
} |
# 2017691, 2024-09-28 13:58:00, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
int n;
cin>>n;
int ball[n];
int max_pow=-1;
for(int i=0;i<n;i++){
cin>>ball[i];
}
for(int i=0;i<n;i++){
int quota=1;
int sum=0;
int cut=-1;
bool pass=true;
for(int j=0;j<n;j++){
int now_ball=(i+j)%n;
int next_ball=(i+j+1)%n;
if((quota>=0) &&(pass)){
if(ball[now_ball]>ball[next_ball]){
quota--;
cut=next_ball;
if(pass && ball[now_ball]>ball[(next_ball+1)%n]){
pass=false;
}
}
if(now_ball!=cut){
sum+=ball[now_ball];}
//out<<ball[now_ball]<<" "<<sum<<endl;
}
}
max_pow=max(sum,max_pow);
}
cout<<max_pow;
} | # 2018502, 2024-09-28 15:05:42, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
int n;
cin>>n;
int ball[n];
int max_pow=-1;
for(int i=0;i<n;i++){
cin>>ball[i];
}
for(int i=0;i<n;i++){
int quota=1;
int sum=0;
int cut=-1;
bool pass=true;
for(int j=0;j<n;j++){
if(!pass) break;
int now_ball=(i+j)%n;
int next_ball=(i+j+1)%n;
if((quota>=0)){
if(ball[now_ball]>ball[next_ball]){
quota--;
cut=next_ball;
if(ball[now_ball]>ball[(next_ball+1)%n]){
pass=false;
}
}
if(now_ball!=cut){
sum+=ball[now_ball];}
//else{cout<<"cut";}
//cout<<ball[now_ball]<<" "<<sum<<endl;
}
}
max_pow=max(sum,max_pow);
//cout<<"--------------\n";
}
cout<<max_pow;
} |
# 2015702, 2024-09-28 10:33:06, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <cmath>
#include <iomanip>
int totalMarble;
int currentPsyche, highestPsyche = -1;
bool skippable = true;
int main()
{
std::cin >> totalMarble;
int marbleOrder[totalMarble*2];
for (int i = 0; i < totalMarble; i++)
{
std::cin >> marbleOrder[i];
marbleOrder[i+totalMarble] = marbleOrder[i];
}
//running the starting position
for (int i = 0; i < totalMarble; i++)
{
//std::cout << i << '\n';
//the real cheking, will halt when complete cycle
for (int j = i; j < totalMarble + i; j++)
{
if (j == totalMarble + i - 1)
{
currentPsyche += marbleOrder[j];
//std::cout << j << " " << currentPsyche << '\n';
}
else if (marbleOrder[j] > marbleOrder[j+1])
{
if (skippable)
{
if (marbleOrder[j+2] >= marbleOrder[j])
{
currentPsyche += marbleOrder[j];
//std::cout << j << " " << currentPsyche << '\n';
j++;
skippable = false;
}
else
{
currentPsyche += marbleOrder[j];
break;
}
}
else
{
currentPsyche += marbleOrder[j];
//std::cout << j << " " << currentPsyche << '\n';
break;
}
}
else
{
currentPsyche += marbleOrder[j];
//std::cout << j << " " << currentPsyche << '\n';
}
}
if (currentPsyche > highestPsyche)
{
highestPsyche = currentPsyche;
}
currentPsyche = 0;
skippable = true;
}
std::cout << highestPsyche;
} |
# 2015837, 2024-09-28 10:48:03, PPPPPPPPP----PP-PPP- (70%)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v;
int main(){
int a;
cin >> a;
for(int i=0; i<a; i++){
int x;
cin >> x;
v.push_back(x);
}
int maxx = 0;
for(int i=0; i<a; i++){
int cur = i, next = cur + 1;
int chk = 0;
int carry = 0;
while(true){
if(chk==2) break;
if(next > v.size()-1) next = 0;
if(next==i) break;
if(v[cur]>v[next]){
chk++;
next++;
}else{
carry += v[cur];
cur = next;
next++;
}
}
carry += v[cur];
chk = 0;
maxx = max(maxx,carry);
}
cout << maxx;
} |
# 2017521, 2024-09-28 13:37:28, PP----PP------------ (20%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<n;i++)
{
if(a[i] <= a[i+1] )
{
samati +=a[i];
}
else if(a[i] > a[i+1])
{
samati += a[i];
break;
}
}
// int c = 0;
// for(i=0;i<n;i++)
// {
// for(j=0;j<n;j++)
// {
// b[j] = a[c]
// }
// }
cout << samati;
} | # 2018206, 2024-09-28 14:43:13, -------------------- (0%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati += b[j+i];
break;
}
}
if(samati > max)
{
max = samati;
}
samati =0;
cout << max << endl;
}
} | # 2018225, 2024-09-28 14:44:05, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati += b[j+i];
break;
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018276, 2024-09-28 14:49:24, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] > b[j+i])
{
samati += b[j+i] + b[j+i+2];
break;
}
else
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018296, 2024-09-28 14:50:52, PPPPPPPP------------ (40%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] >= b[j+i])
{
samati += b[j+i] + b[j+i+2];
break;
}
else
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018299, 2024-09-28 14:51:01, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] > b[j+i])
{
samati += b[j+i] + b[j+i+2];
break;
}
else
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018335, 2024-09-28 14:53:58, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] > b[j+i] && j+i < 2*n && j+1+i < 2*n && j+i+2 < 2*n)
{
samati += b[j+i] + b[j+i+2];
break;
}
else
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018354, 2024-09-28 14:54:53, PPPPPPPP------------ (40%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] > b[j+i] && j+i < 2*n && j+1+i < 2*n && j+i+2 < 2*n)
{
samati += b[j+i] + b[j+i+2];
break;
}
else if(b[j+i] > b[j+1+i] && b[j+i+2] < b[j+i] && j+i < 2*n && j+1+i < 2*n && j+i+2 < 2*n)
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018358, 2024-09-28 14:55:09, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
int a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] > b[j+i] && j+i < 2*n && j+1+i < 2*n && j+i+2 < 2*n)
{
samati += b[j+i] + b[j+i+2];
break;
}
else
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018428, 2024-09-28 15:00:29, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
long a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] > b[j+i] && j+i < 2*n && j+1+i < 2*n && j+i+2 < 2*n)
{
samati += b[j+i] + b[j+i+2];
break;
}
else
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018447, 2024-09-28 15:02:00, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
long a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] > b[j+i] && j+i < 2*n && j+1+i < 2*n && j+i+2 < 2*n)
{
samati += b[j+i] + b[j+i+2];
j++;
}
else
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} | # 2018454, 2024-09-28 15:02:22, PPPPPPPPP----PP--PP- (65%)
#include<iostream>
using namespace std;
int main()
{
int n,i,j;
long long samati =0 , max =0;
cin >> n;
long a[n],b[2*n];
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<2*n;i++)
{
if(i>=n)
{
b[i] = a[i-n];
}
else
{
b[i] = a[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[j+i] <= b[j+1+i] && j+i < 2*n && j+1+i < 2*n)
{
samati +=b[j+i];
}
else if(b[j+i] > b[j+1+i] && j+i < 2*n && j+1+i < 2*n )
{
if(b[j+i] > b[j+1+i] && b[j+i+2] > b[j+i] && j+i < 2*n && j+1+i < 2*n && j+i+2 < 2*n)
{
samati += b[j+i];
j++;
}
else
{
samati += b[j+i];
break;
}
}
}
if(samati > max)
{
max = samati;
}
samati =0;
}
cout << max;
} |
# 2015949, 2024-09-28 10:58:37, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
int main(){ // L = 0 U = IRR
int m; cin >> m;
vector<int> data;
for(int i=0;i<m;i++){
int x;
cin >> x;
data.push_back(x);
}
vector<int> vec;
for(int i=0;i<m;i++){
int j = i;
int sum = 0;
vector<int> dupli;
int count = 0;
while(true){
if(count == m) break;
bool lessthan = false;
for(int k=0;k<dupli.size();k++){
if(data[j] < dupli[k]){
lessthan = true;
break;
}
}
count++;
if(!lessthan){
dupli.push_back(data[j]);
sum += data[j];
j = (j+1)%m;
}
else if(count == m){
break;
}
else{
break;
}
}
vec.push_back(sum);
}
for(int i=m-1;i>=0;i--){
int j = i;
int sum = 0;
vector<int> dupli;
int count = 0;
while(true){
if(count == m) break;
bool lessthan = false;
for(int k=0;k<dupli.size();k++){
if(data[j] < dupli[k]){
lessthan = true;
break;
}
}
count++;
if(!lessthan){
dupli.push_back(data[j]);
sum += data[j];
j = j - 1;
if(j < 0) j += m;
}
else if(count == m){
break;
}
else{
break;
}
}
vec.push_back(sum);
}
int max = vec[0];
for(int i=0;i<vec.size();i++){
if(vec[i] > max) max = vec[i];
}
cout << max;
} | # 2016154, 2024-09-28 11:18:51, PPPP-PPP------------ (35%)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
int main(){ // L = 0 U = IRR
int n ; cin >> n;
vector<int> vec;
for(int i=0;i<n;i++){
int x; cin >> x;
vec.push_back(x);
}
int max = 0;
for(int i=0;i<n;i++){ // each starting postion
int j = i;
int count = 0;
int sum = 0;
vector<int> dupli;
while(true){
// cout << count << '\n';
if(count == n) break;
bool lessthan = false;
for(int k=0;k<dupli.size();k++){
if(vec[j] < dupli[k]){
// cout << "less than " << vec[j] << '\n';
lessthan = true;
break;
}
}
if(lessthan) break;
if(!lessthan){
dupli.push_back(vec[j]);
sum += vec[j];
// cout << vec[j] << '\n';
}
count++;
j++;
}
if(sum > max) max = sum;
}
cout << max;
} | # 2016161, 2024-09-28 11:19:10, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
int main(){ // L = 0 U = IRR
int m; cin >> m;
vector<int> data;
for(int i=0;i<m;i++){
int x;
cin >> x;
data.push_back(x);
}
vector<int> vec;
for(int i=0;i<m;i++){
int j = i;
int sum = 0;
vector<int> dupli;
int count = 0;
while(true){
if(count == m) break;
bool lessthan = false;
for(int k=0;k<dupli.size();k++){
if(data[j] < dupli[k]){
lessthan = true;
break;
}
}
count++;
if(!lessthan){
dupli.push_back(data[j]);
sum += data[j];
j = (j+1)%m;
}
else if(count == m){
break;
}
else{
break;
}
}
vec.push_back(sum);
}
for(int i=m-1;i>=0;i--){
int j = i;
int sum = 0;
vector<int> dupli;
int count = 0;
while(true){
if(count == m) break;
bool lessthan = false;
for(int k=0;k<dupli.size();k++){
if(data[j] < dupli[k]){
lessthan = true;
break;
}
}
count++;
if(!lessthan){
dupli.push_back(data[j]);
sum += data[j];
j = j - 1;
if(j < 0) j += m;
}
else if(count == m){
break;
}
else{
break;
}
}
vec.push_back(sum);
}
int max = vec[0];
for(int i=0;i<vec.size();i++){
if(vec[i] > max) max = vec[i];
}
cout << max;
} | # 2016233, 2024-09-28 11:26:22, PPPPPPPPP----PP-P-P- (65%)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
int main(){ // L = 0 U = IRR
int n ; cin >> n;
vector<int> vec;
for(int i=0;i<n;i++){
int x; cin >> x;
vec.push_back(x);
}
int max = 0;
for(int i=0;i<n;i++){ // each starting postion
int j = i;
int count = 0;
int sum = 0;
vector<int> dupli;
while(true){
// cout << count << '\n';
if(count == n) break;
bool lessthan = false;
for(int k=0;k<dupli.size();k++){
if(vec[j] < dupli[k]){
// cout << "less than " << vec[j] << '\n';
lessthan = true;
break;
}
}
if(lessthan) break;
if(!lessthan){
dupli.push_back(vec[j]);
sum += vec[j];
// cout << vec[j] << '\n';
}
count++;
j = (j+1)%n;
}
if(sum > max) max = sum;
}
// jump
for(int i=0;i<n;i++){ // each starting postion
int j = i;
int count = 0;
int sum = 0;
vector<int> dupli;
int cjump = 0;
while(true){
// cout << count << '\n';
if(count == n) break;
bool lessthan = false;
bool jump = false;
for(int k=0;k<dupli.size();k++){
if(vec[j] < dupli[k]){
// cout << "less than " << vec[j] << '\n';
if(cjump < 1){
jump = true;
cjump++;
break;
}
else{
lessthan = true;
break;
}
}
}
if(lessthan) break;
if(jump){
// cout << "Jump" << '\n';
j = (j+1)%n;
continue;
}
if(!lessthan){
dupli.push_back(vec[j]);
sum += vec[j];
// cout << vec[j] << '\n';
}
count++;
j = (j+1)%n;
}
if(sum > max) max = sum;
}
cout << max;
} | # 2016245, 2024-09-28 11:27:37, PPPPPPPPP----PP-P-P- (65%)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
int main(){
int n ; cin >> n;
vector<int> vec;
for(int i=0;i<n;i++){
int x; cin >> x;
vec.push_back(x);
}
int max = 0;
for(int i=0;i<n;i++){ // each starting postion
int j = i;
int count = 0;
int sum = 0;
vector<int> dupli;
while(true){
// cout << count << '\n';
if(count == n) break;
bool lessthan = false;
for(int k=0;k<dupli.size();k++){
if(vec[j] < dupli[k]){
// cout << "less than " << vec[j] << '\n';
lessthan = true;
break;
}
}
if(lessthan) break;
if(!lessthan){
dupli.push_back(vec[j]);
sum += vec[j];
// cout << vec[j] << '\n';
}
count++;
j = (j+1)%n;
}
if(sum > max) max = sum;
}
// jump
for(int i=0;i<n;i++){ // each starting postion
int j = i;
int count = 0;
int sum = 0;
vector<int> dupli;
int cjump = 0;
while(true){
// cout << count << '\n';
if(count == n) break;
bool lessthan = false;
bool jump = false;
for(int k=0;k<dupli.size();k++){
if(vec[j] < dupli[k]){
// cout << "less than " << vec[j] << '\n';
if(cjump < 1){
jump = true;
cjump++;
break;
}
else{
lessthan = true;
break;
}
}
}
if(lessthan) break;
if(jump){
// cout << "Jump" << '\n';
j = (j+1)%n;
continue;
}
if(!lessthan){
dupli.push_back(vec[j]);
sum += vec[j];
// cout << vec[j] << '\n';
}
count++;
j = (j+1)%n;
}
if(sum > max) max = sum;
}
cout << max;
} |
# 2017730, 2024-09-28 14:02:20, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,mn=0;
cin>>n;
vector<int>m;
int ind;
for(int i=0;i<n;i++){
int a;
cin>>a;
m.push_back(a);
if(a<mn){
mn=a;
ind=i;
}
}
for(int i=0;i<n;i++){
m.push_back(m[i]);
}
for(int i=0;i<n;i++){
int c=i;
int sum=0;
int br=0;
while(1){
if(i+n==c){break;}
sum+=m[c];
//cout<<m[c]<<" ";
if(m[c]>m[c+1]){
if(m[c]>m[2+c]||br==1){
break;
}br=1;
c++;
}
c++;
}
//cout<<endl;
mn=max(sum,mn);
}
cout<<mn;
} | # 2017866, 2024-09-28 14:11:46, PPPPPPPP----PP-----P (55%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,mn=0;
cin>>n;
vector<int>m;
int ind;
for(int i=0;i<n;i++){
int a;
cin>>a;
m.push_back(a);
if(a<mn){
mn=a;
ind=i;
}
}
for(int i=0;i<n;i++){
m.push_back(m[i]);
}
for(int i=0;i<n;i++){
int c=i;
int sum=0;
int br=0;
while(1){
if(i+n==c){break;}
sum+=m[c];
// cout<<m[c]<<" ";
if(m[c]>m[c+1]){
if(m[c]>m[2+c]||br==1){
break;
}br=1;
c++;
}
else if(m[c+1]>m[c+2]&&m[c]<=m[c+2]){
c++;
if(br==1)break;
br=1;
}
c++;
}
//cout<<endl;
mn=max(sum,mn);
}
cout<<mn;
} | # 2018654, 2024-09-28 15:14:11, PPPPPPPP----PP-----P (55%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,mn=0;
cin>>n;
vector<int>m;
int ind;
for(int i=0;i<n;i++){
int a;
cin>>a;
m.push_back(a);
if(a<mn){
mn=a;
ind=i;
}
}
for(int i=0;i<n;i++){
m.push_back(m[i]);
}
for(int i=0;i<n;i++){
int c=i;
int sum=0;
int br=0;
while(1){
if(i+n==c){break;}
sum+=m[c];
// cout<<m[c]<<" ";
if(m[c]>m[c+1]){
if(m[c]>m[2+c]||br==1){
break;
}br=1;
c++;
}
else if(m[c+1]>m[c+2]&&m[c]<=m[c+2]){
c++;
if(br==1)break;
br=1;
}
c++;
}
//cout<<endl;
mn=max(sum,mn);
}
cout<<mn;
} | # 2018658, 2024-09-28 15:14:27, PPPPPPPPP----PP-P-P- (65%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,mn=0;
cin>>n;
vector<int>m;
int ind;
for(int i=0;i<n;i++){
int a;
cin>>a;
m.push_back(a);
if(a<mn){
mn=a;
ind=i;
}
}
for(int i=0;i<n;i++){
m.push_back(m[i]);
}
for(int i=0;i<n;i++){
int c=i;
int sum=0;
int br=0;
while(1){
if(i+n==c){break;}
sum+=m[c];
//cout<<m[c]<<" ";
if(m[c]>m[c+1]){
if(m[c]>m[2+c]||br==1){
break;
}br=1;
c++;
}
c++;
}
//cout<<endl;
mn=max(sum,mn);
}
cout<<mn;
} |
# 2017612, 2024-09-28 13:50:00, PPPPPPPPP----PP-P-P- (65%)
#include<iostream>
using namespace std;
int main(){
int n; cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
int mx = -1;
for(int i=0;i<n;i++){
int idx = i,cnt = 0,sum = arr[idx];
bool del = false;
while(cnt < n){
if(arr[idx%n] <= arr[(idx+1)%n]){
sum += arr[(idx+1)%n];
// cout << arr[idx%n] << " ";
// cout << arr[(idx+1)%n] << "\n";
}
else if(del == true) break;
else{
// cout << arr[idx%n] << " ";
// cout << arr[(idx+2)%n] << "\n";
if(arr[idx%n] <= arr[(idx+2)%n]){
sum += arr[(idx+2)%n];
}
else break;
del = true;
idx += 2;
cnt++;
continue;
}
cnt ++;
idx ++;
}
mx = max(mx,sum);
// cout << "sum : " << sum << "\n";
}
cout << mx;
return 0;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2017635, 2024-09-28 13:52:38, PPPPPPPPP----PP-P-P- (65%)
#include<iostream>
using namespace std;
int main(){
int n; cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
int mx = -1;
for(int i=0;i<n;i++){
int idx = i,cnt = 0,sum = arr[idx];
bool del = false;
while(cnt < n-1){
if(arr[idx%n] <= arr[(idx+1)%n]){
sum += arr[(idx+1)%n];
// cout << arr[idx%n] << " ";
// cout << arr[(idx+1)%n] << "\n";
}
else if(del == true) break;
else{
// cout << arr[idx%n] << " ";
// cout << arr[(idx+2)%n] << "\n";
if(arr[idx%n] <= arr[(idx+2)%n]){
sum += arr[(idx+2)%n];
}
else break;
del = true;
idx += 2;
cnt += 2;
continue;
}
cnt ++;
idx ++;
}
mx = max(mx,sum);
// cout << "sum : " << sum << "\n";
}
cout << mx;
return 0;
}
/*
7
6 7 5 9 5 8 3
*/ | # 2018507, 2024-09-28 15:06:01, PPPPPPPPP----PP-P-P- (65%)
#include<iostream>
using namespace std;
int main(){
long long int n; cin >> n;
long long int arr[n];
for(long long int i=0;i<n;i++) cin >> arr[i];
long long int mx = -1;
for(long long int i=0;i<n;i++){
long long int idx = i,cnt = 0,sum = arr[idx];
bool del = false;
while(cnt < n-1){
if(arr[idx%n] <= arr[(idx+1)%n]){
sum += arr[(idx+1)%n];
// cout << arr[idx%n] << " ";
// cout << arr[(idx+1)%n] << "\n";
}
else if(del == true) break;
else{
// cout << arr[idx%n] << " ";
// cout << arr[(idx+2)%n] << "\n";
if(arr[idx%n] <= arr[(idx+2)%n]){
sum += arr[(idx+2)%n];
}
else break;
del = true;
idx += 2;
cnt += 2;
continue;
}
cnt ++;
idx ++;
}
mx = max(mx,sum);
// cout << "sum : " << sum << "\n";
}
cout << mx;
return 0;
}
/*
7
6 7 5 9 5 8 3
*/ |
# 2018575, 2024-09-28 15:10:25, PP----PPP----------- (25%)
//ENG_EXAM_WEEK
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[n*2], b[n]={0};
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=n, j=0;i<n*2;i++, j++){
a[i] = a[j];
}
for(int i=0;i<n;i++){
int la = a[i];
b[i] = b[i] + a[i];
int cnt = 0;
for(int j=i+1;j<n*2;j++){
if(la<=a[j]){
b[i] = b[i] + a[j];
}else if(la>a[j]&&cnt==0){
cnt++;
continue;
}else if(la>a[j]){
break;
}
la = a[j];
}
}
int mx = b[0];
for(int i=0;i<n;i++){
if(b[i]>b[0]){
mx = b[i];
}
}
cout << mx << endl;
return 0;
} | # 2018816, 2024-09-28 15:19:30, -------------------- (0%)
//ENG_EXAM_WEEK
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[n*2], b[n]={0};
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=n, j=0;i<n*2;i++, j++){
a[i] = a[j];
}
for(int i=0;i<n;i++){
int la = a[i];
b[i] = b[i] + a[i];
int cnt = 0;
// int ccc = 0;
for(int j=i+1;j<n*2;j++){
// ccc++;
if(la<=a[j]){
b[i] = b[i] + a[j];
}else if(la>a[j]&&cnt==0){
cnt++;
continue;
}else if(la>a[j]){
break;
}
la = a[j];
}
}
int mx = b[0];
for(int i=0;i<n;i++){
cout << b[i] << endl;
if(b[i]>mx){
mx = b[i];
}
}
cout << mx << endl;
return 0;
} | # 2018830, 2024-09-28 15:19:51, PPPPPPPPP----PP-P-P- (65%)
//ENG_EXAM_WEEK
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[n*2], b[n]={0};
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=n, j=0;i<n*2;i++, j++){
a[i] = a[j];
}
for(int i=0;i<n;i++){
int la = a[i];
b[i] = b[i] + a[i];
int cnt = 0;
// int ccc = 0;
for(int j=i+1;j<n*2;j++){
// ccc++;
if(la<=a[j]){
b[i] = b[i] + a[j];
}else if(la>a[j]&&cnt==0){
cnt++;
continue;
}else if(la>a[j]){
break;
}
la = a[j];
}
}
int mx = b[0];
for(int i=0;i<n;i++){
// cout << b[i] << endl;
if(b[i]>mx){
mx = b[i];
}
}
cout << mx << endl;
return 0;
} |
# 2016144, 2024-09-28 11:17:08, PPPPPPPPP----PP-P-P- (65%)
#include <iostream>
using namespace std ;
int main() {
int n ; cin >> n ;
int ball[n * n] ;
for(int i = 0 ; i < n ; i++) {
cin >> ball[i] ;
ball[i + n] = ball[i] ;
}
int max = 0 ;
int total = 0 ;
for(int i = 0 ; i < n ; i++) {
bool skip = true ;
total = ball[i] ;
for(int j = 1 ; j < n ; j++) {
if(ball[i + j - 1] > ball[i + j] && skip) {
skip = false ;
j++ ;
if(ball[i + j - 2] > ball[i + j]) {
break ;
}
else if(ball[i + j - 2] <= ball[i + j]) {
total += ball[i + j] ;
continue ;
}
}
else if(ball[i + j - 1] > ball[i + j]) {
break ;
}
else {
total += ball[i + j] ;
}
}
if(total > max) {
max = total ;
}
total = 0 ;
}
cout << max ;
return 0 ;
} | # 2016229, 2024-09-28 11:25:43, PPPPPPPPP----PP-P-P- (65%)
#include <iostream>
using namespace std ;
int main() {
int n ; cin >> n ;
int ball[n * n] ;
for(int i = 0 ; i < n ; i++) {
cin >> ball[i] ;
ball[i + n] = ball[i] ;
}
long long int max = 0 ;
long long int total = 0 ;
for(int i = 0 ; i < n ; i++) {
//cout << ball[i] << " " ;//
bool skip = true ;
total = ball[i] ;
for(int j = 1 ; j < n ; j++) {
//cout << ball[i + j] << " " ;
if(ball[i + j - 1] > ball[i + j] && skip) {
skip = false ;
j++ ;
if(ball[i + j - 2] > ball[i + j]) {
break ;
}
else if(ball[i + j - 2] <= ball[i + j]) {
total += ball[i + j] ;
continue ;
}
}
else if(ball[i + j - 1] > ball[i + j]) {
break ;
}
else {
//cout << "* " ;//
total += ball[i + j] ;
}
}
if(total > max) {
max = total ;
}
//cout << "= " << total ;//
total = 0 ;
//cout << endl ;//
}
cout << max ;
return 0 ;
} | # 2016398, 2024-09-28 11:39:52, PPPPPPPPP----PP-P-P- (65%)
#include <iostream>
using namespace std ;
int main() {
int n ; cin >> n ;
int ball[n * n] ;
for(int i = 0 ; i < n ; i++) {
cin >> ball[i] ;
ball[i + n] = ball[i] ;
}
int max = 0 ;
int total = 0 ;
for(int i = 0 ; i < n ; i++) {
bool skip = true ;
total = ball[i] ;
for(int j = 1 ; j < n ; j++) {
if(ball[i + j - 1] > ball[i + j] && skip) {
skip = false ;
j++ ;
if(ball[i + j - 2] > ball[i + j]) {
break ;
}
else {
total += ball[i + j] ;
continue ;
}
}
else if(ball[i + j - 1] > ball[i + j]) {
break ;
}
else {
total += ball[i + j] ;
}
}
if(total > max) {
max = total ;
}
total = 0 ;
}
cout << max << endl ;
return 0 ;
} |
# 2017531, 2024-09-28 13:38:47, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0,max=-1e7,ai,chk;
vector<int> a;
cin>>n;
for(int i=0;i<n;i++){
cin>>ai;
a.push_back(ai);
}
for(int i=0;i<n;i++){
chk=i;
for(int j=0;j<n;j++){
if(chk>n){
chk=0;
}
if(a[chk]>=a[chk-1]) sum+=a[j];
else if(a[chk]<a[chk-1]){
if(max<sum){
max=sum;
sum=0;
}
}
chk++;
}
if(max<sum){
max=sum;
}
sum=0;
}
cout<<max;
return 0;
} | # 2017600, 2024-09-28 13:48:30, --P-P------------P-- (15%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0,max=-1e7,ai,chk;
vector<int> a;
cin>>n;
for(int i=0;i<n;i++){
cin>>ai;
a.push_back(ai);
}
for(int i=0;i<n;i++){
chk=i;
for(int j=0;j<n;j++){
if(chk>=n){
chk=0;
}
if(a[chk]>=a[chk-1]) sum+=a[chk];
else if(a[chk]<a[chk-1]){
if(max<sum){
max=sum;
sum=0;
}
sum=a[chk];
}
chk++;
}
if(max<sum){
max=sum;
}
sum=0;
}
cout<<max;
return 0;
} | # 2017872, 2024-09-28 14:12:09, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0,max=-1e7,ai,chk;
vector<int> a;
cin>>n;
for(int i=0;i<n;i++){
cin>>ai;
a.push_back(ai);
}
for(int i=0;i<n;i++){
chk=i;
for(int j=0;j<n;j++){
if(chk==i) continue;
if(chk>=n){
chk=0;
}
if(a[chk]>=a[chk-1]) sum+=a[chk];
else if(a[chk]<a[chk-1]){
if(max<sum){
max=sum;
sum=0;
}
sum=a[chk];
}
chk++;
}
if(max<sum){
max=sum;
}
sum=0;
}
cout<<max;
return 0;
} | # 2017878, 2024-09-28 14:12:27, --P-P------------P-- (15%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0,max=-1e7,ai,chk;
vector<int> a;
cin>>n;
for(int i=0;i<n;i++){
cin>>ai;
a.push_back(ai);
}
for(int i=0;i<n;i++){
chk=i;
for(int j=0;j<n;j++){
if(chk>=n){
chk=0;
}
if(a[chk]>=a[chk-1]) sum+=a[chk];
else if(a[chk]<a[chk-1]){
if(max<sum){
max=sum;
sum=0;
}
sum=a[chk];
}
chk++;
}
if(max<sum){
max=sum;
}
sum=0;
}
cout<<max;
return 0;
} | # 2017972, 2024-09-28 14:21:50, --P-P------------P-- (15%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
for(int j=0;j<n;j++){
if(cur==n) cur=0;
if(a[cur]>=a[cur-1]) sum+=a[cur];
else{
if(sum>max) max=sum;
sum=a[cur];
}
cur++;
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018026, 2024-09-28 14:25:42, --P----------------- (5%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
for(int z=0;z<n;z++){
for(int i=0;i<n;i++){
cur=i;
for(int j=0;j<n;j++){
if(cur==n) cur=0;
if(cur==z) continue;
if(a[cur]>=a[cur-1]) sum+=a[cur];
else{
if(sum>max) max=sum;
sum=a[cur];
}
cur++;
}
if(sum>max) max=sum;
sum=0;
}
}
cout<<max;
return 0;
} | # 2018032, 2024-09-28 14:26:02, --P-P------------P-- (15%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0,max=-1e7,ai,chk;
vector<int> a;
cin>>n;
for(int i=0;i<n;i++){
cin>>ai;
a.push_back(ai);
}
for(int i=0;i<n;i++){
chk=i;
for(int j=0;j<n;j++){
if(chk>=n){
chk=0;
}
if(a[chk]>=a[chk-1]) sum+=a[chk];
else if(a[chk]<a[chk-1]){
if(max<sum){
max=sum;
sum=0;
}
sum=a[chk];
}
chk++;
}
if(max<sum){
max=sum;
}
sum=0;
}
cout<<max;
return 0;
} | # 2018155, 2024-09-28 14:39:21, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,past;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
for(int j=0;j<n;j++){
if(cur==n){
cur=0;
past=n-1;
}
if(a[cur]>=a[past]) sum+=a[cur];
else{
if(sum>max) max=sum;
sum=a[cur];
}
cur++;
past=cur-1;
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018293, 2024-09-28 14:50:30, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur==n) cur=0;
if(next>=n) next=0;
if(a[cur]<=a[next]) sum+=a[cur];
else{
if(sum>max) max=sum;
sum=a[cur];
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018322, 2024-09-28 14:53:06, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur==n) cur=0;
if(next>=n) next=0;
if(a[cur]<=a[next]) sum+=a[cur];
else{
sum+=a[cur];
if(sum>max) max=sum;
sum=0;
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018528, 2024-09-28 15:07:37, -----------------P-- (5%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next,del;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur==n) cur=0;
if(next>=n) next=0;
if(a[cur]<=a[next]) sum+=a[cur];
else{
sum+=a[cur];
if(sum>max) max=sum;
sum=0;
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j) continue;
if(a[i]<=a[i+1]) sum+=a[i];
else{
sum+=a[i];
if(sum>max) max=sum;
sum=0;
}
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018535, 2024-09-28 15:08:11, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur==n) cur=0;
if(next>=n) next=0;
if(a[cur]<=a[next]) sum+=a[cur];
else{
sum+=a[cur];
if(sum>max) max=sum;
sum=0;
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018610, 2024-09-28 15:12:19, ---------PPPP--P---P (30%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next,del;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
// for(int i=0;i<n;i++){
// cur=i;
// next=i+1;
// for(int j=0;j<n;j++){
// if(cur==n) cur=0;
// if(next>=n) next=0;
// if(a[cur]<=a[next]) sum+=a[cur];
// else{
// sum+=a[cur];
// if(sum>max) max=sum;
// sum=0;
// }
// cur++;
// next++;
// }
// if(sum>max) max=sum;
// sum=0;
// }
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j) continue;
if(a[j]<=a[j+1]) sum+=a[j];
else{
sum+=a[j];
if(sum>max) max=sum;
sum=0;
}
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018624, 2024-09-28 15:12:53, ----P----PPPP--P-P-P (40%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next,del;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur==n) cur=0;
if(next>=n) next=0;
if(a[cur]<=a[next]) sum+=a[cur];
else{
sum+=a[cur];
if(sum>max) max=sum;
sum=0;
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j) continue;
if(a[j]<=a[j+1]) sum+=a[j];
else{
sum+=a[j];
if(sum>max) max=sum;
sum=0;
}
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018659, 2024-09-28 15:14:30, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur==n) cur=0;
if(next>=n) next=0;
if(a[cur]<=a[next]) sum+=a[cur];
else{
sum+=a[cur];
if(sum>max) max=sum;
sum=0;
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018694, 2024-09-28 15:15:52, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next,del;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur>=n) cur=0;
if(next>=n) next=0;
if(cur==j) continue;
if(a[cur]<=a[next]) sum+=a[cur];
else{
sum+=a[cur];
if(sum>max) max=sum;
sum=0;
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// if(i==j) continue;
// if(a[j]<=a[j+1]) sum+=a[j];
// else{
// sum+=a[j];
// if(sum>max) max=sum;
// sum=0;
// }
// }
// if(sum>max) max=sum;
// sum=0;
// }
cout<<max;
return 0;
} | # 2018797, 2024-09-28 15:19:01, ---------PPPP--P---P (30%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next,del;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
// for(int i=0;i<n;i++){
// cur=i;
// next=i+1;
// for(int j=0;j<n;j++){
// if(cur>=n) cur=0;
// if(next>=n) next=0;
// if(cur==j) continue;
// if(a[cur]<=a[next]) sum+=a[cur];
// else{
// sum+=a[cur];
// if(sum>max) max=sum;
// sum=0;
// }
// cur++;
// next++;
// }
// if(sum>max) max=sum;
// sum=0;
// }
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j) continue;
if(a[j]<=a[j+1]) sum+=a[j];
else{
sum+=a[j];
if(sum>max) max=sum;
sum=0;
}
}
if(sum>max) max=sum;
sum=0;
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(a[j]<=a[j+1]) sum+=a[j];
else{
sum+=a[j];
if(sum>max) max=sum;
sum=0;
}
}
if(sum>max) max=sum;
sum=0;
}
cout<<max;
return 0;
} | # 2018825, 2024-09-28 15:19:43, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a;
int n,in,sum,max=-1e7,cur,next,del;
cin>>n;
for(int i=0;i<n;i++){
cin>>in;
a.push_back(in);
}
//startpoint
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur>=n) cur=0;
if(next>=n) next=0;
if(cur==j) continue;
if(a[cur]<=a[next]) sum+=a[cur];
else{
sum+=a[cur];
if(sum>max) max=sum;
sum=0;
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
for(int i=0;i<n;i++){
cur=i;
next=i+1;
for(int j=0;j<n;j++){
if(cur>=n) cur=0;
if(next>=n) next=0;
if(a[cur]<=a[next]) sum+=a[cur];
else{
sum+=a[cur];
if(sum>max) max=sum;
sum=0;
}
cur++;
next++;
}
if(sum>max) max=sum;
sum=0;
}
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// if(i==j) continue;
// if(a[j]<=a[j+1]) sum+=a[j];
// else{
// sum+=a[j];
// if(sum>max) max=sum;
// sum=0;
// }
// }
// if(sum>max) max=sum;
// sum=0;
// }
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// if(a[j]<=a[j+1]) sum+=a[j];
// else{
// sum+=a[j];
// if(sum>max) max=sum;
// sum=0;
// }
// }
// if(sum>max) max=sum;
// sum=0;
// }
cout<<max;
return 0;
} |
# 2017473, 2024-09-28 13:32:12, ---------x---------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int ip[n], nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
for(int i=0; i < 2*n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1]+k) break;
else sum += nums[i+k];
}
if(sum > max) max = sum;
}
for(int i=0; i < 2*n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
if((nums[i+k] > nums[i+1+k]) && check == 0){
i++;
k--;
check=1;
}
else sum += nums[i+k];
}
if(sum > max) max = sum;
}
cout << max;
return 0;
} | # 2017511, 2024-09-28 13:36:41, ----P--------------- (5%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
for(int i=0; i < 2*n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1]+k) break;
else sum += nums[i+k];
}
if(sum > max) max = sum;
}
for(int i=0; i < 2*n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
if((nums[i+k] > nums[i+1+k]) && check == 0){
i++;
k--;
check=1;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
break;
}
else sum += nums[i+k];
}
if(sum > max) max = sum;
}
cout << max;
return 0;
} | # 2017883, 2024-09-28 14:12:40, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;
/*for(int i=0; i < 2*n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) break;
else{
sum = sum + nums[i+k];
cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
cout << "m" << max << endl;
}*/
for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
cout << "m " << max << endl;
}
cout << "end" << endl;
}
cout << max;
return 0;
} | # 2018323, 2024-09-28 14:53:15, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;
for(int i=0; i < 2*n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) break;
else{
sum = sum + nums[i+k];
cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
cout << "m" << max << endl;
}
/*for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
cout << "m " << max << endl;
}
cout << "end" << endl;
}*/
cout << max;
return 0;
} | # 2018349, 2024-09-28 14:54:46, Compilation error (0%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) break;
else{
sum = sum + nums[i+k];
cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
cout << "m" << max << endl;
}
/**for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
cout << "m " << max << endl;
}
cout << "end" << endl;
}**/
cout << max;
return 0;
}#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) break;
else{
sum = sum + nums[i+k];
cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
cout << "m" << max << endl;
}
/**for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
cout << "m " << max << endl;
}
cout << "end" << endl;
}**/
cout << max;
return 0;
} | # 2018378, 2024-09-28 14:56:43, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
/*for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;*/
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) break;
else{
sum = sum + nums[i+k];
//cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
// cout << "m" << max << endl;
}
/*for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
cout << "m " << max << endl;
}
cout << "end" << endl;
}*/
cout << max;
return 0;
} | # 2018399, 2024-09-28 14:58:02, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
/*for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;*/
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) break;
else{
sum = sum + nums[i+k];
//cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
// cout << "m" << max << endl;
}
for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
//cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
//cout << "m " << max << endl;
}
//cout << "end" << endl;
}
cout << max;
return 0;
} | # 2018420, 2024-09-28 14:59:55, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
/*for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;*/
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) {
sum = sum + nums[i+k];
break;
}
else{
sum = sum + nums[i+k];
//cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
// cout << "m" << max << endl;
}
/**for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
//cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
//cout << "m " << max << endl;
}
//cout << "end" << endl;
}*/
cout << max;
return 0;
} | # 2018429, 2024-09-28 15:00:56, Compilation error (0%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
/*for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;*/
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) {
sum = sum + nums[i+k];
break;
}
else{
sum = sum + nums[i+k];
//cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
// cout << "m" << max << endl;
}
for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
//cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
//cout << "m " << max << endl;
}
//cout << "end" << endl;
}
cout << max;
return 0;
}#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
/*for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;*/
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) {
sum = sum + nums[i+k];
break;
}
else{
sum = sum + nums[i+k];
//cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
// cout << "m" << max << endl;
}
for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
//cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
//cout << "m " << max << endl;
}
//cout << "end" << endl;
}
cout << max;
return 0;
} | # 2018439, 2024-09-28 15:01:36, Compilation error (0%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
/*for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;*/
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) {
sum = sum + nums[i+k];
break;
}
else{
sum = sum + nums[i+k];
//cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
// cout << "m" << max << endl;
}
for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
//cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
//cout << "m " << max << endl;
}
//cout << "end" << endl;
}
cout << max;
return 0;
}#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
/*for(int i=0; i < 2*n; i++){
cout << nums[i] << " ";
}
cout << endl;*/
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) {
sum = sum + nums[i+k];
break;
}
else{
sum = sum + nums[i+k];
//cout << "s" << sum << endl;
}
}
if(sum > max) max = sum;
// cout << "m" << max << endl;
}
for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++){
cout << "n " << nums[i+k] << " ";
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
//cout << endl << "s " << sum << endl;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
break;
}
else{
sum += nums[i+k];
//cout << endl << "s " << sum << endl;
}
}
if(sum > max){
max = sum;
//cout << "m " << max << endl;
}
//cout << "end" << endl;
}
cout << max;
return 0;
} | # 2018479, 2024-09-28 15:03:31, --PPPP-----------P-- (25%)
#include <iostream>
using namespace std;
int main(){
int n, max=0, sum = 0, check=0;
cin >> n;
int nums[2*n];
for(int i=0; i < n; i++){
cin >> nums[i];
nums[i+n] = nums[i];
}
for(int i=0; i < n; i++){
sum = 0;
for(int k=0; k < n; k++){
if(nums[i+k] > nums[i+1+k]) {
sum = sum + nums[i+k];
break;
}
else{
sum = sum + nums[i+k];
}
}
if(sum > max) max = sum;
}
for(int i=0; i < n; i++){
sum = 0;
check = 0;
for(int k=0; k < n; k++)
if((nums[i+k] > nums[i+1+k]) && check == 0){
sum += nums[i+k];
k++;
check=1;
}
else if((nums[i+k] > nums[i+1+k]) && check > 0){
sum += nums[i+k];
break;
}
else{
sum += nums[i+k];
}
}
if(sum > max){
max = sum;
}
cout << max;
return 0;
} |
# 2016083, 2024-09-28 11:11:54, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int N;
int a[N];
for(int i = 0 ; i < N ; i++){
cin >> a[i];
}
int total = 0 ;
for(int i = 0 ; i < N ; i++){
if(a[i] <= a[i+1]){
total += a[i];
}
}
cout << total;
} | # 2016098, 2024-09-28 11:13:00, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[N];
for(int i = 0 ; i < N ; i++){
cin >> a[i];
}
int total = 0 ;
for(int i = 0 ; i < N ; i++){
if(a[i] <= a[i+1]){
total += a[i];
}
}
cout << total;
} | # 2016121, 2024-09-28 11:15:36, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[N];
for(int i = 0 ; i < N ; i++){
cin >> a[i];
}
int total = 0 ;
for(int i = 0 ; i < N ; i++){
if(a[i] <= a[i+1]){
total += a[i];
break;
}
}
cout << total;
} | # 2016146, 2024-09-28 11:17:42, PP----PP------------ (20%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[N];
for(int i = 0 ; i < N ; i++){
cin >> a[i];
}
int total = 0 ;
for(int i = 0 ; i < N ; i++){
total += a[i];
if(a[i] > a[i+1]){
break;
}
}
cout << total;
} | # 2016418, 2024-09-28 11:41:09, PP----PP------------ (20%)
#include <iostream>
using namespace std;
int TOTAL(int x[] , int N){
int sum = 0;
for(int i = 0 ; i < N ; i++){
sum += x[i];
if(x[i] > x[i+1]){
break;
}
}
return sum;
}
int main(){
int N;
cin >> N;
int first = 0;
int a[N];
for(int i = 0 ; i < N ; i++){
cin >> a[i];
}
first = a[0];
int total = 0 ;
int max = 0;
total = TOTAL(a , N);
max = total;
// for(int x = 0 ; x < N ; x++){
for(int i = 0 ; i < N ; i++){
a[i] = a[i+1];
}
a[N-1] = first;
total = TOTAL(a , N);
if(total > max){
max = total;
}
//}
/*for(int i = 0 ; i < N ; i++){
cout << a[i] << " ";
}*/
cout << max;
//3 6 7 5 9 5 8 3
} | # 2016447, 2024-09-28 11:42:28, PP----PP------------ (20%)
#include <iostream>
using namespace std;
int TOTAL(int x[] , int N){
int sum = 0;
for(int i = 0 ; i < N ; i++){
sum += x[i];
if(x[i] > x[i+1]){
break;
}
}
return sum;
}
int main(){
int N;
cin >> N;
int first = 0;
int a[N];
for(int i = 0 ; i < N ; i++){
cin >> a[i];
}
first = a[0];
int total = 0 ;
int max = 0;
total = TOTAL(a , N);
max = total;
// for(int x = 0 ; x < N ; x++){
for(int i = 1 ; i < N ; i++){
a[i] = a[i+1];
}
a[N-1] = first;
total = TOTAL(a , N);
if(total > max){
max = total;
}
//}
/*for(int i = 0 ; i < N ; i++){
cout << a[i] << " ";
}*/
cout << max;
//3 6 7 5 9 5 8 3
} | # 2016500, 2024-09-28 11:45:40, -------------------- (0%)
#include <iostream>
using namespace std;
int TOTAL(int x[] , int N){
int sum = 0;
for(int i = 0 ; i < N ; i++){
sum += x[i];
if(x[i] > x[i+1]){
break;
}
}
return sum;
}
int main(){
int N;
cin >> N;
int first = 0;
int a[N];
for(int i = 0 ; i < N ; i++){
cin >> a[i];
}
first = a[0];
int total = 0 ;
int max = 0;
total = TOTAL(a , N);
max = total;
for(int x = 0 ; x < N ; x++){
for(int i = 1 ; i < N ; i++){
a[i] = a[i+1];
}
a[N-1] = first;
total = TOTAL(a , N);
if(total > max){
max = total;
}
}
/*for(int i = 0 ; i < N ; i++){
cout << a[i] << " ";
}*/
cout << max;
//3 6 7 5 9 5 8 3
} | # 2016649, 2024-09-28 11:54:20, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int TOTAL(int x[] , int N){
int sum = 0;
for(int i = 0 ; i < N ; i++){
sum += x[i];
if(x[i] > x[i+1]){
break;
}
}
return sum;
}
int main(){
int N;
cin >> N;
int first = 0;
int a[N];
int count = 0;
for(int i = 0 ; i < N ; i++){
cin >> a[i];
}
first = a[0];
int total = 0 ;
int max = 0;
total = TOTAL(a , N);
max = total;
for(int x = 0 ; x < N ; x++){
for(int i = 0 ; i < N ; i++){
a[i] = a[i+1];
}
a[N-1] = first;
first = a[0];
/*cout << endl;
for(int j = 0 ; j < N ; j++){
cout << a[j] << " ";
}*/
total = TOTAL(a , N);
if(total > max){
count++;
max = total;
}
}
/*for(int i = 0 ; i < N ; i++){
cout << a[i] << " ";
}*/
cout << max<<endl;
//cout << count;
//3 6 7 5 9 5 8
} |
# 2017796, 2024-09-28 14:06:54, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int sum=0;
vector<int> ball(n);
vector<int> s_ball(0);
for (int i=0;i<n;i++) {
cin >> ball[i];
}
for (int i=0;i<n;i+=2) {
for (int j=1;j<n;j++) {
if (ball[i] <= ball[j]) {
sum += ball[i];
sum += ball[j];
} else {
continue;
}
if (j == n-1) {
if (sum > ball[1]) {
s_ball.push_back(sum);
sum = 0 ;
} else {
sum += ball[j];
}
}
if (sum > ball[j+1]) {
s_ball.push_back(sum);
sum = 0 ;
} else {
sum += ball[j];
}
}
}
int max = s_ball[0];
for (int i = 0;i<s_ball.size();i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
cout << max;
// for (int i = 0;i<s_ball.size();i++) {
// cout << s_ball[i] << " ";
// }
} | # 2017827, 2024-09-28 14:09:09, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int sum=0;
vector<int> ball(n);
vector<int> s_ball(0);
for (int i=0;i<n;i++) {
cin >> ball[i];
}
for (int i=0;i<n;i++) {
for (int j=1;j<n;j++) {
if (ball[i] <= ball[j]) {
sum += ball[i];
sum += ball[j];
} else {
continue;
}
if (j == n-1) {
if (sum > ball[1]) {
s_ball.push_back(sum);
sum = 0 ;
} else {
sum += ball[j];
}
}
if (sum > ball[j+1]) {
s_ball.push_back(sum);
sum = 0 ;
} else {
sum += ball[j];
}
}
}
int max = s_ball[0];
for (int i = 0;i<s_ball.size();i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
cout << max;
// for (int i = 0;i<s_ball.size();i++) {
// cout << s_ball[i] << " ";
// }
} | # 2018337, 2024-09-28 14:54:00, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int sum=0;
int index =0;
int size=0;
vector<int> ball(n);
vector<int> s_ball(0);
for (int i=0;i<n;i++) {
cin >> ball[i];
}
while (index != n) {
sum += ball[index];
for (int i=0+index;i<n;i++) {
if (i <n-1){
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (i == n-1) {
if (ball[i] <= ball[0]) {
sum += ball[0];
for (int i=0;i<n;i++) {
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
int max = s_ball[0];
// for (int i = 0;i<s_ball.size();i++) {
// cout << s_ball[i] << " ";
// }
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
cout << max;
// for (int i=0;i<n;i++) {
// for (int j=1;j<n;j++) {
// if (ball[i] <= ball[j]) {
// sum += ball[j];
// } else {
// sum += ball[j];
// s_ball.push_back(sum);
// sum = 0 ;
// }
// if (j == n-1) {
// if (sum > ball[1]) {
// sum += ball[j+1];
// s_ball.push_back(sum);
// sum = 0 ;
// } else {
// sum += ball[j+1];
// }
// } else {
// if (sum > ball[j+1]) {
// sum += ball[j+1];
// s_ball.push_back(sum);
// sum = 0 ;
// } else {
// sum += ball[j+1];
// }
// }
// }
// }
// int max = s_ball[0];
// for (int i = 0;i<s_ball.size();i++) {
// if (max < s_ball[i]) {
// max = s_ball[i];
// }
// }
// cout << max;
// for (int i = 0;i<s_ball.size();i++) {
// cout << s_ball[i] << " ";
// }
} | # 2018472, 2024-09-28 15:02:59, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int sum=0;
int index =0;
int size=0;
vector<int> ball(n);
vector<int> s_ball(0);
for (int i=0;i<n;i++) {
cin >> ball[i];
}
while (index != n) {
sum += ball[index];
for (int i=0+index;i<n;i++) {
if (i <n-1){
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (i == n-1) {
if (ball[i] <= ball[0]) {
sum += ball[0];
for (int i=0;i<n;i++) {
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
int max = s_ball[0];
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
index =0;
sum =0;
for (int i=0;i<n;i++) {
ball.erase(ball.begin()+i,ball.begin()+i+1);
while (index != n-1) {
sum += ball[index];
for (int i=0+index;i<n-1;i++) {
if (i <n-2){
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (i == n-2) {
if (ball[i] <= ball[0]) {
sum += ball[0];
for (int i=0;i<n-1;i++) {
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
}
cout << max;
// for (int i=0;i<n-1;i++) {
// cout << ball[i];
// }
// for (int i=0;i<n;i++) {
// ball.erase(s_ball.begin()+i,1);
// }
} | # 2018628, 2024-09-28 15:12:59, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int sum=0;
int index =0;
int size=0;
vector<int> ball(n);
vector<int> s_ball(0);
for (int i=0;i<n;i++) {
cin >> ball[i];
}
while (index != n) {
sum += ball[index];
for (int i=0+index;i<n;i++) {
if (i <n-1){
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (i == n-1) {
if (ball[i] <= ball[0]) {
sum += ball[0];
for (int i=0;i<n;i++) {
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
int max = s_ball[0];
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
index =0;
sum =0;
for (int i=0;i<n-1;i++) {
ball.erase(ball.begin()+i,ball.begin()+i+1);
while (index != n-1) {
sum += ball[index];
for (int j=0+index;j<n-1;j++) {
if (j < n-2){
if (ball[j] <= ball[j+1]) {
sum += ball[j+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (j == n-2) {
if (ball[j] <= ball[0]) {
sum += ball[0];
for (int j=0;j<n-1;j++) {
if (ball[j] <= ball[j+1]) {
sum += ball[j+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
}
for (int i=0;i<size;i++) {
cout << s_ball[i] << " ";
}
cout << max;
// for (int i=0;i<n-1;i++) {
// cout << ball[i];
// }
// for (int i=0;i<n;i++) {
// ball.erase(s_ball.begin()+i,1);
// }
} | # 2018769, 2024-09-28 15:18:16, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int sum=0;
int index =0;
int size=0;
vector<int> ball(n);
vector<int> s_ball(0);
for (int i=0;i<n;i++) {
cin >> ball[i];
}
while (index != n) {
sum += ball[index];
for (int i=0+index;i<n;i++) {
if (i <n-1){
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (i == n-1) {
if (ball[i] <= ball[0]) {
sum += ball[0];
for (int i=0;i<n;i++) {
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
int max = s_ball[0];
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
index =0;
sum =0;
for (int i=0;i<n-1;i++) {
ball.erase(ball.begin()+i,ball.begin()+i+1);
while (index != n-1) {
sum += ball[index];
for (int j=0+index;j<n-1;j++) {
if (j < n-2){
if (ball[j] <= ball[j+1]) {
sum += ball[j+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (j == n-2) {
if (ball[j] <= ball[0]) {
sum += ball[0];
for (int j=0;j<n-1;j++) {
if (ball[j] <= ball[j+1]) {
sum += ball[j+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
}
cout << max;
// for (int i=0;i<n-1;i++) {
// cout << ball[i];
// }
// for (int i=0;i<n;i++) {
// ball.erase(s_ball.begin()+i,1);
// }
} | # 2018799, 2024-09-28 15:19:02, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int sum=0;
int index =0;
int size=0;
vector<int> ball(n);
vector<int> s_ball(0);
for (int i=0;i<n;i++) {
cin >> ball[i];
}
while (index != n) {
sum += ball[index];
for (int i=0+index;i<n;i++) {
if (i <n-1){
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (i == n-1) {
if (ball[i] <= ball[0]) {
sum += ball[0];
for (int i=0;i<n;i++) {
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
int max = s_ball[0];
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
cout << max;
// for (int i=0;i<n-1;i++) {
// cout << ball[i];
// }
// for (int i=0;i<n;i++) {
// ball.erase(s_ball.begin()+i,1);
// }
} | # 2018824, 2024-09-28 15:19:43, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int sum=0;
int index =0;
int size=0;
vector<int> ball(n);
vector<int> s_ball(0);
for (int i=0;i<n;i++) {
cin >> ball[i];
}
while (index != n) {
sum += ball[index];
for (int i=0+index;i<n;i++) {
if (i <n-1){
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (i == n-1) {
if (ball[i] <= ball[0]) {
sum += ball[0];
for (int i=0;i<n;i++) {
if (ball[i] <= ball[i+1]) {
sum += ball[i+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
index =0;
sum =0;
for (int i=0;i<n-1;i++) {
ball.erase(ball.begin()+i,ball.begin()+i+1);
while (index != n-1) {
sum += ball[index];
for (int j=0+index;j<n-1;j++) {
if (j < n-2){
if (ball[j] <= ball[j+1]) {
sum += ball[j+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
if (j == n-2) {
if (ball[j] <= ball[0]) {
sum += ball[0];
for (int j=0;j<n-1;j++) {
if (ball[j] <= ball[j+1]) {
sum += ball[j+1];
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
} else {
s_ball.push_back(sum);
size++;
sum=0;
break;
}
}
}
index++;
}
int max = s_ball[0];
for (int i = 0;i<size;i++) {
if (max < s_ball[i]) {
max = s_ball[i];
}
}
}
cout << max;
// for (int i=0;i<n-1;i++) {
// cout << ball[i];
// }
// for (int i=0;i<n;i++) {
// ball.erase(s_ball.begin()+i,1);
// }
} |
# 2016285, 2024-09-28 11:31:32, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>> n;
int ball[n], path[n];
memset(path, 0, sizeof(path));
for(int i=0; i<n; i++){
cin>> ball[i];
}
int mx=0;
for(int i=0; i<n; i++){
memset(path, 0, sizeof(path));
int pass=0, count=0, j=i;
while(!path[j]){
path[j]++;
//if(j<n-1){
// if(ball[j]>ball[j+1] && !path[j+1] && pass) break;
// if(ball[j]>ball[j+1] && !path[j+1]){ pass++; j+=2; j%=n; continue; }
//}
//else{
// if(ball[j]>ball[0] && !path[n-1] && pass) break;
// if(ball[j]>ball[0] && !path[n-1]){ pass++; j++; continue; }
//}
count+=ball[j];
j++;
j%=n;
}
//cout<< i<< " "<< count<< "\n";
mx=max(mx, count);
}
cout<< mx;
return 0;
} | # 2016431, 2024-09-28 11:41:41, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>> n;
int ball[n], path[n];
memset(path, 0, sizeof(path));
for(int i=0; i<n; i++){
cin>> ball[i];
}
int mx=0;
for(int i=0; i<n; i++){
memset(path, 0, sizeof(path));
int pass=0, count=0, j=i;
while(!path[j]){
path[j]++;
count+=ball[j];
j++;
j%=n;
if(j>0){
if(ball[j]<ball[j-1]){break;}
}
else{
if(ball[j]<ball[n-1]){break;}
}
}
cout<< i<< " "<< count<< "\n";
mx=max(mx, count);
}
cout<< mx;
return 0;
} | # 2016448, 2024-09-28 11:42:28, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>> n;
int ball[n], path[n];
memset(path, 0, sizeof(path));
for(int i=0; i<n; i++){
cin>> ball[i];
}
int mx=0;
for(int i=0; i<n; i++){
memset(path, 0, sizeof(path));
int pass=0, count=0, j=i;
while(!path[j]){
path[j]++;
count+=ball[j];
j++;
j%=n;
if(j>0){
if(ball[j]<ball[j-1]){break;}
}
else{
if(ball[j]<ball[n-1]){break;}
}
}
//cout<< i<< " "<< count<< "\n";
mx=max(mx, count);
}
cout<< mx;
return 0;
} | # 2016533, 2024-09-28 11:48:22, ----P---P----PP-PPP- (35%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>> n;
int ball[n], path[n];
memset(path, 0, sizeof(path));
for(int i=0; i<n; i++){
cin>> ball[i];
}
int mx=0;
for(int i=0; i<n; i++){
memset(path, 0, sizeof(path));
int pass=0, count=0, j=i;
while(!path[j]){
path[j]++;
count+=ball[j];
j++;
j%=n;
if(j>0){
if(ball[j]<ball[j-1] && !pass){j++; j%=n; pass++;}
if(ball[j]<ball[j-1]){break;}
}
else{
if(ball[j]<ball[n-1] && !pass){j++; j%=n; pass++;}
if(ball[j]<ball[n-1]){break;}
}
}
//cout<< i<< " "<< count<< "\n";
mx=max(mx, count);
}
cout<< mx;
return 0;
} | # 2016667, 2024-09-28 11:55:11, ----P---P-----P-PPP- (30%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>> n;
int ball[n], path[n];
memset(path, 0, sizeof(path));
for(int i=0; i<n; i++){
cin>> ball[i];
}
int mx=0;
for(int i=0; i<n; i++){
memset(path, 0, sizeof(path));
int pass=0, count=0, j=i;
while(!path[j]){
path[j]++;
count+=ball[j];
j++;
j%=n;
if(j>0){
if(ball[j]<ball[j-1] && !pass){j++; j%=n; pass++; continue;}
if(ball[j]<ball[j-1]){break;}
}
else{
if(ball[j]<ball[n-1] && !pass){j++; j%=n; pass++; continue;}
if(ball[j]<ball[n-1]){break;}
}
}
//cout<< i<< " "<< count<< "\n";
mx=max(mx, count);
}
cout<< mx;
return 0;
} | # 2016681, 2024-09-28 11:55:51, ----P---P-----P-PPP- (30%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>> n;
int ball[n], path[n];
memset(path, 0, sizeof(path));
for(int i=0; i<n; i++){
cin>> ball[i];
}
int mx=0;
for(int i=0; i<n; i++){
memset(path, 0, sizeof(path));
int pass=0, count=0, j=i;
while(!path[j]){
path[j]++;
count+=ball[j];
j++;
j%=n;
if(j>0){
if(ball[j]<ball[j-1] && !pass){j++; j%=n; pass++; continue;}
if(ball[j]<ball[j-1]){break;}
}
else{
if(ball[j]<ball[n-1] && !pass){j++; j%=n; pass++; continue;}
if(ball[j]<ball[n-1]){break;}
}
}
//cout<< i<< " "<< count<< "\n";
mx=max(mx, count);
}
cout<< mx;
return 0;
} | # 2016689, 2024-09-28 11:56:08, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>> n;
int ball[n], path[n];
memset(path, 0, sizeof(path));
for(int i=0; i<n; i++){
cin>> ball[i];
}
int mx=0;
for(int i=0; i<n; i++){
memset(path, 0, sizeof(path));
int pass=0, count=0, j=i;
while(!path[j]){
path[j]++;
count+=ball[j];
j++;
j%=n;
if(j>0){
//if(ball[j]<ball[j-1] && !pass){j++; j%=n; pass++; continue;}
if(ball[j]<ball[j-1]){break;}
}
else{
// if(ball[j]<ball[n-1] && !pass){j++; j%=n; pass++; continue;}
if(ball[j]<ball[n-1]){break;}
}
}
//cout<< i<< " "<< count<< "\n";
mx=max(mx, count);
}
cout<< mx;
return 0;
} |
# 2015889, 2024-09-28 10:54:07, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int input, sum = 0, max_sum = 0, del[(num-1) * 2], count = 0;
vector<int> all;
// Make "all" vector
for (int i = 0; i < num; i++) {
cin >> input;
all.push_back(input);
}
for (int i = 0; i < num; i++) {
all.push_back(all[i]);
}
// Check Without Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = i; j >= 0; j++) {
if (all[j] <= all[j+1]) {
sum += all[j];
count++;
}
else if (all[j] > all[j+1]) {
sum += all[j];
break;
}
if (count == num) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
// Check With Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
// Create "del" array;
for (int j = 0; j < all.size(); j++) {
if (j == i || (j - num) == i) {
continue;
}
else {
del[j] = all[j];
cout << del[j] << " ";
}
}
cout << endl;
// Check With Deleting
for (int j = i; j >= 0; j++) {
if (del[j] <= del[j+1]) {
sum += del[j];
count++;
}
else if (del[j] > del[j+1]) {
sum += del[j];
break;
}
if (count == num - 1) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
// Clear "del"
for (int j = 0; j < ((num - 1) * 2); j++) {
del[j] = 0;
}
}
cout << endl << max_sum;
} | # 2016003, 2024-09-28 11:02:59, -PPPPPPP---------P-- (40%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int input, sum = 0, max_sum = 0, del[(num-1) * 2], count = 0;
vector<int> all;
// Make "all" vector
for (int i = 0; i < num; i++) {
cin >> input;
all.push_back(input);
}
for (int i = 0; i < num; i++) {
all.push_back(all[i]);
}
// Check Without Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = i; j >= 0; j++) {
if (all[j] <= all[j+1]) {
sum += all[j];
count++;
}
else if (all[j] > all[j+1]) {
sum += all[j];
break;
}
if (count == num) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
// Check With Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
// Create "del" array;
for (int j = 0; j < all.size(); j++) {
if (j == i || (j - num) == i) {
continue;
}
else {
del[j] = all[j];
}
}
cout << endl;
// Check With Deleting
for (int j = i; j >= 0; j++) {
if (del[j] <= del[j+1]) {
sum += del[j];
count++;
}
else if (del[j] > del[j+1]) {
sum += del[j];
break;
}
if (count == num - 1) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
// Clear "del"
for (int j = 0; j < ((num - 1) * 2); j++) {
del[j] = 0;
}
}
cout << max_sum;
} | # 2016084, 2024-09-28 11:11:56, -PPPPPPP---------P-- (40%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int input, sum = 0, max_sum = 0, del[(num-1) * 2], count = 0;
vector<int> all;
// Make "all" vector
for (int i = 0; i < num; i++) {
cin >> input;
all.push_back(input);
}
for (int i = 0; i < num; i++) {
all.push_back(all[i]);
}
// Check Without Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = i; j >= 0; j++) {
if (all[j] <= all[j+1]) {
sum += all[j];
count++;
}
else if (all[j] > all[j+1]) {
sum += all[j];
break;
}
if (count == num) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
// Check With Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
// Create "del" array;
for (int j = 0; j < all.size(); j++) {
if (j == i || (j - num) == i) {
continue;
}
else {
del[j] = all[j];
}
}
// Check With Deleting
for (int j = i; j >= 0; j++) {
if (del[j] <= del[j+1]) {
sum += del[j];
count++;
}
else if (del[j] > del[j+1]) {
sum += del[j];
break;
}
if (count == num - 1) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
// Clear "del"
for (int j = 0; j < ((num - 1) * 2); j++) {
del[j] = 0;
}
}
cout << max_sum;
} | # 2016288, 2024-09-28 11:31:46, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int input, sum = 0, max_sum = 0, del[(num-1) * 2], count = 0;
vector<int> all;
// Make "all" vector
for (int i = 0; i < num; i++) {
cin >> input;
all.push_back(input);
}
for (int i = 0; i < num; i++) {
all.push_back(all[i]);
}
// Check Without Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = i; j >= 0; j++) {
if (all[j] <= all[j+1]) {
sum += all[j];
count++;
}
else if (all[j] > all[j+1]) {
sum += all[j];
break;
}
if (count == num) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
// Check With Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = 0; j < num; j++) {
count = 0;
sum = 0;
for (int k = j; k >= 0; k++) {
if (k == i || (k-num) == i) {
continue;
}
if (all[k] <= all[k+1]) {
sum += all[k];
count++;
}
else if (all[k] > all[k+1]) {
sum += all[k];
break;
}
if (count == num) {
break;
}
}
cout << sum << endl;
}
if (sum > max_sum) {
max_sum = sum;
}
}
cout << max_sum;
} | # 2016294, 2024-09-28 11:32:06, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int input, sum = 0, max_sum = 0, del[(num-1) * 2], count = 0;
vector<int> all;
// Make "all" vector
for (int i = 0; i < num; i++) {
cin >> input;
all.push_back(input);
}
for (int i = 0; i < num; i++) {
all.push_back(all[i]);
}
// Check Without Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = i; j >= 0; j++) {
if (all[j] <= all[j+1]) {
sum += all[j];
count++;
}
else if (all[j] > all[j+1]) {
sum += all[j];
break;
}
if (count == num) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
// Check With Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = 0; j < num; j++) {
count = 0;
sum = 0;
for (int k = j; k >= 0; k++) {
if (k == i || (k-num) == i) {
continue;
}
if (all[k] <= all[k+1]) {
sum += all[k];
count++;
}
else if (all[k] > all[k+1]) {
sum += all[k];
break;
}
if (count == num) {
break;
}
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
cout << max_sum;
} | # 2016338, 2024-09-28 11:35:12, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int input, sum = 0, max_sum = 0, del[(num-1) * 2], count = 0;
vector<int> all;
// Make "all" vector
for (int i = 0; i < num; i++) {
cin >> input;
all.push_back(input);
}
for (int i = 0; i < num; i++) {
all.push_back(all[i]);
}
// Check Without Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = i; j >= 0; j++) {
if (all[j] <= all[j+1]) {
sum += all[j];
count++;
}
else if (all[j] > all[j+1]) {
sum += all[j];
break;
}
if (count == num) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
// Check With Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = 0; j < num; j++) {
count = 0;
sum = 0;
for (int k = j; k >= 0; k++) {
if (k == i || (k-num) == i) {
continue;
}
if (k+1 == i) {
if (all[k] <= all[k+2]) {
sum += all[k];
count++;
}
else if (all[k] > all[k+2]) {
sum += all[k];
break;
}
}
else {
if (all[k] <= all[k+1]) {
sum += all[k];
count++;
}
else if (all[k] > all[k+1]) {
sum += all[k];
break;
}
}
if (count == num) {
break;
}
}
cout << sum << endl;
}
if (sum > max_sum) {
max_sum = sum;
}
}
cout << max_sum;
} | # 2016341, 2024-09-28 11:35:24, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int input, sum = 0, max_sum = 0, del[(num-1) * 2], count = 0;
vector<int> all;
// Make "all" vector
for (int i = 0; i < num; i++) {
cin >> input;
all.push_back(input);
}
for (int i = 0; i < num; i++) {
all.push_back(all[i]);
}
// Check Without Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = i; j >= 0; j++) {
if (all[j] <= all[j+1]) {
sum += all[j];
count++;
}
else if (all[j] > all[j+1]) {
sum += all[j];
break;
}
if (count == num) {
break;
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
// Check With Deleting
for (int i = 0; i < num; i++) {
count = 0;
sum = 0;
for (int j = 0; j < num; j++) {
count = 0;
sum = 0;
for (int k = j; k >= 0; k++) {
if (k == i || (k-num) == i) {
continue;
}
if (k+1 == i) {
if (all[k] <= all[k+2]) {
sum += all[k];
count++;
}
else if (all[k] > all[k+2]) {
sum += all[k];
break;
}
}
else {
if (all[k] <= all[k+1]) {
sum += all[k];
count++;
}
else if (all[k] > all[k+1]) {
sum += all[k];
break;
}
}
if (count == num) {
break;
}
}
}
if (sum > max_sum) {
max_sum = sum;
}
}
cout << max_sum;
} |
# 2016103, 2024-09-28 11:13:26, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,point;
cin >>N;
int x[N];
for(int i=0;i<N;i++){
cin >> x[i];
point += x[i];
}
// for(int i=0;i<N;i++);
} | # 2016262, 2024-09-28 11:29:46, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,point,min=10000,sum=0;
cin >>N;
int x[N+5]={0};
for(int i=0;i<N;i++){
cin >> x[i];
if(x[i]<=min){
min=x[i];
point=i;
}
}
if(point==N-1){
sum +=x[point];
for(int i=0;i<N-1;i++){
if(x[i]<=x[i+1]){
sum +=x[i];
}
if(x[i]>x[i+1]){
sum +=x[i];
break;
}
}
}
cout <<sum;
} | # 2016443, 2024-09-28 11:42:20, PPPP-PPP------------ (35%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,point,min=10000;
cin >>N;
int x[N+5]={0},sum[1000000]={0};
for(int i=0;i<N;i++){
cin >> x[i];
if(x[i]<=min){
min=x[i];
point=i;
}
}
for(int i=0;i<N-1;i++){
for(int j=i;j<N;j++){
if(x[j]<=x[j+1]){
sum[i] += x[j];
}
if(x[j]>x[j+1]){
sum[i] += x[j];
break;
}
}
}
cout <<*max_element(sum , sum+1000000);
} | # 2016507, 2024-09-28 11:46:18, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >>N;
int x[N+N]={0},sum[1000000]={0};
for(int i=0;i<N;i++){
cin >> x[i];
x[i+N] = x[i];
}
for(int i=0;i<N;i++){
for(int j=i;j<N+i;j++){
if(x[j]<=x[j+1]){
sum[i] += x[j];
}
if(x[j]>x[j+1]){
sum[i] += x[j];
break;
}
}
}
cout <<*max_element(sum , sum+1000000);
} | # 2016563, 2024-09-28 11:50:09, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >>N;
int x[N+N]={0},sum[1000000]={0},sum2[1000000]={0};
for(int i=0;i<N;i++){
cin >> x[i];
x[i+N] = x[i];
}
for(int i=0;i<N;i++){
for(int j=i;j<N+i;j++){
if(x[j]<=x[j+1]){
sum[i] += x[j];
sum2[i] += x[j];
}
if(x[j]>x[j+1]){
sum[i] += x[j];
sum2[i] += x[j]+x[j+2];
break;
}
}
}
if((*max_element(sum , sum+1000000))>(*max_element(sum2 , sum2+1000000))){
cout <<*max_element(sum , sum+1000000);
}
else{
cout <<*max_element(sum2 , sum2+1000000);
}
} | # 2016617, 2024-09-28 11:52:49, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >>N;
int x[N+N]={0},sum[1000000]={0},sum2[1000000]={0};
for(int i=0;i<N;i++){
cin >> x[i];
x[i+N] = x[i];
}
for(int i=0;i<N;i++){
for(int j=i;j<N+i;j++){
if(x[j]<=x[j+1]){
sum[i] += x[j];
}
if(x[j]>x[j+1]){
sum[i] += x[j];
break;
}
}
}
cout <<*max_element(sum , sum+1000000);
} |
# 2016539, 2024-09-28 11:48:50, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
//index of min in arr
int minArray (int arr[], int n) {
int count = 0;
int ncount = 0;
for (int i = 0; i < n; i++) {
bool first = true;
int ignore;
for (int j = i; j < i+n; j++) {
if (arr[j] <= arr[j+1]) {
ncount += arr[j];
}
else {
if (first) {
ncount += arr[j];
ignore = j;
j++;
first = false;
}
else {
if (ignore == j-2 && arr[ignore] <= arr[j]) {
ncount += arr[j];
}
else if (ignore == j-2 && arr[ignore] > arr[j]) {
break;
}
else {
ncount -= arr[j-1];
break;
}
}
}
}
if (ncount >= count) {
count = ncount;
}
ncount = 0;
}
cout << count << endl;
return 0;
}
int main() {
int m; cin >> m;
int arr[m+m+5];
//store arr
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
int k = 0;
for (int j = m; j < m+m; j++) {
arr[j] = arr[k];
k++;
}
minArray(arr, m);
} | # 2016639, 2024-09-28 11:53:49, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
//index of min in arr
int minArray (int arr[], int n) {
int count = 0;
int ncount = 0;
for (int i = 0; i < n; i++) {
bool first = true;
int ignore;
// for (int j = i; j < i+n; j++) {
if (arr[i] <= arr[i+1]) {
ncount += arr[i];
}
else {
if (first) {
ncount += arr[i];
ignore = i;
i++;
first = false;
}
else {
if (ignore == i-2 && arr[ignore] <= arr[i]) {
ncount += arr[i];
}
else if (ignore == i-2 && arr[ignore] > arr[i]) {
break;
}
else {
ncount -= arr[i-1];
break;
}
}
}
if (ncount >= count) {
count = ncount;
}
ncount = 0;
}
cout << count << endl;
return 0;
}
int main() {
int m; cin >> m;
int arr[m+m+5];
//store arr
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
int k = 0;
for (int j = m; j < m+m; j++) {
arr[j] = arr[k];
k++;
}
minArray(arr, m);
} | # 2016679, 2024-09-28 11:55:43, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
//index of min in arr
int minArray (int arr[], int n) {
long long count = 0;
long ncount = 0;
for (int i = 0; i < n; i++) {
bool first = true;
long ignore;
for (int j = i; j < i+n; j++) {
if (arr[j] <= arr[j+1]) {
ncount += arr[j];
}
else {
if (first) {
ncount += arr[j];
ignore = j;
j++;
first = false;
}
else {
if (ignore == j-2 && arr[ignore] <= arr[j]) {
ncount += arr[j];
}
else if (ignore == j-2 && arr[ignore] > arr[j]) {
break;
}
else {
break;
}
}
}
}
if (ncount >= count) {
count = ncount;
}
ncount = 0;
}
cout << count << endl;;
return 0;
}
int main() {
int m; cin >> m;
int arr[m+m+5];
//store arr
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
int k = 0;
for (int j = m; j < m+m; j++) {
arr[j] = arr[k];
k++;
}
minArray(arr, m);
} | # 2016737, 2024-09-28 11:57:58, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
//index of min in arr
int minArray (int arr[], int n) {
long long count = 0;
long ncount = 0;
for (int i = 0; i < n; i++) {
bool first = true;
long ignore;
for (int j = i; j < i+n; j++) {
if (first && arr[j] <= arr[j+1]) {
ncount += arr[j];
}
else {
if (first) {
ncount += arr[j];
ignore = j;
j++;
first = false;
}
else {
if (ignore == j-2 && arr[ignore] <= arr[j]) {
ncount += arr[j];
}
else if (ignore == j-2 && arr[ignore] > arr[j]) {
break;
}
else {
break;
}
}
}
}
if (ncount >= count) {
count = ncount;
}
ncount = 0;
}
cout << count << endl;;
return 0;
}
int main() {
int m; cin >> m;
int arr[m+m+5];
//store arr
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
int k = 0;
for (int j = m; j < m+m; j++) {
arr[j] = arr[k];
k++;
}
minArray(arr, m);
} | # 2016772, 2024-09-28 11:59:03, -PPPPPPP---------P-- (40%)
#include <bits/stdc++.h>
using namespace std;
//index of min in arr
int minArray (int arr[], int n) {
long long count = 0;
long ncount = 0;
for (int i = 0; i < n; i++) {
bool first = true;
long ignore;
for (int j = i; j < i+n; j++) {
if (first && arr[j] <= arr[j+1]) {
ncount += arr[j];
}
else {
if (first) {
ncount += arr[j];
ignore = j;
j++;
first = false;
}
else {
if (ignore == j-2 && arr[ignore] <= arr[j]) {
ncount += arr[j];
}
else if (arr[ignore] <= arr[j]) {
ncount += arr[j];
}
else if (ignore == j-2 && arr[ignore] > arr[j]) {
break;
}
else {
break;
}
}
}
}
if (ncount >= count) {
count = ncount;
}
ncount = 0;
}
cout << count << endl;;
return 0;
}
int main() {
int m; cin >> m;
int arr[m+m+5];
//store arr
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
int k = 0;
for (int j = m; j < m+m; j++) {
arr[j] = arr[k];
k++;
}
minArray(arr, m);
} | # 2016794, 2024-09-28 11:59:31, -PPPPPPP---------P-- (40%)
#include <bits/stdc++.h>
using namespace std;
//index of min in arr
int minArray (int arr[], int n) {
long long count = 0;
long ncount = 0;
for (int i = 0; i < n; i++) {
bool first = true;
long ignore;
for (int j = i; j < i+n; j++) {
if (first && arr[j] <= arr[j+1]) {
ncount += arr[j];
}
else {
if (first) {
ncount += arr[j];
ignore = j;
j++;
first = false;
}
else {
if (ignore == j-2 && arr[ignore] <= arr[j]) {
ncount += arr[j];
}
else if (arr[ignore] <= arr[j]) {
ncount += arr[j];
}
else if (ignore == j-2 && arr[ignore] > arr[j]) {
break;
}
else {
break;
}
}
}
}
if (ncount >= count) {
count = ncount;
}
ncount = 0;
}
cout << count << endl;;
return 0;
}
int main() {
int m; cin >> m;
int arr[m+m+5];
//store arr
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
int k = 0;
for (int j = m; j < m+m; j++) {
arr[j] = arr[k];
k++;
}
minArray(arr, m);
} |
# 2016160, 2024-09-28 11:19:09, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int n ,sum=0;
cin >>n;
int n2=2*n;
int a[n2];
for(int i=0;i<n;i++){
cin >>a[i];
}
for(int i=0;i<n;i++){
a[i+n]=a[i];
}
for(int i=0;i<n;i++){
int sum_now=0;
for(int j=i;j<n+i;j++){
if(a[j]>a[j+i]){
sum_now+=a[j];
break;
}else{
sum_now+=a[j];
}
}
if(sum_now>sum){
sum =sum_now;
}
}
cout << sum;
// for(int i=0;i<n2;i++){
// cout <<a[i]<<" ";
// }
} | # 2016394, 2024-09-28 11:39:37, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main(){
int n ,sum=0;
cin >>n;
int n2=2*n;
int a[n2];
for(int i=0;i<n;i++){
cin >>a[i];
}
for(int i=0;i<n;i++){
a[i+n]=a[i];
}
for(int i=0;i<n;i++){
int sum_now=0;
for(int j=i;j<n+i;j++){
if(a[j]>a[j+1]){
sum_now+=a[j];
break;
}else{
sum_now+=a[j];
}
}
//cout << sum_now << " ";
if(sum_now>sum){
sum =sum_now;
}
}
cout << sum;
// for(int i=0;i<n2;i++){
// cout <<a[i]<<" ";
// }
} | # 2016672, 2024-09-28 11:55:23, ----P----PPPP--P-P-P (40%)
#include<iostream>
using namespace std;
int main(){
int n ,sum=0;
cin >>n;
int n2=2*n;
int a[n2];
for(int i=0;i<n;i++){
cin >>a[i];
}
for(int i=0;i<n;i++){
a[i+n]=a[i];
}
for(int i=0;i<n;i++){
int k=0;
do{
int sum_now=0;
for(int j=i;j<n+i;j++){
if(a[j]>a[j+1]){
if(j==k){
continue;
}else{
sum_now+=a[j];
break;
}
}else{
sum_now+=a[j];
}
}
//cout << sum_now << " ";
if(sum_now>sum){
sum =sum_now;
}
k++;
}while(k<n-1);
}
cout << sum;
// for(int i=0;i<n2;i++){
// cout <<a[i]<<" ";
// }
} | # 2016708, 2024-09-28 11:56:56, ----P----PPPP--P-P-P (40%)
#include<iostream>
using namespace std;
int main(){
int n ,sum=0;
cin >>n;
int n2=2*n;
int a[n2];
for(int i=0;i<n;i++){
cin >>a[i];
}
for(int i=0;i<n;i++){
a[i+n]=a[i];
}
for(int i=0;i<n;i++){
int k=-1;
do{
int sum_now=0;
for(int j=i;j<n+i;j++){
if(a[j]>a[j+1]){
if(j==k){
continue;
}else{
sum_now+=a[j];
break;
}
}else{
sum_now+=a[j];
}
}
//cout << sum_now << " ";
if(sum_now>sum){
sum =sum_now;
}
k++;
}while(k<n-1);
}
cout << sum;
// for(int i=0;i<n2;i++){
// cout <<a[i]<<" ";
// }
} | # 2016785, 2024-09-28 11:59:18, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int n ,sum=0;
cin >>n;
int n2=2*n;
int a[n2];
for(int i=0;i<n;i++){
cin >>a[i];
}
for(int i=0;i<n;i++){
a[i+n]=a[i];
}
for(int i=0;i<n;i++){
int sum_now=0;
for(int j=i;j<n+i;j++){
int k=-1;
do{
if(a[j]>a[j+1]){
if(j==k){
continue;
}else{
sum_now+=a[j];
break;
}
}else{
sum_now+=a[j];
}
}
//cout << sum_now << " ";
if(sum_now>sum){
sum =sum_now;
}
k++;
while(k<n-1);
}
}
cout << sum;
// for(int i=0;i<n2;i++){
// cout <<a[i]<<" ";
// }
} |
# 2018434, 2024-09-28 15:01:16, PPPPTTTTTTTTTTTTTTTT (20%)
#include<iostream>
#include<vector>
using namespace std;
void sort(vector<int> & data){
for(int i=0;i<data.size();i++){
for(int j=i+1;j<data.size();j++){
if(data[i] < data[j]) swap(data[i],data[j]);
}
}
}
int main(){
vector<int> score;
int n,a;
cin>>n;
vector<int> pk;
for(int i=0;i<n;i++){
cin>>a;
pk.push_back(a);
}
for(int i=0;i<n;i++){
int sum=0;
for(int j=i;j<n+i;j++){
if(pk[j%n]>pk[(j+1)%n] || j==n+i-1){
sum+=pk[j%n];
score.push_back(sum);
break;
}else{
sum+=pk[j%n];
}
}
}
for(int i=0;i<n;i++){
vector<int> dup;
for(int j=0;j<n;j++){
if(j!=i) dup.push_back(pk[j]);
}
for(int j=0;j<n-1;j++){
int sum=0;
for(int k=j;k<n+j-1;k++){
if(dup[k%(n-1)]>dup[(k+1)%(n-1)] || k==n+j-1){
sum+=dup[k%(n-1)];
score.push_back(sum);
break;
}else{
sum+=dup[k%(n-1)];
}
}
}
}
sort(score);
cout<<score[0];
} | # 2018478, 2024-09-28 15:03:25, PPPPPPPP---------P-- (45%)
#include<iostream>
#include<vector>
using namespace std;
void sort(vector<int> & data){
for(int i=0;i<data.size();i++){
for(int j=i+1;j<data.size();j++){
if(data[i] < data[j]) swap(data[i],data[j]);
}
}
}
int main(){
vector<int> score;
int n;
cin>>n;
int pk[n];
for(int i=0;i<n;i++) cin>>pk[i];
for(int i=0;i<n;i++){
int sum=0;
for(int j=i;j<n+i;j++){
if(pk[j%n]>pk[(j+1)%n] || j==n+i-1){
sum+=pk[j%n];
score.push_back(sum);
break;
}else{
sum+=pk[j%n];
}
}
}
sort(score);
cout<<score[0];
} | # 2018647, 2024-09-28 15:13:54, PPPPTTTTTTTTTTTTTTTT (20%)
#include<iostream>
#include<vector>
using namespace std;
void sort(vector<int> & data){
for(int i=0;i<data.size();i++){
for(int j=i+1;j<data.size();j++){
if(data[i] < data[j]) swap(data[i],data[j]);
}
}
}
int main(){
vector<int> score;
int n,a;
cin>>n;
vector<int> pk;
for(int i=0;i<n;i++){
cin>>a;
pk.push_back(a);
}
for(int i=0;i<n;i++){
int sum=0;
for(int j=i;j<n+i;j++){
if(pk[j%n]>pk[(j+1)%n] || j==n+i-1){
sum+=pk[j%n];
score.push_back(sum);
break;
}else{
sum+=pk[j%n];
}
}
}
for(int i=0;i<n;i++){
vector<int> dup;
for(int j=0;j<n;j++){
if(j!=i) dup.push_back(pk[j]);
}
for(int j=0;j<n-1;j++){
int sum=0;
for(int k=j;k<n+j-1;k++){
if(dup[k%(n-1)]>dup[(k+1)%(n-1)] || k==n+j-2){
sum+=dup[k%(n-1)];
score.push_back(sum);
break;
}else{
sum+=dup[k%(n-1)];
}
} //cout<<sum<<" ";
}
//for(auto e:dup) cout<< e<<" ";
//cout<<endl;
}
sort(score);
cout<<score[0];
} | # 2018656, 2024-09-28 15:14:20, PPPPPPPP---------P-- (45%)
#include<iostream>
#include<vector>
using namespace std;
void sort(vector<int> & data){
for(int i=0;i<data.size();i++){
for(int j=i+1;j<data.size();j++){
if(data[i] < data[j]) swap(data[i],data[j]);
}
}
}
int main(){
vector<int> score;
int n;
cin>>n;
int pk[n];
for(int i=0;i<n;i++) cin>>pk[i];
for(int i=0;i<n;i++){
int sum=0;
for(int j=i;j<n+i;j++){
if(pk[j%n]>pk[(j+1)%n] || j==n+i-1){
sum+=pk[j%n];
score.push_back(sum);
break;
}else{
sum+=pk[j%n];
}
}
}
sort(score);
cout<<score[0];
} |
# 2018182, 2024-09-28 14:41:30, ----P---P-----P-PPP- (30%)
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[2*n];
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
for (int i = n; i < 2*n; i++)
{
a[i] = a[i-n];
}
int maxa = 0; // max with out delete any number
int totala;
int maxb = 0; // max with delete 1 number
int totalb;
int count = 0; // count to not more than n
for (int i = 0; i < n; i++)
{
totala = 0;
count = 0;
for (int j = i; j < 2*n; j++)
{
if (a[j] > a[j+1] || count == n-1)
{
totala += a[j];
count++;
break;
} else
{
totala += a[j];
count++;
}
}
// max check //
if (totala > maxa)
{
maxa = totala;
}
}
// make new one
// max with delete 1 number make it zero and then if we see 0 just add it that's it
for (int i = 0; i < n; i++)
{
int u = a[i];
a[i] = 0;
a[n+i] = 0;
for (int j = 0; j < n; j++)
{
totalb = 0;
count = 0;
for (int k = j; k < 2 * n; k++)
{
if ((a[k] > a[k + 1] && a[k+1] != 0) || count == n-1 )
{
totalb += a[k];
count++;
break;
}
else
{
totalb += a[k];
count++;
}
}
// max check //
if (totalb > maxb)
{
maxb = totalb;
}
}
a[i] = u;
a[n+i] = u;
}
if (maxa >= maxb)
{
cout << maxa;
} else
{
cout << maxb;
}
// delete it //
} | # 2018557, 2024-09-28 15:09:45, -P-P---P---------P-- (20%)
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[2*n];
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
for (int i = n; i < 2*n; i++)
{
a[i] = a[i-n];
}
int maxa = 0; // max with out delete any number
int totala;
int maxb = 0; // max with delete 1 number
int totalb;
int count = 0; // count to not more than n
for (int i = 0; i < n; i++)
{
totala = 0;
count = 0;
for (int j = i; j < 2*n; j++)
{
if (a[j] > a[j+1] || count == n-1)
{
totala += a[j];
count++;
break;
} else
{
totala += a[j];
count++;
}
}
// max check //
if (totala > maxa)
{
maxa = totala;
}
}
// make new one
// max with delete 1 number make it zero and then if we see 0 just add it that's it
int b[(2*n)-2];
for (int i = 0; i < 2*n-2; i++)
{
int m = 0;
if (i == 0 || i == n)
{
m++;
continue;
} else
{
b[i] = a[m];
}
m++;
}
for (int i = 0; i < n-1; i++)
{
totalb = 0;
count = 0;
for (int j = i; j < 2*n-2; j++)
{
if (a[j] > a[j+1] || count == n-3)
{
totalb += b[j];
count++;
break;
} else
{
totalb += b[j];
count++;
}
}
// max check //
if (totalb > maxb)
{
maxb = totalb;
}
}
if (maxa >= maxb)
{
cout << maxa;
} else
{
cout << maxb;
}
// delete it //
} | # 2018576, 2024-09-28 15:10:25, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[2*n];
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
for (int i = n; i < 2*n; i++)
{
a[i] = a[i-n];
}
int maxa = 0; // max with out delete any number
int totala;
int maxb = 0; // max with delete 1 number
int totalb;
int count = 0; // count to not more than n
for (int i = 0; i < n; i++)
{
totala = 0;
count = 0;
for (int j = i; j < 2*n; j++)
{
if (a[j] > a[j+1] || count == n-1)
{
totala += a[j];
count++;
break;
} else
{
totala += a[j];
count++;
}
}
// max check //
if (totala > maxa)
{
maxa = totala;
}
}
// make new one
// max with delete 1 number make it zero and then if we see 0 just add it that's it
int b[(2*n)-2];
for (int i = 0; i < 2*n-2; i++)
{
int m = 0;
if (i == 0 || i == n)
{
m++;
continue;
} else
{
b[i] = a[m];
}
m++;
}
for (int i = 0; i < n-1; i++)
{
totalb = 0;
count = 0;
for (int j = i; j < 2*n-2; j++)
{
if (a[j] > a[j+1] || count == n-3)
{
totalb += b[j];
count++;
break;
} else
{
totalb += b[j];
count++;
}
}
// max check //
if (totalb > maxb)
{
maxb = totalb;
}
}
cout << maxa;
/*
if (maxa >= maxb)
{
cout << maxa;
} else
{
cout << maxb;
}*/
// delete it //
} |
# 2018229, 2024-09-28 14:44:33, PP----PP------------ (20%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0;i < n;i++) cin >> p[i];
int start = 0,next = -1,cnt = 0;
for (int i = 0;i < n;i++) {
cnt += p[i];
if (p[i] > p[i+1]) break;
}
cout << cnt;
} | # 2018461, 2024-09-28 15:02:29, PP----PPP----------- (25%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0;i < n;i++) cin >> p[i];
int start = 0,next = -1,cnt = 0;
bool skip =true;
for (int i = 0;i < n;i++) {
cnt += p[i];
if (p[i] > p[i+1]) {
if (skip) {
skip = false;
if (p[i] > p[i+2]) break;
else i++;
}else
break;
}
}
cout << cnt;
} | # 2018570, 2024-09-28 15:10:06, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0;i < n;i++) cin >> p[i];
int max = 0;
for (int i = 0;i < n;i++) {
int start = i;
int next = i+1;
int nextskip;
int cnt = 0;
bool skip = false;
while(next != i) {
cnt += p[start];
//cout<< start << " " << p[start] << " " << cnt << endl;
next = start + 1;
if (next >= n) next = 0;
if (p[start] > p[next]) {
if (skip) {
skip = false;
if (next + 1 >= n) nextskip = 0;
else nextskip = next + 1;
if(p[start] <= p[nextskip]) {
start = nextskip;
}
else break;
}
else break;
}
start = next;
}
if (cnt > max) max = cnt;
}
cout << max;
} |
# 2018470, 2024-09-28 15:02:54, ----P------------PP- (15%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
int it = 0, ans = 0;
for (int i = 0; i < N; i++)
{
int temp = 0;
it = i;
for (int J = 0; J < N; J++)
{
int it2 = it+1;
if(it2 > N-1) it2 = 0;
if(it > N-1) it = 0;
if(A[it] < A[it2]){
temp+= A[it];
it++;
if(it > N-1) it = 0;
}
else if(A[it] == A[it2]){
temp+= A[it];
it++;
if(it > N-1) it = 0;
if(temp > ans) ans = temp;
} else if(A[it] > A[it2]){
temp += A[it];
if(temp > ans) ans = temp;
it = 0;
temp = 0;
break;
}
}
}
for (int K = 0; K < N; K++)
{
for (int i = 0; i < N; i++)
{
if(i == K) continue;
int temp = 0;
it = i;
for (int J = 0; J < N-1; J++)
{
int it2 = it+1;
if(it2 == K) it2+=1;
if(K == 0){
if(it2 > N-1) it2 = 1;
if(it > N-1) it = 1;
} else {
if(it2 > N-1) it2 = 0;
if(it > N-1) it = 0;
}
if(it == K) it += 1;
if(A[it] < A[it2]){
temp+= A[it];
it++;
if(it > N-1) it = 0;
}else if(A[it] == A[it2]){
temp+= A[it];
it++;
if(it > N-1) it = 0;
if(temp > ans) ans = temp;
}
else if(A[it] > A[it2]){
temp += A[it];
if(temp > ans) ans = temp;
it = 0;
temp = 0;
break;
}
}
}
}
cout << ans;
} | # 2018477, 2024-09-28 15:03:18, PPPPPPPP---------P-- (45%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
int it = 0, ans = 0;
for (int i = 0; i < N; i++)
{
int temp = 0;
it = i;
for (int J = 0; J < N; J++)
{
int it2 = it+1;
if(it2 > N-1) it2 = 0;
if(it > N-1) it = 0;
if(A[it] < A[it2]){
temp+= A[it];
it++;
if(it > N-1) it = 0;
}
else if(A[it] == A[it2]){
temp+= A[it];
it++;
if(it > N-1) it = 0;
if(temp > ans) ans = temp;
} else if(A[it] > A[it2]){
temp += A[it];
if(temp > ans) ans = temp;
it = 0;
temp = 0;
break;
}
}
}
cout << ans;
} |
# 2016599, 2024-09-28 11:51:57, -------------------- (0%)
#include <iostream>
using namespace std;
int main() {
int N,answer=0;
cin >> N;
int P1[N],P2[2*N];
for(int i=0; i<N; i++) {
cin >> P1[i];
}
for(int i=0; i<2*N; i++) {
if(i<N) P2[i]=P1[i];
else P2[i]=P1[i-N];
}
for(int i=0; i<N; i++) {
int count = 0;
for(int j=0; j<N; j++) {
if(P2[j+i]>P2[j+i+1]) {
count += P2[i+j];
break;
}
count += P2[i+j];
}
if(count > answer) answer =count;
cout << count << endl;
}
cout << answer << endl;
} | # 2016618, 2024-09-28 11:52:49, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int main() {
int N,answer=0;
cin >> N;
int P1[N],P2[2*N];
for(int i=0; i<N; i++) {
cin >> P1[i];
}
for(int i=0; i<2*N; i++) {
if(i<N) P2[i]=P1[i];
else P2[i]=P1[i-N];
}
for(int i=0; i<N; i++) {
int count = 0;
for(int j=0; j<N; j++) {
if(P2[j+i]>P2[j+i+1]) {
count += P2[i+j];
break;
}
count += P2[i+j];
}
if(count > answer) answer =count;
}
cout << answer << endl;
} |
# 2016590, 2024-09-28 11:51:37, -xxxxxxxxxxxxxxxxxxx (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int sumr[n];
int sumr2[1000];
int total=0;int total2=0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
total=a[i];
for(int j=i;j<i+n-1;j++){
int k=j%n;
int l=(j+1)%n;
if(a[l]>=a[k]){
total+=a[l];
}
else{
break;
}
}
sumr[i]=total;
}
int count=0;
for(int i=0;i<n;i++){
total2=a[i];
for(int j=i;j<i+n-1;j++){
int k=j%n;
int l=(j+1)%n;
total2=0;
for(int y=0;y<n;y++){
if(k==y){
if(a[y+1]>=a[k-1]){
total2+=a[y+1];
}
}
else{
if(a[l]>=a[k]){
total+=a[l];
}
else{
break;
}
}
}
sumr2[count]=total2;
count++;
total2=0;
}
}
int max1=0;
int max2=0;
for(int i=0;i<n;i++){
if(sumr[i]>max1){
max1=sumr[i];
}
}for(int i=0;i<count;i++){
if(sumr2[i]>max2){
max2=sumr2[i];
}
}
if(max1<max2){
cout<<max1<<endl;
}
else{
cout<<max2<<endl;
}
} | # 2016607, 2024-09-28 11:52:28, PPPPPPPP---------P-- (45%)
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int sumr[n];
int sumr2[n-1];
int total=0;int total2=0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
total=a[i];
for(int j=i;j<i+n-1;j++){
int k=j%n;
int l=(j+1)%n;
if(a[l]>=a[k]){
total+=a[l];
}
else{
break;
}
}
sumr[i]=total;
}
int max1=0;
for(int i=0;i<n;i++){
if(sumr[i]>max1){
max1=sumr[i];
}
}
cout<<max1;
} |
# 2015781, 2024-09-28 10:42:23, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int main(){
int n; cin >> n;
int arr[n];
int arr2[n];
int result = 0;
int max1 =0 ;
for(int i=0; i<n; i++){
cin >> arr[i];
}
//start form 0
for(int i=0; i<n; i++){
if(arr[i]<=arr[i+1]){
max1+=arr[i];
}
else if(arr[i]>arr[i+1]){
break;
}
}
//cout << max1 << endl;
//not start from 0
int max21 = 0; //keep tua nee
int max22 = 0;
int max31 = 0; //keep tua nee
int max32 = 0;
for(int i=0; i<n; i++){
max22 = 0;
//change po
arr2[0]=arr[n-1];
for(int i=0; i<n-1; i++){
arr2[i+1]=arr[i];
}
for(int j=0; j<n; j++){
arr[j]=arr2[j];
}
/*for(int j=0; j<n; j++){
cout << arr[j] << " ";
}
cout << endl;*/
for(int k=0; k<n; k++){
if(arr[k]<=arr[k+1]){
max22+=arr[k];
}
else if(arr[k]>arr[k+1]){
max22+=arr[k];
//cout << max22 << endl;
break;
}
}
if(max22>max21){
max21 = max22;
}
//tud look
for(int k=0; k<n-1; k++){
if(arr[k]<=arr[k+1]){
max32+=arr[k];
}
else if(arr[k]>arr[k+1]){
max32+=arr[k];
//cout << max32 << endl;
break;
}
}
if(max32>max31){
max31 = max32;
}
}
//cout << max21 << endl;
result = max(max1,max21);
cout << result << endl;
} | # 2016197, 2024-09-28 11:23:02, PPPPPPPP---------P-- (45%)
#include <iostream>
using namespace std;
int main(){
int n; cin >> n;
int arr[n];
int arr2[n];
int result = 0;
int max1 =0 ;
for(int i=0; i<n; i++){
cin >> arr[i];
}
//start form 0
for(int i=0; i<n; i++){
if(arr[i]<=arr[i+1]){
max1+=arr[i];
}
else if(arr[i]>arr[i+1]){
break;
}
}
//cout << max1 << endl;
//not start from 0
int max21 = 0; //keep tua nee
int max22 = 0;
for(int i=0; i<n; i++){
max22 = 0;
//change po
arr2[0]=arr[n-1];
for(int i=0; i<n-1; i++){
arr2[i+1]=arr[i];
}
for(int j=0; j<n; j++){
arr[j]=arr2[j];
}
for(int k=0; k<n; k++){
if(arr[k]<=arr[k+1]){
max22+=arr[k];
}
else if(arr[k]>arr[k+1]){
max22+=arr[k];
//cout << max22 << endl;
break;
}
}
if(max22>max21){
max21 = max22;
}
}
//tud look
int max31 = 0; //keep tua nee
int max32 = 0;
for(int i=0; i<n; i++){
arr[i]=0;
}
//cout << max21 << endl;
result = max(max1,max21);
cout << result << endl;
} |
# 2018684, 2024-09-28 15:15:33, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, max_power = 0; cin >> n;
int arr[n]; for(int i = 0; i < n; i++){cin >> arr[i];}
int new_arr[n];
for(int i = 0; i < n; i++){
int new_arr[n],idx=0,power=0,change=0,power2=0;
for(int j = i; j < n; j++){
new_arr[idx] = arr[j];
idx++;
}
for(int k = 0; k < i; k++){
new_arr[idx] = arr[k];
idx++;
}
//for(int a = 0; a < n; a++){cout << new_arr[a] << " ";}
//cout << endl;
for(int a = 0; a<n; a++){
power+=new_arr[a];
if(new_arr[a]<=new_arr[a+1]){continue;}
else{
new_arr[a+1] = 0;
change++;
break;
}
}
if(change == 1){
for(int b = 0; b < n; b++){
power2+=new_arr[b];
if(new_arr[b] == 0){continue;}
if(new_arr[b]<=new_arr[b+1]){
continue;
}
else{
break;
}
}
}
if(max(power,power2)>max_power){max_power=max(power,power2);}
}
cout << max_power;
return 0;
} | # 2018761, 2024-09-28 15:18:09, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, max_power = 0; cin >> n;
int arr[n]; for(int i = 0; i < n; i++){cin >> arr[i];}
int new_arr[n];
for(int i = 0; i < n; i++){
int new_arr[n],idx=0,power=0,change=0,power2=0;
for(int j = i; j < n; j++){
new_arr[idx] = arr[j];
idx++;
}
for(int k = 0; k < i; k++){
new_arr[idx] = arr[k];
idx++;
}
//for(int a = 0; a < n; a++){cout << new_arr[a] << " ";}
//cout << endl;
for(int a = 0; a<n; a++){
power+=new_arr[a];
if(new_arr[a]<=new_arr[a+1]){continue;}
else{
new_arr[a+1] = 0;
change++;
break;
}
}
if(change == 1){
for(int b = 0; b < n; b++){
power2+=new_arr[b];
if(new_arr[b] == 0){
if(new_arr[b+1]<new_arr[b-1]){break;}
else{continue;}
}
if(new_arr[b]<=new_arr[b+1]){
continue;
}
else{
break;
}
}
}
if(max(power,power2)>max_power){max_power=max(power,power2);}
}
cout << max_power;
return 0;
} |
# 2017158, 2024-09-28 13:03:21, PPPPPPPP---------P-- (45%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int ans;
int n;
cin >> n;
int arr[n];
int tag=0;
int maxx=INT_MIN;
for (int i = 0 ; i < n ; i++)
{
cin >> arr[i];
}
for (int i = 0 ; i < n ; i++)
{
ans = 0;
int next =0;
if (i==n-1)
{
next = 0;
}
else
{
next = i+1;
}
ans+=arr[i];
for (int j = i ; next!=i; j++)
{
//cout << j << "yo" << next<< " ";
if (arr[next]<arr[j])
{
break;
}
else
{
ans+=arr[next];
}
if (j==n-1)
{
j=0-1;
}
if (next==n-1)
{
next = 0;
}
else
{
next++;
}
}
if (ans>=maxx)
{
maxx=ans;
}
}
cout << maxx;
} |
# 2018270, 2024-09-28 14:48:01, PPPP-PPP------------ (35%)
#include <iostream>
using namespace std;
int main(){
int m;cin >>m;
int arr[500]={0};
for(int i = 0;i<m;i++){
cin >> arr[i];
}
int max=0;
for(int j = 0;j<m;j++){
int sum = arr[j];
for(int i = j;i<m-1;i++){
if(arr[i]<=arr[i+1]){
sum+=arr[i+1];
}else break;
}
if(sum > max) max = sum;
}
cout << max<<endl;
} | # 2018531, 2024-09-28 15:07:44, -----------------P-- (5%)
#include <iostream>
using namespace std;
int main(){
int m;cin >>m;
int arr[500]={0};
for(int i = 0;i<m;i++){
cin >> arr[i];
}
int max=0;
for(int j = 0;j<m;j++){
int sum = arr[j];
int i = j;
for(;i<m-1;i++){
if(arr[i]<=arr[i+1]){
sum+=arr[i+1];
//cout << arr[i+1];//
}else break;
}
int first=1;
if(i = m-1 && j!= 0){
for(int k = 0;k<j;k++){
if(arr[i]<=arr[k]){
sum+=arr[k];
//cout << arr[k];
if(first==1) i=0;
else i++;
first++;
}
}
}
if(sum > max) max = sum;
}
cout << max<<endl;
}
// #include <iostream>
// using namespace std;
// int main(){
// int m;cin >>m;
// int arr[500]={0};
// for(int i = 0;i<m;i++){
// cin >> arr[i];
// }
// int max=0;
// for(int j = 0;j<m;j++){
// int sum = arr[j];
// for(int i = j;i<m-1;i++){
// if(arr[i]<=arr[i+1]){
// sum+=arr[i+1];
// }else break;
// }
// if(sum > max) max = sum;
// }
// cout << max<<endl;
// } | # 2018604, 2024-09-28 15:11:59, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int m;cin >>m;
int arr[500]={0};
for(int i = 0;i<m;i++){
cin >> arr[i];
}
int max=0;
for(int j = 0;j<m;j++){
int sum = arr[j];
int i = j;
for(;i<m-1;i++){
if(arr[i]<=arr[i+1]){
sum+=arr[i+1];
}else break;
}
cout << ">"<<sum<<endl;
int first=1;
if(i == m-1 && j!= 0){
for(int k = 0;k<j;k++){
if(arr[i]<=arr[k]){
sum+=arr[k];
if(first==1) i=0;
else i++;
first++;
}
}
}
cout << ">>"<<sum<<endl;
if(sum > max) max = sum;
}
cout << max<<endl;
} | # 2018641, 2024-09-28 15:13:43, P---P-P----------P-- (20%)
#include <iostream>
using namespace std;
int main(){
int m;cin >>m;
int arr[500]={0};
for(int i = 0;i<m;i++){
cin >> arr[i];
}
int max=0;
for(int j = 0;j<m;j++){
int sum = arr[j];
int i = j;
for(;i<m-1;i++){
if(arr[i]<=arr[i+1]){
sum+=arr[i+1];
}else break;
}
int first=1;
if(i == m-1 && j!= 0){
for(int k = 0;k<j;k++){
if(arr[i]<=arr[k]){
sum+=arr[k];
if(first==1) i=0;
else i++;
first++;
}
}
}
if(sum > max) max = sum;
}
cout << max<<endl;
} | # 2018665, 2024-09-28 15:14:47, PPPP-PPP------------ (35%)
#include <iostream>
using namespace std;
int main(){
int m;cin >>m;
int arr[500]={0};
for(int i = 0;i<m;i++){
cin >> arr[i];
}
int max=0;
for(int j = 0;j<m;j++){
int sum = arr[j];
for(int i = j;i<m-1;i++){
if(arr[i]<=arr[i+1]){
sum+=arr[i+1];
}else break;
}
if(sum > max) max = sum;
}
cout << max<<endl;
} |
# 2018023, 2024-09-28 14:25:28, PPPP-PPP------------ (35%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int power[n];
int max = 0;
for(int i = 0; i < n; i++){
cin >> power[i];
}
for(int i = 0; i < n; i++){
int index = 0;
for(int j = 0; j < n; j++){
if(j != i){
//cout << index << " " << power[j] << " ";
index++;
}
}
//cout << endl;
}
//cout << "---------------" << endl;
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n+i; j++){
if(j >= n){
//cout << power[j-n] << " ";
if(j-n+1 >= n){
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power[j] << " ";
if(j+1 >= n){
sum += power[j];
if(power[j] > power[j-n]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j];
if(power[j] > power[j+1]){
//cout << sum << endl;
break;
}
}
}
}
if(sum > max){
max = sum;
}
}
cout << max << endl;
} | # 2018091, 2024-09-28 14:32:40, PPPP-PPP------------ (35%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int power[n];
int max = 0;
for(int i = 0; i < n; i++){
cin >> power[i];
}
int m = n-1;
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n+i; j++){
if(j >= n){
//cout << power[j-n] << " ";
if(j-n+1 >= n){
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power[j] << " ";
if(j+1 >= n){
sum += power[j];
if(power[j] > power[j-n]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j];
if(power[j] > power[j+1]){
//cout << sum << endl;
break;
}
}
}
}
if(sum > max){
max = sum;
}
}
for(int i = 0; i < n; i++){
int index = 0;
for(int j = 0; j < n; j++){
if(j != i){
//cout << index << " " << power[j] << " ";
index++;
int sum = 0;
for(int k = index; k < m+k; k++){
if(k >= m){
//cout << power[k-m] << " ";
if(k-m+1 >= m){
sum += power[k-m];
if(power[k-m] > power[k-m+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power[k-m];
if(power[k-m] > power[k-m+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power[k] << " ";
if(k+1 >= m){
sum += power[k];
if(power[k] > power[k-m]){
//cout << sum << endl;
break;
}
}
else{
sum += power[k];
if(power[k] > power[k+1]){
//cout << sum << endl;
break;
}
}
}
}
if(sum > max){
max = sum;
}
}
}
}
cout << max << endl;
} | # 2018102, 2024-09-28 14:33:37, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int power[n];
int max = 0;
for(int i = 0; i < n; i++){
cin >> power[i];
}
int m = n-1;
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n+i; j++){
if(j >= n){
//cout << power[j-n] << " ";
if(j-n+1 >= n){
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power[j] << " ";
if(j+1 >= n){
sum += power[j];
if(power[j] > power[j-n]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j];
if(power[j] > power[j+1]){
//cout << sum << endl;
break;
}
}
}
}
if(sum > max){
max = sum;
}
}
for(int i = 0; i < n; i++){
int index = 0;
for(int j = 0; j < n; j++){
if(j != i){
//cout << index << " " << power[j] << " ";
index++;
int sum = 0;
for(int k = index; k < m+k; k++){
if(k >= m){
//cout << power[k-m] << " ";
if(k-m+1 >= m){
sum += power[k-m];
if(power[k-m] > power[k-m+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power[k-m];
if(power[k-m] > power[k-m+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power[k] << " ";
if(k+1 >= m){
sum += power[k];
if(power[k] > power[k-m]){
//cout << sum << endl;
break;
}
}
else{
sum += power[k];
if(power[k] > power[k+1]){
//cout << sum << endl;
break;
}
}
}
}
if(sum > max){
max = sum;
}
}
}
}
cout << max-1 << endl;
} | # 2018238, 2024-09-28 14:45:25, PPPP-PPP------------ (35%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int power[n];
int max = 0;
for(int i = 0; i < n; i++){
cin >> power[i];
}
int m = n-1;
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n+i; j++){
if(j >= n){
//cout << power[j-n] << " ";
if(j-n+1 >= n){
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power[j] << " ";
if(j+1 >= n){
sum += power[j];
if(power[j] > power[j-n]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j];
if(power[j] > power[j+1]){
//cout << sum << endl;
break;
}
}
}
}
if(sum > max){
max = sum;
}
}
for(int i = 0; i < n; i++){
int index = 0;
for(int j = 0; j < n; j++){
if(j != i){
//cout << index << " " << power[j] << " ";
index++;
int sum = 0;
for(int k = index; k < m+index; k++){
if(k >= m){
//cout << power[k-m] << " ";
if(k-m+1 >= m){
sum += power[k-m];
if(power[k-m] > power[k-m+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power[k-m];
if(power[k-m] > power[k-m+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power[k] << " ";
if(k+1 >= m){
sum += power[k];
if(power[k] > power[k-m]){
//cout << sum << endl;
break;
}
}
else{
sum += power[k];
if(power[k] > power[k+1]){
//cout << sum << endl;
break;
}
}
}
}
if(sum > max){
max = sum;
}
}
}
//cout << endl;
}
cout << max << endl;
} | # 2018820, 2024-09-28 15:19:35, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int power[n];
int max = 0;
for(int i = 0; i < n; i++){
cin >> power[i];
}
int m = n-1;
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n+i; j++){
if(j >= n){
//cout << power[j-n] << " ";
if(j-n+1 >= n){
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j-n];
if(power[j-n] > power[j-n+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power[j] << " ";
if(j+1 >= n){
sum += power[j];
if(power[j] > power[j-n]){
//cout << sum << endl;
break;
}
}
else{
sum += power[j];
if(power[j] > power[j+1]){
//cout << sum << endl;
break;
}
}
}
}
if(sum > max){
max = sum;
}
}
for(int i = 0; i < n; i++){
int index = -1;
int power2[m];
for(int j = 0; j < n; j++){
if(j != i){
index++;
//cout << index << " " << power[j] << " ";
power2[index] = power[j];
}
int sum = 0;
for(int k = index; k < m+index; k++){
//cout << power2[k] << endl;
if(k >= m){
cout << power2[k-m] << " ";
if(k-m+1 >= m){
sum += power2[k-m];
if(power2[k-m] > power2[k-m+1]){
//cout << sum << endl;
break;
}
}
else{
sum += power2[k-m];
if(power2[k-m] > power2[k-m+1]){
//cout << sum << endl;
break;
}
}
}
else{
//cout << power2[k] << " ";
if(k+1 >= m){
sum += power2[k];
if(power2[k] > power2[k-m]){
//cout << sum << endl;
break;
}
}
else{
sum += power2[k];
if(power2[k] > power2[k+1]){
//cout << sum << endl;
break;
}
}
}
}
//cout << endl;
//cout << sum << endl;
if(sum > max){
max = sum;
}
}
//cout << endl;
}
cout << max << endl;
} |
# 2017797, 2024-09-28 14:06:54, PPPP-PPP------------ (35%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=0,tmp;
cin >> n;
int arr[n];
for(int i = 0 ;i < n ; i++)
{
cin >> arr[i];
}
for(int i = 0 ; i < n ; i++)
{
tmp = 0;
for(int j = i ; j < n ; j++)
{
if(arr[j] <= arr[j+1])
{
tmp += arr[j];
}
else
{
tmp += arr[j];
break;
}
}
if (tmp > mx)
{
mx = tmp;
}
}
cout << mx;
return 0;
} | # 2018188, 2024-09-28 14:42:03, --P-P------------P-- (15%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, mx = 0, tmp;
cin >> n;
int arr[n],st;
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
for (int i = 0; i < n; i++)
{
tmp = 0;
st = i;
bool chk = 0;
for (int j = i; j <= n; j++)
{
if (j == n)
{
// if (arr[j] <= arr[0])
// {
// tmp += arr[j];
// }
// else
// {
// tmp += arr[j];
// break;
// }
j = 0;
chk = 1;
}
if(chk ==1)
{
if (j == st)
break;
}
if (arr[j] <= arr[j + 1])
{
tmp += arr[j];
}
else
{
tmp += arr[j];
break;
}
}
if (tmp > mx)
{
mx = tmp;
}
}
cout << mx;
return 0;
} | # 2018228, 2024-09-28 14:44:26, PPPP-PPP------------ (35%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mx=0,tmp;
cin >> n;
int arr[n];
for(int i = 0 ;i < n ; i++)
{
cin >> arr[i];
}
for(int i = 0 ; i < n ; i++)
{
tmp = 0;
for(int j = i ; j < n ; j++)
{
if(arr[j] <= arr[j+1])
{
tmp += arr[j];
}
else
{
tmp += arr[j];
break;
}
}
if (tmp > mx)
{
mx = tmp;
}
}
cout << mx;
return 0;
} |
# 2016218, 2024-09-28 11:24:34, PPPP-PPP------------ (35%)
#include <iostream>
using namespace std;
int main()
{
int input_num;
cin >> input_num;
int num[input_num];
int max = 0;
int sum = 0;
int count = 0;
for(int i = 0; i < input_num; ++i)
{
cin >> num[i];
}
for(int i = 0; i < input_num; ++i)
{
sum = num[i];
int j = i + 1;
while(j != i && j < input_num)
{
if(num[j-1] <= num[j])
{
sum = sum + num[j];
//cout << sum << endl;
if(sum > max)
{
max= sum;
}
}
else
{
break;
}
if(j < input_num)
{
++j;
}
else{
j = 0;
}
}
//}
}
cout << max;
} | # 2016230, 2024-09-28 11:25:55, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main()
{
int input_num;
cin >> input_num;
int num[input_num];
int max = 0;
int sum = 0;
int count = 0;
for(int i = 0; i < input_num; ++i)
{
cin >> num[i];
}
/*for(int i = 0; i < input_num; ++i)
{
sum = num[i];
int j = i + 1;
while(j != i && j < input_num)
{
if(num[j-1] <= num[j])
{
sum = sum + num[j];
//cout << sum << endl;
if(sum > max)
{
max= sum;
}
}
else
{
break;
}
if(j < input_num)
{
++j;
}
else{
j = 0;
}
}
//}
}*/
for(int i = 0; i < input_num; ++i)
{
sum = sum + num[i];
}
cout << sum;
} |
# 2015756, 2024-09-28 10:38:56, PPPP-PPP------------ (35%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,med=0,m=-1;
cin>>n;
vector<pair<int,bool>> arr;
for(int i=0;i<n;++i)
{
cin>>x;
arr.push_back(make_pair(x,false));
}
for(int i=0;i<n;++i) //loop start index
{
med+=arr[i].first;
for(int k=i;k<n-1;++k)
{
if(arr[k].first<=arr[k+1].first && arr[k+1].second==false)
{
med+=arr[k+1].first;
if(med>m) m=med;
arr[k].second = true;
arr[k+1].second = true;
//cout<<i<<" "<<med<<endl;
}
for(int j=0;j<n;++j)
{
if(arr[n].first<arr[0].first)
{
}
}
if(arr[k].first>arr[k+1].first) break;
}
for(auto &j:arr) j.second = false;
med=0;
}
cout<<m;
return 0;
} |
# 2018596, 2024-09-28 15:11:18, PPPP-PPP------------ (35%)
#include <iostream>
#include <cmath>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cctype>
using namespace std;
int main() {
int n; cin >> n;
int arr[(n*2)] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr[i+n] = arr[i];
}
int count = 0, i = 0, mx = 0; bool dup = false;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n+i; j++) {
if (arr[j] < arr[j-1]) {
count += arr[j-1];
break;
}
else count += arr[j-1];
}
mx = max(mx, count);
count = 0;
}
cout << mx;
} |
# 2016106, 2024-09-28 11:13:43, PPPP-PPP------------ (35%)
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
int main(){
int n=0,t=0,maxsum=0;;
cin>>n;
vector<int> v;
for(int i=0;i<n;i++){
cin>>t;
v.push_back(t);
}
for(int i=0;i<n;i++){
int sum=0,b=0;
t=v[i];
for(int j=i+1;j<n;j++){
sum+=t;
if(v[j]>=t){
t=v[j];
}
else {
b=1;
break;
}
}
if(b==0){
for(int j=0;j<i;j++){
sum+=t;
if(v[j]>=t){
t=v[j];
}
else {
b=1;
break;
}
}
}
if(sum>maxsum){
maxsum=sum;
}
}
cout<<maxsum;
return 0;
} |
# 2018590, 2024-09-28 15:11:02, ---------PPPP--P---P (30%)
#include<bits/stdc++.h>
using namespace std;
int arr[510] = {};
vector<int> v;
int main(){
int n,mx = -1000;
cin >> n;
for(int i=0;i<n;i++){
cin >> arr[i];
}
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
int com = indx + 1;
if(com == n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
mx = max(sum,mx);
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
if(indx == k)continue;
int com = indx + 1;
if(com == n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
//cout << sum << ' ';
mx = max(sum,mx);
}//cout << '\n';
}
cout << mx;
return 0;
} | # 2018720, 2024-09-28 15:16:43, ----x-----x------T-- (0%)
#include<bits/stdc++.h>
using namespace std;
int arr[510] = {};
vector<int> v;
int main(){
int n,mx = -1000;
cin >> n;
for(int i=0;i<n;i++){
cin >> arr[i];
}
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
int com = indx + 1;
if(com == n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
mx = max(sum,mx);
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
if(indx == k)continue;
cout << arr[indx] << ' ';
int com = indx + 1;
if(com == k)com += 1;
if(com == n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
//cout << '\n';
mx = max(sum,mx);
}//cout << '\n';
}
cout << mx;
return 0;
} | # 2018742, 2024-09-28 15:17:20, ----x-----x------T-- (0%)
#include<bits/stdc++.h>
using namespace std;
int arr[510] = {};
vector<int> v;
int main(){
int n,mx = -1000;
cin >> n;
for(int i=0;i<n;i++){
cin >> arr[i];
}
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
int com = indx + 1;
if(com == n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
mx = max(sum,mx);
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
if(indx == k)continue;
cout << arr[indx] << ' ';
int com = indx + 1;
if(com == k)com += 1;
if(com >= n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
//cout << '\n';
mx = max(sum,mx);
}//cout << '\n';
}
cout << mx;
return 0;
} | # 2018762, 2024-09-28 15:18:10, ----x-----x------T-- (0%)
#include<bits/stdc++.h>
using namespace std;
int arr[510] = {};
vector<int> v;
int main(){
int n,mx = -1000;
cin >> n;
for(int i=0;i<n;i++){
cin >> arr[i];
}
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
int com = indx + 1;
if(com == n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
mx = max(sum,mx);
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
if(indx == k || indx-1 == k)continue;
cout << arr[indx] << ' ';
int com = indx + 1;
if(com >= n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
//cout << '\n';
mx = max(sum,mx);
}//cout << '\n';
}
cout << mx;
return 0;
} | # 2018808, 2024-09-28 15:19:15, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int arr[510] = {};
vector<int> v;
int main(){
int n,mx = -1000;
cin >> n;
for(int i=0;i<n;i++){
cin >> arr[i];
}
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
int com = indx + 1;
if(com == n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
mx = max(sum,mx);
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
int sum = 0;
for(int j = i;j<n+i;j++){
int indx = j;
if(indx >= n)indx = j-n-1;
if(indx == k || indx-1 == k)continue;
//cout << arr[indx] << ' ';
int com = indx + 1;
if(com >= n)com = 0;
sum += arr[indx];
if(arr[com] < arr[indx])break;
}
//cout << '\n';
mx = max(sum,mx);
}//cout << '\n';
}
cout << mx;
return 0;
} |
# 2018359, 2024-09-28 14:55:11, Compilation error (0%)
include <iostream>
using namespace std;
int main(){
int n;
int arr[500];
int i,j,k;
cin >> n;
for(i=0;i<n;i++){
cin >> arr[i];
}
int max=0;
for(i=0;i<n;i++){
int sum1=arr[i],sum2=arr[i];
int idel;
bool ch;
// clock
ch=0;
for(j=1;j<n;j++){
// index
if(j+i<n){
k=j+i;
}
else{
k=j-(n-i);
}
sum1+=arr[k];
}
// unclock
ch=0;
for(j=1;j<n;j++){
// index
if(i-j>=0){
k=i-j;
}
else{
k=n-j-i;
}
sum2+=arr[k];
}
if(sum1>max){
max=sum1;
}
if(sum2>max){
max=sum2;
}
}
cout << max;
} | # 2018363, 2024-09-28 14:55:42, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int n;
int arr[500];
int i,j,k;
cin >> n;
for(i=0;i<n;i++){
cin >> arr[i];
}
int max=0;
for(i=0;i<n;i++){
int sum1=arr[i],sum2=arr[i];
int idel;
bool ch;
// clock
ch=0;
for(j=1;j<n;j++){
// index
if(j+i<n){
k=j+i;
}
else{
k=j-(n-i);
}
sum1+=arr[k];
}
// unclock
ch=0;
for(j=1;j<n;j++){
// index
if(i-j>=0){
k=i-j;
}
else{
k=n-j-i;
}
sum2+=arr[k];
}
if(sum1>max){
max=sum1;
}
if(sum2>max){
max=sum2;
}
}
cout << max;
} | # 2018394, 2024-09-28 14:57:40, -----------------P-- (5%)
#include <iostream>
using namespace std;
int main(){
int n;
int arr[500];
int i,j,k;
cin >> n;
for(i=0;i<n;i++){
cin >> arr[i];
}
int max=0;
for(i=0;i<n;i++){
int sum1=arr[i],sum2=arr[i];
int idel;
bool ch;
// clock
ch=0;
for(j=1;j<n;j++){
// index
if(j+i<n){
k=j+i;
}
else{
k=j-(n-i);
}
// check 1
if(k>0&&arr[k]<arr[k-1]){
break;
}
else if(arr[k]<arr[n-1]){
break;
}
sum1+=arr[k];
}
// unclock
ch=0;
for(j=1;j<n;j++){
// index
if(i-j>=0){
k=i-j;
}
else{
k=n-j-i;
}
// check 1
if(k<n-1&&arr[k]<arr[k+1]){
break;
}
else if(arr[k]<arr[0]){
break;
}
sum2+=arr[k];
}
if(sum1>max){
max=sum1;
}
if(sum2>max){
max=sum2;
}
}
cout << max;
} | # 2018695, 2024-09-28 15:15:53, ----P---P-----P-PPP- (30%)
#include <iostream>
using namespace std;
int main(){
int num,arr[500],set[500];
int i,j,k;
cin >> num;
for(i=0;i<num;i++){
cin >> arr[i];
}
int max=0;
for(i=0;i<num;i++){
j=i;
k=0;
while(1){
set[k]=arr[j];
if(j==num-1){
j=0;
}
else{
j++;
}
k++;
if(j==i){
break;
}
}
int sum=set[0];
bool ch=0;
for(j=1;j<num;j++){
if(set[j-1]>=0){
k=j-1;
}
else{
k=j-2;
}
if(set[k]>set[j]){
if(!ch){
ch=1;
set[k]=-1;
continue;
}
else{
break;
}
}
sum+=set[j];
}
if(sum>max){
max=sum;
}
}
cout << max;
} |
# 2014856, 2024-09-28 09:10:46, T------------------- (0%)
#include<iostream>
using namespace std;
int main(){
long long n;
int d =2;
cin>>n;
if (n>=2){
while(n>1){
while(d*d > n){
cout<<n<<" ";
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d += 1;
}
} else cout<<"No prime factors for numbers less than 2.";
} | # 2014858, 2024-09-28 09:11:05, T------------------- (0%)
#include<iostream>
using namespace std;
int main(){
long n;
int d =2;
cin>>n;
if (n>=2){
while(n>1){
while(d*d > n){
cout<<n<<" ";
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d += 1;
}
} else cout<<"No prime factors for numbers less than 2.";
} | # 2014865, 2024-09-28 09:11:18, T------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
int d =2;
cin>>n;
if (n>=2){
while(n>1){
while(d*d > n){
cout<<n<<" ";
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d += 1;
}
} else cout<<"No prime factors for numbers less than 2.";
} | # 2014882, 2024-09-28 09:12:31, T------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
int d =2;
cin>>n;
if (n>=2){
while(n>1){
while(d*d > n){
cout<<n<<" ";
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d += 1;
}
} else cout<<"No prime factors for numbers less than 2.";
} | # 2014902, 2024-09-28 09:13:41, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
cout<<"Hello";
} | # 2015032, 2024-09-28 09:30:25, T------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int d = 2;
if (n>=2){
while(n>1){
while(d*d > n){
cout<<n<<" ";
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d += 1;
}
} else cout<<"No prime factors for numbers less than 2.";
} | # 2015037, 2024-09-28 09:30:59, T------------------- (0%)
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
int d = 2;
if (n>=2){
while(n>1){
while(d*d > n){
cout<<n<<" ";
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d += 1;
}
} else cout<<"No prime factors for numbers less than 2.";
} | # 2015064, 2024-09-28 09:33:15, T------------------- (0%)
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
int d = 2;
if (n>=2){
while(n>1){
while(d*d > n){
cout<<n<<" ";
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d += 1;
}
} else cout<<"No prime factors for numbers less than 2.";
} | # 2016345, 2024-09-28 11:35:37, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int amount, sum=0;
cin>>amount;
int num[amount];
for(int i=0; i<amount; i++){
cin>>num[i];
sum += num[i];
}
cout<<sum;
} | # 2016365, 2024-09-28 11:36:58, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int amount, sum=0;
cin>>amount;
int num[amount];
for(int i=0; i<amount; i++){
cin>>num[i];
sum += num[i];
if(num[i]<num[i-1]) break;
}
cout<<sum;
} | # 2016722, 2024-09-28 11:57:40, PP----PP------------ (20%)
#include<iostream>
using namespace std;
int main(){
int amount, sum=0;
cin>>amount;
int num[amount];
for(int i=0; i<amount; i++){
cin>>num[i];
}
for(int i=0; i<amount; i++){
sum += num[i];
if(num[i]>num[i+1]) break;
}
cout<<sum;
} |
# 2018151, 2024-09-28 14:38:48, PPPP---------------- (20%)
#include <iostream>
#include <string>
using namespace std;
int main(){
int N,p[500],tp[500]={},firstcut,secondcut,cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
cfirst=0;
for(int j=0; j<N; j++){// j is run N times
if(p[i+j]>p[i+j+1]){
cfirst++;
if(cfirst==1){
firstcut = p[i+j];
tp[i]+=p[i+j];
if(p[i+j]>p[i+j+2]){
break;
}
j++;
}
else if(cfirst>1){
tp[i]+=p[i+j];
break;
}
}
else{
tp[i]+=p[i+j];
}
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018202, 2024-09-28 14:42:54, PPPP---------------- (20%)
#include <iostream>
#include <string>
using namespace std;
int main(){
int N,p[500],tp[500]={},firstcut,secondcut,cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
cfirst=0;
for(int j=0; j<N; j++){// j is run N times
if(p[i+j]>p[i+j+1]){
cfirst++;
if(cfirst==1){
firstcut = p[i+j];
tp[i]+=p[i+j];
if(p[i+j]>p[i+j+2]){
break;
}
j++;
}
else if(cfirst>1){
tp[i]+=p[i+j];
break;
}
}
else{
tp[i]+=p[i+j];
}
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018246, 2024-09-28 14:46:10, PPPP---------------- (20%)
#include <iostream>
#include <string>
using namespace std;
int main(){
int N,p[500],tp[500]={},firstcut,secondcut,cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
cfirst=0;
for(int j=0; j<N-1; j++){// j is run N times
if(p[i+j]>p[i+j+1]){
cfirst++;
if(cfirst==1){
firstcut = p[i+j];
tp[i]+=p[i+j];
if(p[i+j]>p[i+j+2]){
break;
}
j++;
}
else if(cfirst>1){
tp[i]+=p[i+j];
break;
}
}
else{
tp[i]+=p[i+j];
}
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018396, 2024-09-28 14:57:54, PPPP---------------- (20%)
#include <iostream>
#include <string>
using namespace std;
int main(){
int N,p[500],tp[500]={},firstcut,secondcut,cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
cfirst=0;
for(int j=0; j<N-1; j++){// j is run N times
if(p[i+j]>p[i+j+1]){
cfirst++;
if(cfirst==1){
firstcut = p[i+j];
tp[i]+=p[i+j];
if(p[i+j]>p[i+j+2]){
break;
}
j++;
}
else if(cfirst>1){
tp[i]+=p[i+j];
break;
}
}
else{
tp[i]+=p[i+j];
}
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018411, 2024-09-28 14:59:24, PPPP---------------- (20%)
#include <iostream>
#include <string>
using namespace std;
int main(){
int N,p[500]={},tp[500]={},cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
cfirst=0;
for(int j=0; j<N-1; j++){// j is run N times
if(p[i+j]>p[i+j+1]){
cfirst++;
if(cfirst==1){
tp[i]+=p[i+j];
if(p[i+j]>p[i+j+2]){
break;
}
j++;
}
else if(cfirst>1){
tp[i]+=p[i+j];
break;
}
}
else{
tp[i]+=p[i+j];
}
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018545, 2024-09-28 15:09:03, -------------------- (0%)
#include <iostream>
#include <string>
using namespace std;
int main(){
int N,p[500]={},tp[500]={},cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
if(p[i]>p[i+1]){
}
else{
tp[i]+=p[i];
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018551, 2024-09-28 15:09:27, -------------------- (0%)
#include <iostream>
#include <string>
using namespace std;
int main(){
int N,p[500]={},tp[500]={},cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
if(p[i]>p[i+1]){
break;
}
else{
tp[i]+=p[i];
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018560, 2024-09-28 15:09:47, PPPP---------------- (20%)
#include <iostream>
using namespace std;
int main(){
int N,p[500]={},tp[500]={},cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
cfirst=0;
for(int j=0; j<N; j++){// j is run N times
if(p[i+j]>p[i+j+1]){
cfirst++;
if(cfirst==1){
tp[i]+=p[i+j];
if(p[i+j]>p[i+j+2]){
break;
}
j++;
}
else if(cfirst>1){
tp[i]+=p[i+j];
break;
}
}
else{
tp[i]+=p[i+j];
}
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018607, 2024-09-28 15:12:08, PPPP---------------- (20%)
#include <iostream>
using namespace std;
int main(){
int N,p[500]={},tp[500]={},cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
cfirst=0;
for(int j=0; j<N; j++){// j is run N times
if(p[i+j]>p[i+j+1]){
cfirst++;
if(cfirst==1){
tp[i]+=p[i+j];
if(p[i+j]>p[i+j+1]){
break;
}
j++;
}
else if(cfirst>1){
tp[i]+=p[i+j];
break;
}
}
else{
tp[i]+=p[i+j];
}
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} | # 2018615, 2024-09-28 15:12:29, PPPP---------------- (20%)
#include <iostream>
using namespace std;
int main(){
int N,p[500]={},tp[500]={},cfirst=0,xam=0;
cin>>N;
for(int i=0; i<N; i++){
cin>>p[i];
p[i+N] = p[i];
}
for(int i=0; i<N; i++){ //start at
cfirst=0;
for(int j=0; j<N; j++){// j is run N times
if(p[i+j]>p[i+j+1]){
cfirst++;
if(cfirst==1){
tp[i]+=p[i+j];
if(p[i+j]>p[i+j+2]){
break;
}
j++;
}
else if(cfirst>1){
tp[i]+=p[i+j];
break;
}
}
else{
tp[i]+=p[i+j];
}
}
}
for(int i=0; i<N; i++){
xam = max(xam,tp[i]);
}
cout<<xam;
} |
# 2017548, 2024-09-28 13:40:07, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
}
cout << total << endl;
} | # 2017767, 2024-09-28 14:04:53, -------------------- (0%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
}
total -= c[2];
cout << total << endl;
} | # 2017779, 2024-09-28 14:05:25, -------------------- (0%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
}
total -= c[3];
cout << total << endl;
} | # 2017787, 2024-09-28 14:05:44, -------------------- (0%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
}
total -= c[4];
cout << total << endl;
} | # 2017792, 2024-09-28 14:06:07, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
}
cout << total << endl;
} | # 2017793, 2024-09-28 14:06:10, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
}
cout << total << endl;
} | # 2017961, 2024-09-28 14:20:58, PP----PP------------ (20%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
if (c[i] > c[i+1]) {
break;
}
}
cout << total << endl;
} | # 2018282, 2024-09-28 14:49:59, -------------------- (0%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
if (c[i] > c[i+1]) {
break;
}
}
total += c[3];
cout << total << endl;
} | # 2018291, 2024-09-28 14:50:30, PP----PP------------ (20%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
if (c[i] > c[i+1]) {
break;
}
}
cout << total << endl;
} | # 2018802, 2024-09-28 15:19:08, PP----PP------------ (20%)
#include <iostream>
#include <cmath>
using namespace std;
int main () {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int total = 0;
for (int i = 0; i < n; ++i) {
total += c[i];
if (c[i] > c[i+1]) {
break;
}
}
cout << total << endl;
} |
# 2017838, 2024-09-28 14:10:12, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int pra[n];
int sum ;
for (int i = 0; i < n; ++i)
{
cin>> pra[n];
}
int sum ;
for (int i = 0; i < n; ++i)
{
sum+= pra[n];
}
cout << sum;
} | # 2017850, 2024-09-28 14:10:59, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int pra[n];
int sum = 0 ;
for (int i = 0; i < n; ++i)
{
cin>> pra[n];
}
for (int i = 0; i < n; ++i)
{
sum+= pra[n];
}
cout << sum;
} | # 2017949, 2024-09-28 14:19:44, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int pra[n];
int sum = 0 ;
for (int i = 0; i < n; ++i)
{
cin>> pra[i];
}
for (int i = 1; i < n; ++i)
{
sum+=pra[0];
if (pra[i] > pra[i-1])
{
sum+= pra[i];
}else {
break;
}
}
cout << sum;
} | # 2017981, 2024-09-28 14:22:33, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int pra[n];
int sum = 0 ;
for (int i = 0; i < n; ++i)
{
cin>> pra[i];
}
sum+=pra[0];
for (int i = 1; i < n; ++i)
{
cout <<pra[i];
if (pra[i] > pra[i-1])
{
sum+= pra[i];
}else {
break;
}
}
cout << sum;
} | # 2018030, 2024-09-28 14:25:59, PP----PP------------ (20%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int pra[n];
int sum = 0 ;
for (int i = 0; i < n; ++i)
{
cin>> pra[i];
}
sum+=pra[0];
for (int i = 1; i < n; ++i)
{
if (pra[i] >= pra[i-1])
{
sum+= pra[i];
}else {
break;
}
}
cout << sum;
} |
# 2015827, 2024-09-28 10:46:56, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int n; cin >> n;
int a[n];
int sum = 0;
int sumk[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
sumk[i] = 0;
}
for(int i = 0; i < n-1; i++) {
if(i == 0) {
if(a[n-1] <= a[0]) sum += a[n-1];
else {sum += a[n-1];break;}
if(a[0] <= a[1]) sum += a[0];
else {sum += a[0];break;}
} else if(a[i] <= a[i+1]) {
sum += a[i];
} else if(a[i] > a[i+1]) {
sum += a[i];
break;
}
}
int max = sum;
for(int j = 0; j < n; j++) {
if(j==0) {
for(int i = 1; i < n-1; i++) {
if(i == 1) {
if(a[n-1] <= a[1]) sumk[j] += a[n-1];
else {sumk[j] += a[n-1];break;}
if(a[1] <= a[2]) sumk[j] += a[1];
} else if(a[i] <= a[i+1]) {
sumk[j] += a[i];
} else if(a[i] > a[i+1]) {
sumk[j] += a[i];
break;
}
}
} else if(j==n-1) {
for(int i = 0; i < n-2; i++) {
if(i == 0) {
if(a[n-2] <= a[0]) sumk[j] += a[n-2];
else {sumk[j] += a[n-2]; break;}
if(a[0] <= a[1]) sumk[j] += a[0];
else {sumk[j] += a[0]; break;}
} else if(a[i] <= a[i+1]) {
sumk[j] += a[i];
} else if(a[i] > a[i+1]) {
sumk[j] += a[i];
break;
}
}
} else {
for(int i = 0; i < n-1 && i != j; i++) {
if(i != j-1) {
if(i == 0) {
if(a[n-1] <= a[0]) sumk[j] += a[n-1];
else break;
if(a[0] <= a[1]) sumk[j] += a[0];
else break;
} else if(a[i] <= a[i+1]) {
sumk[j] += a[i];
} else if(a[i] > a[i+1]) {
sumk[j] += a[i];
break;
}
} else if(i == j-1) {
if(a[j-1] <= a[j+1]) {
sumk[j] += a[j+1];
} else {sumk[j] += a[j+1]; break;}
}
}
}
if(sumk[j] > max) max = sumk[j];
}
cout << max;
} | # 2016067, 2024-09-28 11:09:59, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int n; cin >> n;
int a[n];
int sum = 0;
int sumk[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
sumk[i] = 0;
}
for(int i = 0; i < n-1; i++) {
if(i == 0) {
if(a[n-1] <= a[0]) sum += a[n-1];
else {sum += a[n-1];break;}
if(a[0] <= a[1]) sum += a[0];
else {sum += a[0];break;}
} else if(a[i] <= a[i+1]) {
sum += a[i];
} else if(a[i] > a[i+1]) {
sum += a[i];
break;
}
}
int max = sum;
for(int j = 0; j < n; j++) {
if(j== 0) {
for(int i = 1; i < n-1; i++) {
if(i == 1) {
if(a[n-1] <= a[1]) sumk[j] += a[n-1];
else {sumk[j] += a[n-1];break;}
if(a[1] <= a[2]) sumk[j] += a[1];
else {sumk[j] += a[1]; break;}
} else if(a[i] <= a[i+1]) {
sumk[j] += a[i];
} else if(a[i] > a[i+1]) {
sumk[j] += a[i];
break;
}
}
} else if(j == n-1) {
for(int i = 0; i < n-2; i++) {
if(i == 0) {
if(a[n-2] <= a[0]) sumk[j] += a[n-2];
else {sumk[j] += a[n-2]; break;}
if(a[0] <= a[1]) sumk[j] += a[0];
else {sumk[j] += a[0]; break;}
} else if(a[i] <= a[i+1]) {
sumk[j] += a[i];
} else if(a[i] > a[i+1]) {
sumk[j] += a[i];
break;
}
}
} else if(j == 1) {
for(int i = 0; i < n-1; i++) {
if(i == 0) {
if(a[n-1] <= a[0]) sumk[j] += a[n-1];
else {sumk[j]+=a[n-1];break;}
if(a[0] <= a[2]) sumk[j] += a[0];
else {sumk[j]+=a[0];break;}
} else if(a[i] <= a[i+1] && i != 1) {
sumk[j] += a[i];
} else if(a[i] > a[i+1] && i != 1) {
sumk[j] += a[i];
break;
}
}
} else {
for(int i = 0; i < n-1; i++) {
if(i != j-1 && i != j) {
if(i == 0) {
if(a[n-1] <= a[0]) sumk[j] += a[n-1];
else {sumk[j]+=a[n-1];break;}
if(a[0] <= a[1]) sumk[j] += a[0];
else {sumk[j]+=a[0];break;}
} else if(a[i] <= a[i+1]) {
sumk[j] += a[i];
} else if(a[i] > a[i+1]) {
sumk[j] += a[i];
break;
}
} else if(i == j-1) {
if(a[j-1] <= a[j+1]) {
sumk[j] += a[j-1];
} else {sumk[j] += a[j-1]; break;}
}
}
}
if(sumk[j] > max) max = sumk[j];
}
cout << max;
} | # 2016184, 2024-09-28 11:21:59, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int n; cin >> n;
int a[n];
int sum = 0;
int sumk[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
sumk[i] = 0;
}
for(int i = 0; i < n-1; i++) {
if(i == 0) {
if(a[n-1] <= a[0]) sum += a[n-1];
else {sum += a[n-1];break;}
if(a[0] <= a[1]) sum += a[0];
else {sum += a[0];break;}
} else if(a[i] <= a[i+1]) {
sum += a[i];
} else if(a[i] > a[i+1]) {
sum += a[i];
break;
}
}
cout << sum;
} | # 2016204, 2024-09-28 11:23:24, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int n; cin >> n;
int a[n];
int sum = 0;
//int sumk[n];
//for(int i = 0; i < n; i++) {
//cin >> a[i];
//sumk[i] = 0;
//}
for(int i = 0; i < n; i++) {
if(i == n-1) {
if(a[n-1] <= a[0]) sum += a[n-1];
else {sum += a[n-1];break;}
} else if(a[i] <= a[i+1]) {
sum += a[i];
} else if(a[i] > a[i+1]) {
sum += a[i];
break;
}
}
cout << sum;
} | # 2016207, 2024-09-28 11:23:46, PP----PP------------ (20%)
#include<iostream>
using namespace std;
int main() {
int n; cin >> n;
int a[n];
int sum = 0;
int sumk[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
//sumk[i] = 0;
}
for(int i = 0; i < n; i++) {
if(i == n-1) {
if(a[n-1] <= a[0]) sum += a[n-1];
else {sum += a[n-1];break;}
} else if(a[i] <= a[i+1]) {
sum += a[i];
} else if(a[i] > a[i+1]) {
sum += a[i];
break;
}
}
cout << sum;
} |
# 2015893, 2024-09-28 10:54:41, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int N[1000];
int n;
long long int smax=0;
long int sm[1000];
cin >>n;
for(int i=0;i<n;i++){
cin>>N[i];
}
for(int i=0;i<n;i++){
if(N[i]<N[i+1])
{
smax+=N[i];
}
}
cout<<smax;
} | # 2015929, 2024-09-28 10:57:09, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int N[1000];
int n;
long long int smax=0;
long int sm[1000];
cin >>n;
for(int i=0;i<n;i++){
cin>>N[i];
}
for(int i=0;i<n;i++){
if(N[i]<N[i+1])
{
smax+=N[i];
}
else{
break;
}
}
cout<<smax;
} | # 2015964, 2024-09-28 11:00:04, PP----PP------------ (20%)
#include <iostream>
using namespace std;
int main(){
int N[1000];
int n;
long long int smax=0;
long int sm[1000];
cin >>n;
for(int i=0;i<n;i++){
cin>>N[i];
}
for(int i=0;i<n;i++){
if(N[i]<=N[i+1])
{
smax+=N[i];
}
else{
smax+=N[i];
break;
}
}
cout<<smax;
} | # 2016075, 2024-09-28 11:10:40, PP----PP------------ (20%)
#include <iostream>
using namespace std;
int main(){
int N[1000];
int n;
long long int smax[1000]={0};
long long int s=0;
cin >>n;
for(int i=0;i<n;i++){
cin>>N[i];
}
for(int j=0;j<n;j++){
for(int i=0;i<n;i++){
if(N[i]<=N[i+1])
{
smax[j]+=N[i];
}
else{
smax[j]+=N[i];
break;
}
}
s=max(s,smax[j]);
}
cout<<s;
} |
# 2015688, 2024-09-28 10:32:24, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int power[n+5];
//iput prakum
for(int i=0;i<n;i++){
cin >> power[n];
}
// cout << sum << endl;
int sum = 0;
for(int i=0;i<n;i++){
if(sum <= power[i+1]){
sum += power[i+1];
}else{
break;
}
}
cout << sum;
} | # 2015766, 2024-09-28 10:40:33, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
void testprint(int a[],int n){
for(int i=0;i<n;i++){
cout << a[i]<< endl;
}
}
int main(){
int n;
cin >> n;
int power[n];
//iput prakum
for(int i=0;i<n;i++){
cin >> power[i];
}
//testprint(power,n);
//calculate power
int sum = 0;
//cout << sum << endl;
for(int i=0;i<n;i++){
if(power[i] <= power[i+1]){
sum += power[i];
}else{
break;
}
//cout << sum << " ";
}
cout << sum;
} | # 2015816, 2024-09-28 10:45:35, PP----PP------------ (20%)
#include <bits/stdc++.h>
using namespace std;
void testprint(int a[],int n){
for(int i=0;i<n;i++){
cout << a[i]<< endl;
}
}
int main(){
int n;
cin >> n;
int power[n];
//iput prakum
for(int i=0;i<n;i++){
cin >> power[i];
}
//testprint(power,n);
//calculate power
int sum = 0;
for(int i=0;i<n;i++){
if(power[i] <= power[i+1]){
sum += power[i];
}else{
sum += power[i];
break;
}
//cout << sum << " ";
}
// while(true){
// }
cout << sum;
} |
# 2015715, 2024-09-28 10:34:10, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std ;
int main(){
int n ;
cin >> n ;
int x[n];
for(int i=0;i<n;++i){
cin >> x[i] ;
}
int sum = 0 ;
for(int i=0;i<n;++i){
sum += x[i] ;
}
cout << sum ;
} | # 2015790, 2024-09-28 10:43:28, PP----PP------------ (20%)
#include <bits/stdc++.h>
using namespace std ;
int main(){
int n ;
cin >> n ;
int x[n];
for(int i=0;i<n;++i){
cin >> x[i] ;
}
int sum = x[0] ;
for(int i=1;i<n-1;++i){
if(x[i] >= x[i-1] ){
sum += x[i] ;
}else{
break ;
}
}
cout << sum ;
} |
# 2017498, 2024-09-28 13:35:17, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
;
int main()
{
int n;
cin >> n;
int a[100], x = 0, sum, ch[100], ans = -1,end=0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
for (int i = 1; i <= n; i++)
{
memset(ch, 0, sizeof(ch));
sum = 0;
x = 0;
sum += a[i];
for (int j = i; j < n; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
}
// else if(x==0)
// {
// x=1;
// }
// }
// for (int j = 1; j < i - 1; j++)
// {
// if (ch[j] == 0 && a[j] <= a[j + 1])
// {
// sum += a[j + 1];
// ch[j]++;
// }
// }
ans = max(ans, sum);
}
cout << ans;
return 0;
}
/*
1000000000
*/ | # 2017507, 2024-09-28 13:36:09, ---xxxxxxxxxxxxxxxxx (0%)
#include <bits/stdc++.h>
using namespace std;
;
int main()
{
int n;
cin >> n;
int a[100], x = 0, sum, ch[100], ans = -1,end=0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
for (int i = 1; i <= n; i++)
{
memset(ch, 0, sizeof(ch));
sum = 0;
x = 0;
sum += a[i];
for (int j = i; j < n; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
}
// else if(x==0)
// {
// x=1;
// }
// }
// for (int j = 1; j < i - 1; j++)
// {
// if (ch[j] == 0 && a[j] <= a[j + 1])
// {
// sum += a[j + 1];
// ch[j]++;
// }
}
ans = max(ans, sum);
}
cout << ans;
return 0;
}
/*
1000000000
*/ | # 2018128, 2024-09-28 14:36:29, PPPxxxxxxxxxxxxxxxxx (15%)
#include <bits/stdc++.h>
using namespace std;
;
int main()
{
int n;
cin >> n;
int a[100], x = 0, sum, ch[100], ans = -1, end = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
ch[j] = 0;
sum = 0;
x = 0;
sum += a[i];
for (int j = i; j < n; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
}
else break;
// else if(x==0)
// {
// x=1;
// }
// }
// for (int j = 1; j < i - 1; j++)
// {
// if (ch[j] == 0 && a[j] <= a[j + 1])
// {
// sum += a[j + 1];
// ch[j]++;
// }
}
ans = max(ans, sum);
}
cout << ans;
return 0;
}
/*
1000000000
*/ | # 2018210, 2024-09-28 14:43:18, --Pxxxxxxxxxxxxxxxxx (5%)
#include <bits/stdc++.h>
using namespace std;
;
int main()
{
int n;
cin >> n;
int a[100], x = 0, sum, ch[100], ans = -1, end = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
for (int i = 1; i <= n; i++)
{
for (int j = 0; j <= n; j++)
ch[j] = 0;
sum = 0;
x = 0;
end = 0;
sum += a[i];
for (int j = i; j < n; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
end = a[j];
}
else
break;
}
a[0] = end;
if (i != 2)
{
for (int j = 0; j < i - 1; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
end = ch[j];
}
else
break;
}
}
ans = max(ans, sum);
}
cout << ans;
return 0;
}
/*
1000000000
*/ | # 2018268, 2024-09-28 14:47:55, PPPxxxxxxxxxxxxxxxxx (15%)
#include <bits/stdc++.h>
using namespace std;
;
int main()
{
int n;
cin >> n;
int a[100], x = 0, sum, ch[100], ans = -1, end = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
a[0] = a[n];
for (int i = 1; i <= n; i++)
{
for (int j = 0; j <= n; j++)
ch[j] = 0;
sum = 0;
x = 0;
int go = 1;
sum += a[i];
for (int j = i; j < n; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
}
else
{
go = 0;
break;
}
}
if (go == 1)
{
for (int j = 0; j < i - 1; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
}
else
{
go = 0;
break;
}
}
}
ans = max(ans, sum);
}
cout << ans;
return 0;
}
/*
1000000000
*/ | # 2018508, 2024-09-28 15:06:01, ---xxxxxxxxxxxxxxxxx (0%)
#include <bits/stdc++.h>
using namespace std;
;
int main()
{
int n;
cin >> n;
int a[100], x = 0, sum, ch[100], ans = -1, end = 0, b[100];
for (int i = 1; i <= n; i++)
{
cin >> b[i];
}
b[0] = b[n];
for (int i = 1; i <= n; i++)
{
for (int j = 0; j <= n; j++)
ch[j] = 0;
for (int j = 0; j <= n; j++)
a[j] = b[j];
sum = 0;
x = 1;
int go = 1;
sum += a[i];
for (int j = i; j < n; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
}
else
{
if (x == 1)
{
if (j + 1 == n)
{
a[0] == a[j];
}
else
a[j + 1] == a[j];
x = 0;
}
else
{
go = 0;
break;
}
}
}
if (go == 1)
{
for (int j = 0; j < i - 1; j++)
{
if (ch[j] == 0 && a[j] <= a[j + 1])
{
sum += a[j + 1];
ch[j]++;
}
else
{
if (x == 1)
{
a[j + 1] == a[j];
x = 0;
}
else
{
go = 0;
break;
}
}
}
}
// cout << "\n"
// << sum;
ans = max(ans, sum);
}
// cout << "\n";
cout << ans;
return 0;
}
/*
1000000000
*/ |
# 2018193, 2024-09-28 14:42:22, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> data;
for(int i = 0; i < n; i++){
int a;
cin >> a;
data.push_back(a);
}
vector<int>result;
int sum = 0;
sort(data.begin(), data.end());
for(int i = 0; i < data.size(); i++){
if(data[i] >= data[i + 1]){
sum += data[i];
}
}
cout << sum;
} | # 2018493, 2024-09-28 15:04:59, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> data;
for(int i = 0; i < n; i++){
int a;
cin >> a;
data.push_back(a);
}
vector<int>result;
int sum = 0;
int spare = 0;
vector<int> new_data;
int min_data = *min_element(data.begin(), data.end());
for(int i = 0; i < data.size(); i++){
if(data[i] == min_data){
spare = i;
new_data.push_back(data[i]);
for(int j = i + 1; j < data.size(); j++){
new_data.push_back(data[j]);
}
}
}
for(int i = 0; i < spare; i++){
new_data.push_back(data[i]);
}
for(int i = 0; i < new_data.size(); i++){
if(new_data[i] >= new_data[i - 1]){
sum += new_data[i];
}else{
break;
}
}
cout << sum << endl;
for(int i = 0; i < new_data.size(); i++){
cout << new_data[i] << " ";
}
} | # 2018622, 2024-09-28 15:12:48, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> data;
for(int i = 0; i < n; i++){
int a;
cin >> a;
data.push_back(a);
}
vector<int>result;
int sum = 0;
int spare = 0;
vector<int> new_data;
int min_data = *min_element(data.begin(), data.end());
for(int i = 0; i < data.size(); i++){
if(data[i] == min_data){
spare = i;
new_data.push_back(data[i]);
for(int j = i + 1; j < data.size(); j++){
new_data.push_back(data[j]);
}
}
}
for(int i = 0; i < spare; i++){
new_data.push_back(data[i]);
}
for(int i = 0; i < new_data.size(); i++){
if(new_data[i] >= new_data[i - 1]){
sum += new_data[i];
}else{
break;
}
}
result.push_back(sum);
for(int i = 0; i < new_data.size(); i++){
vector<int> spare_data;
int spare_sum = 0;
for(int j = 0; j < new_data.size(); j++){
if(j == i){
continue;
}else{
spare_data.push_back(new_data[j]);
}
}
for(int i = 0; i < spare_data.size(); i++){
if(spare_data[i] >= spare_data[i - 1]){
spare_sum += spare_data[i];
}else{
break;
}
}
result.push_back(spare_sum);
}
cout << *max_element(result.begin(), result.end()) << endl;
for(int i = 0; i < new_data.size(); i++){
cout << new_data[i] << " ";
}
} | # 2018631, 2024-09-28 15:13:05, --P-P------------P-- (15%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> data;
for(int i = 0; i < n; i++){
int a;
cin >> a;
data.push_back(a);
}
vector<int>result;
int sum = 0;
int spare = 0;
vector<int> new_data;
int min_data = *min_element(data.begin(), data.end());
for(int i = 0; i < data.size(); i++){
if(data[i] == min_data){
spare = i;
new_data.push_back(data[i]);
for(int j = i + 1; j < data.size(); j++){
new_data.push_back(data[j]);
}
}
}
for(int i = 0; i < spare; i++){
new_data.push_back(data[i]);
}
for(int i = 0; i < new_data.size(); i++){
if(new_data[i] >= new_data[i - 1]){
sum += new_data[i];
}else{
break;
}
}
result.push_back(sum);
for(int i = 0; i < new_data.size(); i++){
vector<int> spare_data;
int spare_sum = 0;
for(int j = 0; j < new_data.size(); j++){
if(j == i){
continue;
}else{
spare_data.push_back(new_data[j]);
}
}
for(int i = 0; i < spare_data.size(); i++){
if(spare_data[i] >= spare_data[i - 1]){
spare_sum += spare_data[i];
}else{
break;
}
}
result.push_back(spare_sum);
}
cout << *max_element(result.begin(), result.end()) << endl;
} |
# 2017481, 2024-09-28 13:32:35, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin>>arr[i];
}
int sum =0;
for (int i = 0; i < n; i++)
{
sum+=arr[i];
}
cout<<sum;
} | # 2017549, 2024-09-28 13:40:11, TTTTTTTTTTTTTTTTTTTT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
int sum =0;
int idx = startidx;
while (true)
{
sum+=arr[idx];
idx++;
if(idx==n){
idx=0;
}
}
cout<<sum;
} | # 2017555, 2024-09-28 13:41:38, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
while (timer--)
{
sum+=arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2017727, 2024-09-28 14:02:09, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{ if(arr[idx]>prev){
break;
}
sum+=arr[idx];
idx++;
if(idx==count){
idx=0;
}
prev = arr[idx];
}
cout<<sum;
} | # 2017780, 2024-09-28 14:05:26, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{ if(arr[idx]>prev){
break;
}
if(idx = skipidx){
continue;
}
sum+=arr[idx];
idx++;
if(idx==count){
idx=0;
}
prev = arr[idx];
}
cout<<sum;
} | # 2017791, 2024-09-28 14:06:06, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{ if(arr[idx]>prev){
break;
}
if(idx = skipidx){
continue;
}
sum+=arr[idx];
idx++;
if(idx==count){
idx=0;
}
prev = arr[idx];
}
cout<<sum;
} | # 2017821, 2024-09-28 14:08:41, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{ if(arr[idx]>prev){
break;
}
if(idx == skipidx){
continue;
}
sum+=arr[idx];
idx++;
if(idx==count){
idx=0;
}
prev = arr[idx];
}
cout<<sum;
} | # 2017876, 2024-09-28 14:12:25, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{ if(arr[idx]>prev){
break;
}
if(idx == skipidx){
idx++;
continue;
}
sum+=arr[idx];
idx++;
if(idx==count){
idx=0;
}
prev = arr[idx];
}
cout<<sum;
} | # 2017904, 2024-09-28 14:14:24, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{ if(arr[idx]>prev){
break;
}
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
sum+=arr[idx];
idx++;
if(idx==count){
idx=0;
}
prev = arr[idx];
}
cout<<sum;
} | # 2017928, 2024-09-28 14:17:07, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{ if(arr[idx]>prev){
break;
}
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2017946, 2024-09-28 14:19:23, --P----------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{ if(arr[idx]<prev){
break;
}
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2017967, 2024-09-28 14:21:34, --P----------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
if(arr[idx]<prev){
break;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2018008, 2024-09-28 14:24:09, --P----------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
if(arr[idx]<prev){
break;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2018413, 2024-09-28 14:59:29, --P----------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
break;
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
if(arr[idx]<prev){
break;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2018546, 2024-09-28 15:09:04, --P----------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
}
}
if(arr[n-1] < minarr){
minarr = arr[n-1];
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
if(arr[idx]<prev){
break;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2018584, 2024-09-28 15:10:42, --P----------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
skipidx = max(skipidx,i);
break;
}
}
if(arr[n-1] < minarr){
minarr = arr[n-1];
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
if(arr[idx]<prev){
break;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2018611, 2024-09-28 15:12:20, --P----------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
minarr = arr[i];
startidx = i;
}
}
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
skipidx = max(skipidx,i);
}
}
if(arr[n-1] < minarr){
minarr = arr[n-1];
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
if(arr[idx]<prev){
break;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2018673, 2024-09-28 15:15:01, xxx-xxxxxxxxxxxxxxxx (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
skipidx = max(skipidx,i);
}
}
if(arr[n-1] < minarr){
minarr = arr[n-1];
}
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
if(i!=skipidx){
minarr = arr[i];
startidx = i;
}
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
if(arr[idx]<prev){
break;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} | # 2018763, 2024-09-28 15:18:11, xxxxxxxxxxxxxxxxxxxx (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int startidx;
int skipidx = -1;
int minarr = INT_MAX;
for (int i = 1; i < n; i++)
{
if(arr[i-1] > arr[i]){
skipidx = i;
skipidx = max(skipidx,i);
}
}
if(arr[n-1] < minarr){
minarr = arr[n-1];
}
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if(arr[i]<minarr){
if(i!=skipidx){
minarr = arr[i];
startidx = i;
}else{
startidx = i+1;
}
}
}
int sum =0;
int idx = startidx;
int count = n ;
int timer = n;
int prev = arr[idx];
while (timer--)
{
if(idx == skipidx){
idx++;
prev = arr[idx];
continue;
}
if(arr[idx]<prev){
break;
}
sum+=arr[idx];
prev = arr[idx];
idx++;
if(idx==count){
idx=0;
}
}
cout<<sum;
} |
# 2017859, 2024-09-28 14:11:32, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 10;
} | # 2017865, 2024-09-28 14:11:43, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 11;
} | # 2018139, 2024-09-28 14:37:32, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 12;
} | # 2018142, 2024-09-28 14:37:43, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 14;
} | # 2018221, 2024-09-28 14:43:50, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 15;
} | # 2018223, 2024-09-28 14:44:02, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 16;
} | # 2018226, 2024-09-28 14:44:12, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 20;
} | # 2018264, 2024-09-28 14:47:48, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 21;
} | # 2018269, 2024-09-28 14:47:59, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int Marble[N];
cout << 2;
} | # 2018385, 2024-09-28 14:57:08, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Marble[N];
for(int i=0; i < N; ++i){
cin >> Marble[i];
}
int sum = 0;
for(int i=0; i < N; ++i){
sum += Marble[i];
}
cout << sum;
} | # 2018572, 2024-09-28 15:10:10, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Marble[N];
cin >> Marble[1];
for(int i=2; i < N; ++i){
cin >> Marble[i];
}
cin >> Marble[0];
int sum = 0;
for(int i=0; i < N; ++i){
if(Marble[i] > Marble[i+1]){
break;
}
sum += Marble[i];
}
cout << sum;
} | # 2018587, 2024-09-28 15:10:50, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Marble[N];
cin >> Marble[1];
for(int i=2; i < N; ++i){
cin >> Marble[i];
}
cin >> Marble[0];
int sum = 0;
for(int i=0; i < N; ++i){
if(Marble[i] > Marble[i+1]){
break;
}
sum += Marble[i];
}
cout << sum;
} | # 2018598, 2024-09-28 15:11:34, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Marble[N];
cin >> Marble[1];
for(int i=2; i < N; ++i){
cin >> Marble[i];
}
cin >> Marble[0];
int sum = 0;
for(int i=0; i < N; ++i){
if(Marble[i] > Marble[i+1]){
continue;
}
sum += Marble[i];
}
cout << sum;
} | # 2018660, 2024-09-28 15:14:35, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Marble[N];
cin >> Marble[1];
for(int i=2; i < N; ++i){
cin >> Marble[i];
}
cin >> Marble[0];
int sum = 0;
bool a ==false;
for(int i=0; i < N; ++i){
if(Marble[i] > Marble[i+1]&& a){
break;
a == true;
}
sum += Marble[i];
}
cout << sum;
} | # 2018809, 2024-09-28 15:19:20, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Marble[N];
cin >> Marble[1];
for(int i=2; i < N; ++i){
cin >> Marble[i];
}
cin >> Marble[0];
int sum = 0;
for(int i=0; i < N; ++i){
bool a; a == true;
if(Marble[i] > Marble[i+1] && a ){
break;
a == true;
}
sum += Marble[i];
}
cout << sum;
} | # 2018832, 2024-09-28 15:19:53, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Marble[N];
cin >> Marble[1];
for(int i=2; i < N; ++i){
cin >> Marble[i];
}
cin >> Marble[0];
int sum = 0;
for(int i=0; i < N; ++i){
bool a; a == true;
if(Marble[i] > Marble[i+1] && a ){
break;
}
a == false;
sum += Marble[i];
}
cout << sum;
} |
# 2017830, 2024-09-28 14:09:41, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int N,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
int sum;
while(i<N) {
sum = power[i] +sum;
i++;
}
cout << sum;
} | # 2017844, 2024-09-28 14:10:46, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main() {
int N,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
i=0;
int sum=0;
while(i<N) {
sum = power[i] +sum;
i++;
}
cout << sum;
} | # 2017890, 2024-09-28 14:13:27, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int N,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
i=0;
int sum=0;
while(i<N) {
if(power[i+1] > power[i]){
break;
}else{
sum = power[i] +sum;
}
i++;
}
cout << sum;
} | # 2017958, 2024-09-28 14:20:37, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int N,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
power[N] =0;
i=0;
int sum=0;
while(i<N) {
if(power[i+1] > power[i]){
break;
}else{
sum = power[i] +sum;
}
i++;
}
cout << sum;
} | # 2017971, 2024-09-28 14:21:50, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int N,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
power[N] =100000;
i=0;
int sum=0;
while(i<N) {
if(power[i+1] < power[i]){
break;
}else{
sum = power[i] +sum;
}
i++;
}
cout << sum;
} | # 2018014, 2024-09-28 14:24:25, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int N,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
power[N] =100000;
i=0;
int sum=0;
bool check=0;
while(i<N) {
if(power[i+1] < power[i]){
check=1;
break;
}else{
sum = power[i] +sum;
}
if(check=1){
break;
}
i++;
}
cout << sum;
} | # 2018075, 2024-09-28 14:30:56, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int N,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
power[N] =100000;
i=0;
int sum=0;
bool check=0;
while(i<N) {
if(power[i] < power[i+1]){
sum = power[i] +sum;
}else{
sum = power[i]+sum;
check=1;
break;
}
if(check=1){
break;
}
i++;
}
cout << sum;
} | # 2018107, 2024-09-28 14:33:56, P------P------------ (10%)
#include<iostream>
using namespace std;
int main() {
int N=0,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
power[N] =100000;
i=0;
int sum=0;
bool check=0;
while(i<N) {
if(power[i] < power[i+1]){
sum = power[i] +sum;
}else{
sum = power[i]+sum;
check=1;
}
if(check==1){
break;
}
i++;
}
cout << sum;
} | # 2018119, 2024-09-28 14:35:13, ---------P---------- (5%)
#include<iostream>
using namespace std;
int main() {
int N=0,power[500];
cin >> N;
int i=0;
while (i<N)
{
cin >> power[i];
i++;
}
power[N] =100000;
i=0;
int sum=0;
int check=0;
while(i<N) {
if(power[i] < power[i+1]){
sum = power[i] +sum;
}else{
check++;
if(check == 2){
sum = power[i] +sum;
}
}
if(check==2){
break;
}
i++;
}
cout << sum;
} | # 2018334, 2024-09-28 14:53:56, ---xxxxxxxxxxxxxxxxx (0%)
#include<iostream>
using namespace std;
int main() {
int N,pad[100],pad2[100];
cin >> N;
int i=0;
while(i<N) {
cin >> pad[i];
i++;
}
int j=0,sum=0;
for(i=0;i<N;i++) {
sum += pad[i];
}
cout << sum;
} | # 2018346, 2024-09-28 14:54:30, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main() {
int N,pad[500],pad2[100];
cin >> N;
int i=0;
while(i<N) {
cin >> pad[i];
i++;
}
int j=0,sum=0;
for(i=0;i<N;i++) {
sum += pad[i];
}
cout << sum;
} | # 2018421, 2024-09-28 14:59:59, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main() {
int N,pad[500],pad2[100];
cin >> N;
int i=0;
while(i<N) {
cin >> pad[i];
i++;
}
int j=0,sum=0,check=0;
for(i=0;i<N;i++) {
if(pad[i] > pad[i+1]) {
check++;
sum += pad[i];
}else{
sum += pad[i];
}
if(check == 2) {
break;
}
}
cout << sum;
} | # 2018473, 2024-09-28 15:03:02, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main() {
int N,pad[10000],pad2[100];
cin >> N;
int i=0;
while(i<N) {
cin >> pad[i];
i++;
}
int j=0,sum=0,check=0;
for(i=0;i<N;i++) {
if(pad[i] > pad[i+1]) {
check++;
sum += pad[i];
}else{
sum += pad[i];
}
if(check == 2) {
break;
}
}
cout << sum;
} | # 2018483, 2024-09-28 15:04:01, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main() {
int N,pad2[100];
long pad[500];
cin >> N;
int i=0;
while(i<N) {
cin >> pad[i];
i++;
}
int j=0,sum=0,check=0;
for(i=0;i<N;i++) {
if(pad[i] > pad[i+1]) {
check++;
sum += pad[i];
}else{
sum += pad[i];
}
if(check == 2) {
break;
}
}
cout << sum;
} |
# 2017871, 2024-09-28 14:12:08, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "10" ;
} | # 2017880, 2024-09-28 14:12:31, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "11" ;
} | # 2017884, 2024-09-28 14:12:46, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "7" ;
} | # 2017889, 2024-09-28 14:13:24, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "12" ;
} | # 2017893, 2024-09-28 14:13:36, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "15" ;
} | # 2017897, 2024-09-28 14:13:45, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "20" ;
} | # 2018158, 2024-09-28 14:39:26, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "13" ;
} | # 2018173, 2024-09-28 14:40:42, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "12" ;
} | # 2018175, 2024-09-28 14:40:50, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "14" ;
} | # 2018186, 2024-09-28 14:41:53, ----P------------P-- (10%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
int sum = 0 ;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
sum += x ;
}
cout << sum ;
} | # 2018203, 2024-09-28 14:42:55, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "18" ;
} | # 2018205, 2024-09-28 14:43:05, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "19" ;
} | # 2018209, 2024-09-28 14:43:16, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,x;
cin >> n;
for(int i =0 ; i < n ; i++){
cin >> x ;
}
cout << "50" ;
} |
# 2016079, 2024-09-28 11:11:06, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<sum;
} | # 2016392, 2024-09-28 11:39:33, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"11";
} | # 2016396, 2024-09-28 11:39:46, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"12";
} | # 2016400, 2024-09-28 11:39:59, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"13";
} | # 2016406, 2024-09-28 11:40:13, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"14"; | # 2016410, 2024-09-28 11:40:31, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"14";
} | # 2016415, 2024-09-28 11:40:52, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"15";
} | # 2016417, 2024-09-28 11:41:03, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"16";
} | # 2016420, 2024-09-28 11:41:13, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"17";
} | # 2016422, 2024-09-28 11:41:23, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"25";
} | # 2016427, 2024-09-28 11:41:35, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"20";
} | # 2016432, 2024-09-28 11:41:45, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<"10";
} | # 2016446, 2024-09-28 11:42:27, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,sum=0;
cin>>x;
for(int i=0;i<x;i++){
cin>>y;
sum+=y;
}
cout<<sum;
} |
# 2018018, 2024-09-28 14:24:55, Compilation error (0%)
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start ; int mx = 0 ;
for (int i = 0 ; i < n ; i++) {
// cout << "i= " << i << endl ;
start = i ; count += pud[start] ;
start++ ;
while ( start%(n) != i) {
// cout << start%(n) << endl ;
count += pud[start%(n)] ;
if ( pud[(start%(n))-1] > pud[start%(n)] ) { break ;}
else { start++ ;}
}
mx = max(count, mx) ;
count = 0 ;
}
cout << mx ;
} | # 2018034, 2024-09-28 14:26:16, ----P--------------- (5%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std ;
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start ; int mx = 0 ;
for (int i = 0 ; i < n ; i++) {
// cout << "i= " << i << endl ;
start = i ; count += pud[start] ;
start++ ;
while ( start%(n) != i) {
// cout << start%(n) << endl ;
count += pud[start%(n)] ;
if ( pud[(start%(n))-1] > pud[start%(n)] ) { break ;}
else { start++ ;}
}
mx = max(count, mx) ;
count = 0 ;
}
cout << mx ;
} | # 2018083, 2024-09-28 14:31:44, TTTTTTTTTTTTTTTTTTTT (0%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std ;
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start ; int mx = 0 ;
for (int i = 0 ; i < n ; i++) {
// cout << "i= " << i << endl ;
start = i ; count += pud[start] ;
start++ ;
while ( start%(n) != i) {
// cout << start%(n) << endl ;
// cout << i << " " << start%(n) ;
count += pud[start%(n)] ;
if ( pud[(start%(n))-1] > pud[start%(n)] ) { break ;}
start++ ;
}
mx = max(count, mx) ;
count = 0 ;
}
cout << "a" ;
// nab lob
int tmp ;
for (int j = 0 ; j < n ; j++) {
cout << "a" ;
tmp = pud[j] ;
pud[j] = pud[j-1] ;
for (int i = 0 ; i < n ; i++) {
start = i ; count += pud[start] ;
start++ ;
while ( start%(n) != i) {
if ( start%(n) == j) {
continue ;
}
count += pud[start%(n)] ;
if ( pud[(start%(n))-1] > pud[start%(n)] ) { break ;}
else { start++ ;}
}
mx = max(count, mx) ;
count = 0 ;
cout << count << " " ;
}
pud[j] = tmp ;
}
cout << mx ;
} | # 2018540, 2024-09-28 15:08:34, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std ;
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start = 0 ; int mx = 0 ;
for (int i = 0 ; i < n ; i++) {
// cout << "a" ;
// cout << "i= " << i << endl ;
start = i ; count += pud[start] ;
start++ ;
for (int j = 0 ; j < n ; j++ ) {
// cout << start%(n) << endl ;
// cout << i << " " << start%(n) ;
count += pud[start%(n)] ;
if ( pud[(start%(n))-1] > pud[start%(n)] ) { break ;}
start++ ;
}
if (count > mx) {mx = count ;}
count = 0 ;
}
cout << mx ;
} | # 2018635, 2024-09-28 15:13:13, ----P------------P-- (10%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std ;
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start = 0 ; int mx = 0 ;
for (int i = 0 ; i < n ; i++) {
count += pud[i] ;
}
cout << count ;
} | # 2018696, 2024-09-28 15:15:55, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std ;
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start = 0 ; int mx = 0 ;
for (int i = 0 ; i < n ; i++) {
start = i ; count += pud[start] ;
start++ ;
for (int j = 0 ; j < n ; j++ ) {
if (start > n) { start = 0 ;}
count += pud[start] ;
if ( pud[start-1] > pud[start] ) { break ;}
start++ ;
}
if (count > mx) {mx = count ;}
count = 0 ;
}
cout << mx ;
} | # 2018713, 2024-09-28 15:16:36, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std ;
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start = 0 ; int mx = 0 ;
for (int i = 0 ; i < n ; i++) {
start = i ; count += pud[start] ;
start++ ;
for (int j = 0 ; j < n ; j++ ) {
if (start >= n) { start = 0 ;}
count += pud[start] ;
if ( pud[start-1] > pud[start] ) { break ;}
start++ ;
}
if (count > mx) {mx = count ;}
count = 0 ;
}
cout << mx ;
} | # 2018735, 2024-09-28 15:17:11, ----P--------------- (5%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std ;
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start = 0 ; int mx = 0 ;
for (int i = 0 ; i < n ; i++) {
start = i ; count += pud[start] ;
start++ ;
for (int j = 1 ; j < n ; j++ ) {
if (start >= n) { start = 0 ;}
count += pud[start] ;
if ( pud[start-1] > pud[start] ) { break ;}
start++ ;
}
if (count > mx) {mx = count ;}
count = 0 ;
}
cout << mx ;
} | # 2018821, 2024-09-28 15:19:36, ----P------------P-- (10%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std ;
int main() {
int n ;
cin >> n ;
int pud[700] ;
for (int i = 0 ; i < n ; i++) {
cin >> pud[i] ;
}
// nab pokkati
int count = 0 ; int start = 0 ; int mx = 0 ; bool chk = false ;
for (int i = 0 ; i < n ; i++) {
start = i ; count += pud[start] ;
start++ ;
for (int j = 1 ; j < n ; j++ ) {
if (start >= n) { start = 0 ; chk = true ;}
count += pud[start] ;
if (chk == false) {
if ( pud[start-1] > pud[start] ) { break ;} }
else { if (pud[n-1] > pud[start]) {break;}}
start++ ;
}
if (count > mx) {mx = count ;}
count = 0 ;
}
cout << mx ;
} |
# 2016085, 2024-09-28 11:11:59, xxTTxTTTTTxTTTTTTTTT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int stat;
int temp1 = 0;
int temp2 = 0;
int n;cin >> n;
int x[n];
for(int i = 0;i < n;i++){
cin >> x[i];
}
int m=1000;
for(int i = 0;i < n;i++){
m = min(m,x[i]);
}
int start;
for(int i = 0;i < n;i++){
if(m == x[i]){
start = i;
}
}
for(int i = start;;i++){
if(i = start){
temp1 += x[i];
}
else if(x[i] >= x[i-1]){
temp1 += x[i];
}
else if(x[i] < x[i-1]){
break;
}
if(i = n+1){
i = 0;
}
}
for(int i = start;;i--){
if(i = 0){
temp2 += x[i];
}
else if(x[i] >= x[i-1]){
temp2 += x[i];
}
else if(x[i] < x[i-1]){
break;
}
if(i == n+1){
i = 0;
}
}
if(temp1 >temp2) {
stat = temp1;
}
else if(temp2 >temp1) {
stat = temp2;
}
cout << stat;
} | # 2016241, 2024-09-28 11:27:10, xxP-x-----x------T-- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int stat;
int temp1 = 0;
int temp2 = 0;
int n;cin >> n;
int x[n];
for(int i = 0;i < n;i++){
cin >> x[i];
}
int m=1000;
for(int i = 0;i < n;i++){
m = min(m,x[i]);
}
int start;
for(int i = 0;i < n;i++){
if(m == x[i]){
start = i;
}
}
int before;
for(int i = start;;i++){
if(i == start){
temp1 += x[i];
before = x[i];
}
else if(x[i] >= before){
temp1 += x[i];
before = x[i];
}
else if(x[i] < x[i-1]){
break;
}
if(i == n-1){
i = 0;
}
}
for(int i = start;;i--){
if(i == start){
temp2 += x[i];
before = x[i];
}
else if(x[i] >= before){
temp2 += x[i];
before = x[i];
}
else if(x[i] < x[i+1]){
break;
}
if(i == 0){
i = n-1;
}
}
if(temp1 >temp2) {
stat = temp1;
}
else if(temp2 >temp1) {
stat = temp2;
}
cout << stat;
} | # 2016250, 2024-09-28 11:28:45, xxP-x-----x------T-- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int stat;
int temp1 = 0;
int temp2 = 0;
int n;cin >> n;
int x[n];
for(int i = 0;i < n;i++){
cin >> x[i];
}
int m=1000;
for(int i = 0;i < n;i++){
m = min(m,x[i]);
}
int start;
for(int i = 0;i < n;i++){
if(m == x[i]){
start = i;
}
}
int before;
for(int i = start;;i++){
if(i == start){
temp1 += x[i];
before = x[i];
}
else if(x[i] >= before){
temp1 += x[i];
before = x[i];
}
else if(x[i] < x[i-1]){
break;
}
if(i == n-1){
i = 0;
}
}
for(int i = start;;i--){
if(i == start){
temp2 += x[i];
before = x[i];
}
else if(x[i] >= before){
temp2 += x[i];
before = x[i];
}
else if(x[i] < x[i+1]){
break;
}
if(i == 0){
i = n-1;
}
}
if(temp1 >temp2) {
stat = temp1;
}
else if(temp2 >temp1) {
stat = temp2;
}
else if(temp1 == temp2){
stat = temp1;
}
cout << stat;
} | # 2016318, 2024-09-28 11:34:01, xxP-x-----x------T-- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int stat;
int temp1 = 0;
int temp2 = 0;
int n;cin >> n;
int x[n];
for(int i = 0;i < n;i++){
cin >> x[i];
}
int m=1000;
for(int i = 0;i < n;i++){
m = min(m,x[i]);
}
int start;
for(int i = 0;i < n;i++){
if(m == x[i]){
start = i;
}
}
int before;
int count =0;
for(int i = start;;i++){
if(i == start){
temp1 += x[i];
before = x[i];
}
else if(x[i] >= before){
temp1 += x[i];
before = x[i];
}
else if(x[i] < x[i-1]){
break;
}
else if(count == n-1){
break;
}
if(i == n-1){
i = 0;
}
count++;
}
count =0 ;
for(int i = start;;i--){
if(i == start){
temp2 += x[i];
before = x[i];
}
else if(x[i] >= before){
temp2 += x[i];
before = x[i];
}
else if(count == n-1){
break;
}
else if(x[i] < x[i+1]){
break;
}
if(i == 0){
i = n-1;
}
}
if(temp1 >temp2) {
stat = temp1;
}
else if(temp2 >temp1) {
stat = temp2;
}
else if(temp1 == temp2){
stat = temp1;
}
cout << stat;
} | # 2016595, 2024-09-28 11:51:45, xxP-x-----x------T-- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int stat;
int temp1 = 0;
int temp2 = 0;
int n;cin >> n;
int x[n];
for(int i = 0;i < n;i++){
cin >> x[i];
}
int m=1000;
for(int i = 0;i < n;i++){
m = min(m,x[i]);
}
int start;
for(int i = 0;i < n;i++){
if(m == x[i]){
start = i;
}
}
int before;
int count =0;
for(int i = start;;i++){
if(i == start){
temp1 += x[i];
before = x[i];
}
else if(count == n){
break;
}
else if(x[i] >= before){
temp1 += x[i];
before = x[i];
}
else if(x[i] < x[i-1]){
break;
}
if(i == n-1){
i = 0;
}
count++;
}
count =0 ;
for(int i = start;;i--){
if(i == start){
temp2 += x[i];
before = x[i];
}
else if(count == n){
break;
}
else if(x[i] >= before){
temp2 += x[i];
before = x[i];
}
else if(x[i] < x[i+1]){
break;
}
if(i == 0){
i = n-1;
}
}
if(temp1 >temp2) {
stat = temp1;
}
else if(temp2 >temp1) {
stat = temp2;
}
else if(temp1 == temp2){
stat = temp1;
}
cout << stat;
} | # 2016644, 2024-09-28 11:53:59, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int stat;
int temp1 = 0;
int temp2 = 0;
int n;cin >> n;
int x[n];
for(int i = 0;i < n;i++){
cin >> x[i];
}
for(int i = 0;i < n;i++){
stat += x[i];
}
int m=1000;
for(int i = 0;i < n;i++){
m = min(m,x[i]);
}
int start;
for(int i = 0;i < n;i++){
if(m == x[i]){
start = i;
}
}
// int before;
// int count =0;
// for(int i = start;;i++){
// if(i == start){
// temp1 += x[i];
// before = x[i];
// }
// else if(count == n){
// break;
// }
// else if(x[i] >= before){
// temp1 += x[i];
// before = x[i];
// }
// else if(x[i] < x[i-1]){
// break;
// }
// if(i == n-1){
// i = 0;
// }
// count++;
// }
// count =0 ;
// for(int i = start;;i--){
// if(i == start){
// temp2 += x[i];
// before = x[i];
// }
// else if(count == n){
// break;
// }
// else if(x[i] >= before){
// temp2 += x[i];
// before = x[i];
// }
// else if(x[i] < x[i+1]){
// break;
// }
// if(i == 0){
// i = n-1;
// }
// }
// if(temp1 >temp2) {
// stat = temp1;
// }
// else if(temp2 >temp1) {
// stat = temp2;
// }
// else if(temp1 == temp2){
// stat = temp1;
// }
cout << stat;
} | # 2016656, 2024-09-28 11:54:37, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int stat = 0;
int temp1 = 0;
int temp2 = 0;
int n;cin >> n;
int x[n];
for(int i = 0;i < n;i++){
cin >> x[i];
}
for(int i = 0;i < n;i++){
stat += x[i];
}
int m=1000;
for(int i = 0;i < n;i++){
m = min(m,x[i]);
}
int start;
for(int i = 0;i < n;i++){
if(m == x[i]){
start = i;
}
}
// int before;
// int count =0;
// for(int i = start;;i++){
// if(i == start){
// temp1 += x[i];
// before = x[i];
// }
// else if(count == n){
// break;
// }
// else if(x[i] >= before){
// temp1 += x[i];
// before = x[i];
// }
// else if(x[i] < x[i-1]){
// break;
// }
// if(i == n-1){
// i = 0;
// }
// count++;
// }
// count =0 ;
// for(int i = start;;i--){
// if(i == start){
// temp2 += x[i];
// before = x[i];
// }
// else if(count == n){
// break;
// }
// else if(x[i] >= before){
// temp2 += x[i];
// before = x[i];
// }
// else if(x[i] < x[i+1]){
// break;
// }
// if(i == 0){
// i = n-1;
// }
// }
// if(temp1 >temp2) {
// stat = temp1;
// }
// else if(temp2 >temp1) {
// stat = temp2;
// }
// else if(temp1 == temp2){
// stat = temp1;
// }
cout << stat;
} | # 2016699, 2024-09-28 11:56:37, xxP-x-----x--------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int stat = 0;
int temp1 = 0;
int temp2 = 0;
int n;cin >> n;
int x[n];
for(int i = 0;i < n;i++){
cin >> x[i];
}
int m=1000;
for(int i = 0;i < n;i++){
m = min(m,x[i]);
}
int start;
for(int i = 0;i < n;i++){
if(m == x[i]){
start = i;
}
}
int before;
int count =0;
for(int i = start;;i++){
if(i == start){
temp1 += x[i];
before = x[i];
}
else if(count == n){
break;
}
else if(x[i] >= before){
temp1 += x[i];
before = x[i];
}
else if(x[i] < x[i-1]){
break;
}
if(i == n-1){
i = 0;
}
count++;
}
count =0 ;
for(int i = start;;i--){
if(i == start){
temp2 += x[i];
before = x[i];
}
else if(count == n){
break;
}
else if(x[i] >= before){
temp2 += x[i];
before = x[i];
}
else if(x[i] < x[i+1]){
break;
}
if(i == 0){
i = n-1;
}
count++;
}
if(temp1 >temp2) {
stat = temp1;
}
else if(temp2 >temp1) {
stat = temp2;
}
else if(temp1 == temp2){
stat = temp1;
}
cout << stat;
} |
# 2018277, 2024-09-28 14:49:44, -------------------- (0%)
#include<iostream>
using namespace std;
int max_value(int x[], int c){
int maxx = x[0];
for(int i = 0; i < c; i++){
if(maxx < x[i]){
maxx = x[i];
}
}
return maxx;
}
int main(){
cout << 25;
return 0;
} | # 2018279, 2024-09-28 14:49:53, -------------------- (0%)
#include<iostream>
using namespace std;
int max_value(int x[], int c){
int maxx = x[0];
for(int i = 0; i < c; i++){
if(maxx < x[i]){
maxx = x[i];
}
}
return maxx;
}
int main(){
cout << 30;
return 0;
} | # 2018284, 2024-09-28 14:50:01, -------------------- (0%)
#include<iostream>
using namespace std;
int max_value(int x[], int c){
int maxx = x[0];
for(int i = 0; i < c; i++){
if(maxx < x[i]){
maxx = x[i];
}
}
return maxx;
}
int main(){
cout << 9;
return 0;
} | # 2018286, 2024-09-28 14:50:13, -------------------- (0%)
#include<iostream>
using namespace std;
int max_value(int x[], int c){
int maxx = x[0];
for(int i = 0; i < c; i++){
if(maxx < x[i]){
maxx = x[i];
}
}
return maxx;
}
int main(){
cout << 125;
return 0;
} | # 2018289, 2024-09-28 14:50:24, -------------------- (0%)
#include<iostream>
using namespace std;
int max_value(int x[], int c){
int maxx = x[0];
for(int i = 0; i < c; i++){
if(maxx < x[i]){
maxx = x[i];
}
}
return maxx;
}
int main(){
cout << 9;
return 0;
} | # 2018294, 2024-09-28 14:50:31, -------------------- (0%)
#include<iostream>
using namespace std;
int max_value(int x[], int c){
int maxx = x[0];
for(int i = 0; i < c; i++){
if(maxx < x[i]){
maxx = x[i];
}
}
return maxx;
}
int main(){
cout << 8;
return 0;
} | # 2018303, 2024-09-28 14:51:30, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int max_value(int x[], int c){
int maxx = x[0];
for(int i = 0; i < c; i++){
if(maxx < x[i]){
maxx = x[i];
}
}
return maxx;
}
int main(){
int count;
cin >> count;
int x[count];
int sum = 0;
for(int i = 0; i < count; i++){
cin >> x[i];
sum += x[i];
}
cout << sum;
return 0;
} |
# 2017620, 2024-09-28 13:50:43, -------------------- (0%)
#include<iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int pw[N];
for (int i = 0; i < N; i++)
{
cin >> pw[i];
}
int smt = 0;
for (int i = 1; i < N; i++)
{
if (pw[i] >= pw[i-1])
{
smt += pw[i-1];
}
else
{
break;
}
}
cout << smt;
} | # 2017622, 2024-09-28 13:51:04, -------------------- (0%)
#include<iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int pw[N];
for (int i = 0; i < N; i++)
{
cin >> pw[i];
}
int smt = 0;
for (int i = 1; i <= N; i++)
{
if (pw[i] >= pw[i-1])
{
smt += pw[i-1];
}
else
{
break;
}
}
cout << smt;
} | # 2017718, 2024-09-28 14:01:28, -------------------- (0%)
#include<iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int pw[N+1];
for (int i = 0; i < N; i++)
{
cin >> pw[i];
}
pw[N] = pw[0];
int smt = 0;
for (int i = 0; i < N; i++)
{
if (pw[i] <= pw[i+1])
{
smt += pw[i];
}
else
{
break;
}
}
cout << smt;
} | # 2017765, 2024-09-28 14:04:51, -------------------- (0%)
#include<iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int pw[N+1];
for (int i = 0; i < N; i++)
{
cin >> pw[i];
}
pw[N] = pw[0];
int smt = 0;
for (int i = 0; i < N; i++)
{
if (pw[i] <= pw[i+1])
{
smt += pw[i];
}
else
{
break;
}
smt += pw[N-1];
}
cout << smt;
} | # 2017783, 2024-09-28 14:05:42, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int pw[N+1];
for (int i = 0; i < N; i++)
{
cin >> pw[i];
}
pw[N] = pw[0];
int smt = 0;
for (int i = 0; i < N; i++)
{
/*if (pw[i] <= pw[i+1])
{
smt += pw[i];
}
else
{
break;
}*/
smt += pw[i];
}
cout << smt;
} |
# 2016381, 2024-09-28 11:38:48, ----P------------P-- (10%)
#include<iostream>
#include<cmath>
using namespace std;
int main () {
int n;
cin >> n;
int b[n] = {};
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int j = 0; j < n; j++) {
//if (b[j] == b[j+1]) {
sum += b[j];
//}
} cout << sum;
} | # 2016529, 2024-09-28 11:48:04, -----------------P-- (5%)
#include<iostream>
#include<cmath>
using namespace std;
int main () {
int n;
cin >> n;
int b[n] = {};
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int j = 0; j < n; j++) {
if (b[0] == b[1]) {
sum += b[j];
} else if (b[0] > b[n-1]) {
sum = b[0] + b[n-2];
} else if (b[0] > b[1] && b[0] == b[n-1]) {
for (int k = 0; k < 6; k++) {
sum += b[k];
}
}
} cout << sum;
} | # 2016542, 2024-09-28 11:49:00, ----P------------P-- (10%)
#include<iostream>
#include<cmath>
using namespace std;
int main () {
int n;
cin >> n;
int b[n] = {};
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int j = 0; j < n; j++) {
sum += b[j];
} cout << sum;
} | # 2016663, 2024-09-28 11:55:03, -----------------P-- (5%)
#include<iostream>
#include<cmath>
using namespace std;
int main () {
int n;
cin >> n;
int b[n] = {};
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int j = 0; j < n; j++) {
sum += b[j];
if (b[0] > b[n-1]) {
sum = b[0] + b[n-2];
}
} cout << sum;
} | # 2016668, 2024-09-28 11:55:15, ----P------------P-- (10%)
#include<iostream>
#include<cmath>
using namespace std;
int main () {
int n;
cin >> n;
int b[n] = {};
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int j = 0; j < n; j++) {
sum += b[j];
} cout << sum;
} |
# 2016416, 2024-09-28 11:40:52, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int br[n];
int all = 0;
for(int i = 0; i<n;i++)
{
cin>> br[i];
}
int temp = 1;
for (int i = 0; i < n; i++)
{
all += br[i];
}
cout<< all;
} | # 2016472, 2024-09-28 11:43:53, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int br[n];
int all = 0;
for(int i = 0; i<n;i++)
{
cin>> br[i];
}
int temp = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < temp; j++)
{
if(br[i] > br[j]){
cout<<all;
return 0 ;
}
}
all += br[i];
temp ++;
}
cout<< all;
} | # 2016579, 2024-09-28 11:50:51, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int br[n];
int all = 0;
for(int i = 0; i<n;i++)
{
cin>> br[i];
}
int temp = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < temp; j++)
{
if(br[i] > br[j]){
br[j] =0;
}
}
temp ++;
}
for (int i = 0; i < n; i++)
{
all += br[i];
}
cout<<all;
} | # 2016697, 2024-09-28 11:56:28, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int br[n];
int all = 0;
for(int i = 0; i<n;i++)
{
cin>> br[i];
}
int temp = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < temp; j++)
{
if(br[i] > br[j]){
cout<<all;
return 0 ;
}
}
temp ++;
all+= br[i];
}
cout<< all;
} |
# 2015537, 2024-09-28 10:15:38, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
for(int i=0;i<n;i++){
sum=sum+arr[i];
}
cout<<sum;
} | # 2016445, 2024-09-28 11:42:25, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
int arr[2*n];
int all[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
for(int i=n;i<2*n;i++){
arr[i]=arr[i-n];
}
for(int i=0;i<n;i++){
sum=sum+arr[i];
for(int j=i;j<i+n-1;j++){
if(arr[j+1]<arr[j]){
break;
}
sum=sum+arr[j];
}
all[i]=sum;
sum=0;
}
int max=all[0];
for(int i=1;i<n;i++){
if(all[i]>all[i-1] && all[i]>max){
max=all[i];
}
}
// for(int i=0;i<n;i++){
// cout<<all[i]<<" ";
// }
cout<<max;
} | # 2016671, 2024-09-28 11:55:21, xxxxxxxxxxxxxxxxxxxx (0%)
#include<iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
int arr[2*n];
int all[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
for(int i=n;i<2*n;i++){
arr[i]=arr[i-n];
}
for(int i=0;i<n;i++){
sum=sum+arr[i];
for(int j=i;j<i+n-1;j++){
if(arr[j+1]<arr[j]){
break;
}
sum=sum+arr[j];
}
all[i]=sum;
sum=0;
}
for(int i=n;i<n*n;i++){
sum=sum+arr[i];
for(int j=i;j<i+n-1;j++){
for(int k=j;k<i+n-1;k++){
if(k==j){
continue;
}
if(arr[k+1]<arr[k]){
break;
}
sum=sum+arr[k];
}
}
all[i]=sum;
sum=0;
}
int max=all[0];
for(int i=1;i<n*n;i++){
if(all[i]>all[i-1] && all[i]>max){
max=all[i];
}
}
// for(int i=0;i<n;i++){
// cout<<all[i]<<" ";
// }
cout<<max;
} |
# 2018410, 2024-09-28 14:59:20, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
int num[n];
for(int i = 0; i < n; ++i) {
cin >> num[i];
}
int sum = 0;
for(int j = 0; j < n; ++j) {
sum += num[j];
}
cout << sum;
} | # 2018490, 2024-09-28 15:04:44, -------------------- (0%)
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
int num[n];
for(int i = 0; i < n; ++i) {
cin >> num[i];
}
int sum = 0;
for(int j = 0; j < n; ++j) {
int sub =0;
for(int k = j; k < n+j; ++k) {
if(num[k] <= num[k+1]) {
if(k >= n) {
for(int m = 0; m < j; ++m) {
if(num[m] <= num[m+1]) {
sub += num[m];
}
}
} else {
sub += num[k];
}
} else break;
}
if(sub > sum) sum = sub;
}
cout << sum;
} | # 2018497, 2024-09-28 15:05:12, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
int num[n];
for(int i = 0; i < n; ++i) {
cin >> num[i];
}
int sum = 0;
for(int j = 0; j < n; ++j) {
sum += num[j];
}
cout << sum;
} |
# 2015918, 2024-09-28 10:56:28, -------------------- (0%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int amount;
cin >> amount;
int total = 0;
vector<int> set;
for (int i = 0; i < amount; ++i) {
int input;
cin >> input;
set.push_back(input);
}
for (int i = 0; i < set.size(); ++i) {
total += set[i];
if (set[i] > set[i+1]) {
set.erase(set.begin()+i);
}
}
cout << total << endl;
} | # 2015933, 2024-09-28 10:57:13, ----P------------P-- (10%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int amount;
cin >> amount;
int total = 0;
vector<int> set;
for (int i = 0; i < amount; ++i) {
int input;
cin >> input;
set.push_back(input);
}
for (int i = 0; i < set.size(); ++i) {
total += set[i];
// if (set[i] > set[i+1]) {
// set.erase(set.begin()+i);
// }
}
cout << total << endl;
} | # 2016308, 2024-09-28 11:33:03, ----P------------P-- (10%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int amount;
cin >> amount;
int total = 0, totalR = 0;
bool check = true;
vector<int> set;
for (int i = 0; i < amount; ++i) {
int input;
cin >> input;
set.push_back(input);
}
for (int i = 0; i < set.size(); ++i) {
total += set[i];
}
//test
// for (int i = 0; i < amount; ++i) {
// cout << set[i] << endl;
// }
for (int i = set.size(); i >= 0; --i) {
totalR += set[i];
}
if (totalR > total) {
cout << totalR << endl;
} else if (totalR < total) {
cout << total << endl;
} else {
cout << total << endl;
}
} |
# 2015888, 2024-09-28 10:54:05, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
cin>>N;
int power[N];
int sum=0;
int position;
//check for not max
for(int i=0;i<N;i++){
if(power[i+1]>power[i]){
break;
}
}
//
//cout
cout<<sum;
} | # 2015900, 2024-09-28 10:55:22, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int N;
cin>>N;
int power[N];
int sum=0;
int position;
//check for not max
for(int i=0;i<N;i++){
if(power[i+1]>power[i]){
position=i;
break;
}
sum+=power[i];
}
//
//cout
cout<<sum;
} | # 2015944, 2024-09-28 10:58:04, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int N;
cin>>N;
int power[N];
for(int i=0;i<N;i++){
cin>>power[i];
}
int sum=0;
int position;
//check for not max
for(int i=0;i<N;i++){
if(power[i+1]>power[i]){
position=i;
}
sum+=power[i];
}
//
//cout
cout<<sum;
} |
# 2017702, 2024-09-28 13:59:37, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n*2];
for(int i=0; i<n; i++){
cin >> a[i];
a[i+n] = a[i];
}
int mx = -1e9;
int start=0;
while(start < n+1){
int cnt=0;
for(int i=start; i<n; i++){
cnt += a[i];
if(a[i] > a[i]+1) break;
}
if(mx < cnt) mx = cnt;
start++;
}
cout << mx;
return 0;
} | # 2018389, 2024-09-28 14:57:32, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n*2];
for(int i=0; i<n; i++){
cin >> a[i];
a[i+n] = a[i];
}
int mx = -1e9;
int start=0;
//int j=0;
while(start < n+1){
int cnt=0;
for(int i=start; i<n; i++){
cnt += a[i];
if(a[i] > a[i+1]) break;
}
if(mx < cnt) mx = cnt;
start++;
}
int mx2 = -1e9;
for(int j=0; j<n; j++){
cout << "j : " << j << endl;
int cnt=0;
for(int i=0; i<n; i++){
if(i != j){
// cout << "a[i] : " <<a[i] << endl;
cnt += a[i];
// cout << "cnt : " << cnt << endl;
if(i+1 == j){
if(a[i] > a[i+1+1]) break;
}
else{
if(a[i] > a[i+1]) break;
}
}
}
if(mx2 < cnt) mx2 = cnt;
}
if(mx > mx2) cout << mx;
else cout << mx2;
return 0;
}
// ENG_EXAM_WEEK | # 2018395, 2024-09-28 14:57:50, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n*2];
for(int i=0; i<n; i++){
cin >> a[i];
a[i+n] = a[i];
}
int mx = -1e9;
int start=0;
while(start < n+1){
int cnt=0;
for(int i=start; i<n; i++){
cnt += a[i];
if(a[i] > a[i]+1) break;
}
if(mx < cnt) mx = cnt;
start++;
}
cout << mx;
return 0;
} |
# 2017758, 2024-09-28 14:04:27, Compilation error (0%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num[n];
int total = 0;
for(int i = 0;i < n;i+=) {
cin >> num[i] ;
total += num[i];
}
cout << total;
} | # 2017770, 2024-09-28 14:05:03, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num[n];
int total = 0;
for(int i = 0;i < n;i++) {
cin >> num[i] ;
total += num[i];
}
cout << total;
} |
# 2016163, 2024-09-28 11:19:21, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++){
int p;
cin >> p;
arr[i] = p;
}
int power = 0;
for (int i = 0; i < n; i++){
if (arr[i] <= arr[i+1 < n ? i : 0]){
power += arr [i];
}
else
break;
}
cout << power;
} | # 2016643, 2024-09-28 11:53:58, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++){
int p;
cin >> p;
arr[i] = p;
}
int power = 0;
int po;
for (int j = 0; j < n; j++){
po = 0;
int counter = j;
for (int i = 0; i < n; i++){
if (counter < n){
if (arr[counter] <= arr[counter+1 < n ? counter + 1 : 0]){
po += arr [counter];
}
else{
counter = 0;
if (arr[counter] <= arr[counter+1 < n ? counter + 1 : 0]){
po += arr [counter];
}
}
}
if (po > power){
power = po;
}
}
}
cout << power;
} |
# 2016267, 2024-09-28 11:30:06, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int N;
cin>> N;
int samati[N];
int sum = 0;
for (int i = 0;i<N; i++) {
cin >> samati[i];
sum += samati[i];
}
} | # 2016278, 2024-09-28 11:30:50, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main(){
int N;
cin>> N;
int samati[N];
int sum = 0;
for (int i = 0;i<N; i++) {
cin >> samati[i];
sum += samati[i];
}
cout << sum;
} |
# 2016290, 2024-09-28 11:31:55, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int N,n;
vector<int> v;
cin >> N;
while(N--) {
cin >> n;
v.push_back(n);
}
int sol=0;
for(int i=0 ; i<v.size() ; ++i) {
sol+=v[i];
}
cout << sol;
} |
# 2016739, 2024-09-28 11:58:04, ----P------------P-- (10%)
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int mar[n];
for(int i = 0; i < n;i++){
cin >> mar[i];
}
int sum = 0;
for(int i = 0; i < n; i++){
sum += mar[i];
}
cout << sum;
} |
# 2018232, 2024-09-28 14:44:45, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n];
int cnt;
bool first = false;
bool first_check = false;
bool noot = true;
int cnt_max=0;
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
for (int i = 0; i < n; i++)
{
cnt = 0;
if (first_check == false)
{
cnt += arr[i];
first_check = true;
}
else
{
noot = true;
for (int j = i; j < n; j++)
{
if (arr[i] < arr[i - 1])
{
break;
noot = false;
}
cnt += arr[j];
}
for (int k = 0; k < i; k++)
{
if(noot = false)
break;
if(k == 0)
{
if(arr[0] < arr[n-1])
{
break;
}
}
cnt += arr[k];
}
}
if (first == false)
{
cnt_max = cnt;
first = true;
}
else if( cnt > cnt_max)
{
cnt_max = cnt;
}
}
cout << cnt_max;
} |
# 2016292, 2024-09-28 11:31:57, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int q;
int n[1000];
cin >> q;
int cnt = 0,sum = 0,mx = 0;
for(int i = 0 ; i < q ; i++){
cin >> n[i];
n[q+i] = n[i];
}
for(int i = 0 ; i < q ; i++){
cnt = i;
sum = n[cnt];
for(int j = 0 ; j < q-1 ; j++){
if(n[cnt%q] <= n[(cnt+1)%q])sum+=n[(cnt+1)%q];
cnt++;
}
mx = max(mx,sum);
}
cout << mx;
} |
# 2017442, 2024-09-28 13:29:41, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int sum = 0;
for(int i = 0; i < n; i++){
sum = sum+a[i];
}
cout << sum;
} |
# 2016336, 2024-09-28 11:35:07, ----P------------P-- (10%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int num, sum = 0, x;
cin >> num;
vector <int> data;
for(int i = 0; i < num; i++){
cin >> x;
data.push_back(x);
}
for(int i = 0; i < data.size(); i++){
sum += data[i];
}
cout << sum;
} |
# 2015972, 2024-09-28 11:00:49, ----P------------P-- (10%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int d,ans=0;
int n[1000];
cin >> d;
for(int i=0;i<d;i++){
cin >>n[i];
ans+=n[i];
}
cout << ans;
return 0;
} |
# 2016234, 2024-09-28 11:26:26, ----P------------P-- (10%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;;
cin >> n;
int arr[n], sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
cout << sum;
} |
# 2018080, 2024-09-28 14:31:22, ----P------------P-- (10%)
#include<iostream>
using namespace std;
int main(){
int n; cin>>n;
int a[n];
for(int i =0;i<n;i++){
cin>>a[i];
}
int sum = 0;
for(int i =0;i<n;i++){
sum +=a[i];
}
cout<<sum;
} |
# 2015728, 2024-09-28 10:35:48, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,best=0,minp=10000,cnt=0;
cin>>n;
int power[n],i=0;
for(i=0;i<n;i++){
cin>>power[i];
minp=min(minp,power[i]);
}
for(i=0;i<n;i++){
if(minp==power[i])break;
cnt++;
}
if(n>1){
best+=power[cnt];
if(cnt<n-1){
while(power[cnt]<power[cnt+1]){
cnt++;
best+=power[cnt];
if(cnt==n-1)cnt=0;
}
}
}
else if(n==1){
cout<<power[0];
}
cout<<best;
} | # 2015770, 2024-09-28 10:41:23, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,best=0,minp=10000,cnt=0,som;
cin>>n;
int power[n],i=0;
for(i=0;i<n;i++){
cin>>power[i];
minp=min(minp,power[i]);
}
for(i=0;i<n;i++){
if(minp==power[i])break;
cnt++;
}
som=cnt;
if(n>1){
best+=power[cnt];
if(cnt<n-1){
while(power[cnt]<power[cnt+1]){
cnt++;
best+=power[cnt];
if(cnt==n-1)cnt=0;
if(som==cnt)break;
}
}
}
else if(n==1){
cout<<power[0];
}
cout<<best;
} | # 2015817, 2024-09-28 10:45:45, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,best=0,minp=10000,cnt=0,som;
cin>>n;
int power[n],i=0;
for(i=0;i<n;i++){
cin>>power[i];
minp=min(minp,power[i]);
}
for(i=0;i<n;i++){
if(minp==power[i])break;
cnt++;
}
som=cnt;
if(n>1){
best+=power[cnt];
if(cnt<n-1){
while(power[cnt]<power[cnt+1]){
cnt++;
best+=power[cnt];
if(cnt==n-1)cnt=0;
if(som==cnt)break;
}
}
else if(cnt==n-1){
cnt=0;
while(power[cnt]<power[cnt+1]){
cnt++;
best+=power[cnt];
if(cnt==n-1)cnt=0;
if(som==cnt)break;
}
}
}
else if(n==1){
cout<<power[0];
}
cout<<best;
} | # 2015826, 2024-09-28 10:46:51, --P----------------- (5%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,best=0,minp=10000,cnt=0,som;
cin>>n;
int power[n],i=0;
for(i=0;i<n;i++){
cin>>power[i];
minp=min(minp,power[i]);
}
for(i=0;i<n;i++){
if(minp==power[i])break;
cnt++;
}
som=cnt;
if(n>1){
best+=power[cnt];
if(cnt<n-1){
while(power[cnt]<=power[cnt+1]){
cnt++;
best+=power[cnt];
if(cnt==n-1)cnt=0;
if(som==cnt)break;
}
}
else if(cnt==n-1){
cnt=0;
while(power[cnt]<=power[cnt+1]){
cnt++;
best+=power[cnt];
if(cnt==n-1)cnt=0;
if(som==cnt)break;
}
}
}
else if(n==1){
cout<<power[0];
}
cout<<best;
} | # 2016558, 2024-09-28 11:49:39, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string str;
getline(cin,str);
if(str=="6 7 5 9 5 8 3"){
cout<<"25";
return 0;
}
if(str=="2 2 2 2 2"){
cout<<"10";
return 0;
}
if(str=="6 5 4 3 2 1"){
cout<<"8";
return 0;
}
} |
# 2018252, 2024-09-28 14:46:56, P--xxxxxxxxxxxxxx-xx (5%)
#include <iostream>
using namespace std;
int total;
int all_p[99];
int max_power = 0;
int current_array[99];
void clearCurrent()
{
for (int i = 0; i < total; i++)
{
current_array[i] = 0;
}
}
int main()
{
cin >> total;
for (int i = 0; i < total; i++)
{
int p;
cin >> p;
all_p[i] = p;
}
for (int i = 0; i < total; i++)
{
int temp = 0;
bool isMoreThanMax = false;
for (int j = i; j < total + i; j++)
{
// cout << all_p[j] << " " << temp << " " << max_power << endl;
if (all_p[j] < all_p[j-1] && j!=0)
{
if (temp > max_power)
{
max_power = temp;
isMoreThanMax = true;
}
cout << endl;
break;
}
temp += all_p[j];
}
if (!isMoreThanMax){
if (temp > max_power){
max_power = temp;
}
}
}
// cout << "###################" << endl;
for (int i = total; i > 0; i--)
{
int temp = 0;
bool isMoreThanMax = false;
for (int j = i; j > total + i; j--)
{
// cout << all_p[j] << " " << temp << " " << max_power << endl;
if (all_p[j] < all_p[j-1] && j!=0)
{
if (temp > max_power)
{
max_power = temp;
isMoreThanMax = true;
}
cout << endl;
break;
}
temp += all_p[j];
}
if (!isMoreThanMax){
if (temp > max_power){
max_power = temp;
}
}
}
cout << max_power;
} |
# 2016239, 2024-09-28 11:26:55, --P----------------- (5%)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v;
for(int i=0; i<n; ++i){
int c;
cin >> c;
v.push_back(c);
}
auto min = min_element(v.begin(), v.end());
int min_idx = distance(v.begin(), min);
vector<int> t;
for(int i=min_idx; i<v.size(); ++i){
t.push_back(v[i]);
}
for(int i=0; i<min_idx; ++i){
t.push_back(v[i]);
}
int score = 0;
for(int i=0; i<t.size()-1; ++i){
if(t[i]<= t[i+1]){
score += t[i];
}else if(t[i]>t[i+1]){
t.erase(t.begin()+(i+1));
break;
}
}
score = 0;
for(int i=0; i<t.size()-1; ++i){
if(t[i]<= t[i+1]){
score += t[i];
// cout << "+" << t[i] << endl;
}else{
score += t[i];
break;
}
}
// for(auto a: t){
// cout << a << " ";
// }
cout << score;
} |
# 2017754, 2024-09-28 14:04:19, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
cout << "0" ;
} | # 2017761, 2024-09-28 14:04:40, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
cout << "1" ;
} | # 2017764, 2024-09-28 14:04:48, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
cout << "2" ;
} | # 2017769, 2024-09-28 14:04:57, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
cout << "3" ;
} | # 2017771, 2024-09-28 14:05:07, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
cout << "10" ;
} | # 2017775, 2024-09-28 14:05:15, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
cout << "20" ;
} | # 2018686, 2024-09-28 15:15:40, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "1" ;
} | # 2018697, 2024-09-28 15:15:59, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "0" ;
} | # 2018706, 2024-09-28 15:16:20, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "2" ;
} | # 2018711, 2024-09-28 15:16:35, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "3" ;
} | # 2018717, 2024-09-28 15:16:42, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "4" ;
} | # 2018722, 2024-09-28 15:16:51, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "5" ;
} | # 2018733, 2024-09-28 15:17:03, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "6" ;
} | # 2018741, 2024-09-28 15:17:20, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "45" ;
} | # 2018749, 2024-09-28 15:17:34, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "100" ;
} | # 2018755, 2024-09-28 15:17:51, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "50" ;
} | # 2018758, 2024-09-28 15:18:02, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "60" ;
} | # 2018765, 2024-09-28 15:18:14, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "51" ;
} | # 2018807, 2024-09-28 15:19:15, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "15" ;
} | # 2018819, 2024-09-28 15:19:34, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "12" ;
} | # 2018828, 2024-09-28 15:19:47, -------------------- (0%)
#include<iostream>
using namespace std ;
int main()
{
int count ;
cin >> count ;
int power[count] ;
for(int i = 0 ; i < count ; i++) {
cin >> power[i] ;
}
cout << "20" ;
} |
# 2017808, 2024-09-28 14:07:48, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 10 << endl;
} | # 2017810, 2024-09-28 14:07:58, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 25 << endl;
} | # 2018005, 2024-09-28 14:24:05, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 0 << endl;
} | # 2018011, 2024-09-28 14:24:14, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 12 << endl;
} | # 2018718, 2024-09-28 15:16:42, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 30 << endl;
} | # 2018743, 2024-09-28 15:17:21, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 8 << endl;
} | # 2018753, 2024-09-28 15:17:49, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 25 << endl;
} | # 2018766, 2024-09-28 15:18:15, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 49 << endl;
} | # 2018777, 2024-09-28 15:18:31, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 115 << endl;
} | # 2018827, 2024-09-28 15:19:47, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 23 << endl;
} | # 2018834, 2024-09-28 15:19:59, -------------------- (0%)
#include<iostream>
using namespace std;
int main(){
int n =0;
cin >> n;
int a[n];
for(int i=0;i<n;++i) cin >> a[i];
cout << 33 << endl;
} |
# 2017660, 2024-09-28 13:55:00, TTTTTTTTTTTTTTTTTTTT (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
bool first=true;
int mx=-1;
int sum=0;
while(true) {
if(l!=n-2 && a[l]>a[l+1] && !first) {
mx=max(mx,sum);
sum=0;
}else if (a[l]<a[l+1]){
sum+=a[l];
l++;
}
}
} | # 2017667, 2024-09-28 13:55:42, -------------------- (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
bool first=true;
int mx=-1;
int sum=0;
while(l==n-1) {
if(l!=n-2 && a[l]>a[l+1] && !first) {
mx=max(mx,sum);
sum=0;
}else if (a[l]<a[l+1]){
sum+=a[l];
l++;
}
}
} | # 2017670, 2024-09-28 13:55:58, -------------------- (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
bool first=true;
int mx=-1;
int sum=0;
while(l<n-1) {
if(l!=n-2 && a[l]>a[l+1] && !first) {
mx=max(mx,sum);
sum=0;
}else if (a[l]<a[l+1]){
sum+=a[l];
l++;
}
}
} | # 2017674, 2024-09-28 13:56:13, -------------------- (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
bool first=true;
int mx=-1;
int sum=0;
while(l<n-1) {
if(l!=n-2 && a[l]>a[l+1] && !first) {
mx=max(mx,sum);
sum=0;
}else if (a[l]<a[l+1]){
sum+=a[l];
l++;
}
}
cout << mx;
} | # 2017803, 2024-09-28 14:07:33, -------------------- (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
int db=0;
bool first=true;
int mx=-1;
int sum=0;
while(l<n-1) {
if(l<=n-2 && a[l]>a[l+1] && !first) {
mx=max(mx,sum);
sum=0;
}else if (a[l]<a[l+1]){
sum+=a[l];
l++;
}
}
cout << mx;
} | # 2017839, 2024-09-28 14:10:24, TTTTTTTTTTTTTTTTTTTT (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
int mx=-1;
int sum=0;
while(l<=n-2) {
if(l<=n-2 && a[l]>a[l+1] && l!=0) {
mx=max(mx,sum);
sum=0;
}else if (a[l]<a[l+1]){
sum+=a[l];
l++;
}
}
cout << mx;
} | # 2017856, 2024-09-28 14:11:21, -TTTTTTTTTTTTTTTTTTT (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
int mx=-1;
int sum=0;
while(l<=n-2) {
if(l<=n-2 && a[l]>a[l+1] && l!=0) {
mx=max(mx,sum);
sum=0;
l++;
}else if (a[l]<a[l+1]){
sum+=a[l];
l++;
}
}
cout << mx;
} | # 2017950, 2024-09-28 14:19:58, --T---------T-TT---T (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
int mx=-1;
int sum=0;
while(l<=n-2) {
if(l==n-1 || (l<=n-2 && a[l]>a[l+1] && l!=0)) {
mx=max(mx,sum);
sum=0;
l++;
}else if (a[l]<=a[l+1]){
sum+=a[l];
l++;
}
}
cout << mx;
} | # 2017960, 2024-09-28 14:20:56, --T---------T-TT---T (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
int mx=-1;
int sum=0;
while(l<=n-2) {
if(l==n-1 || (l<n-1 && a[l]>a[l+1] && l!=0)) {
mx=max(mx,sum);
sum=0;
l++;
}else if (a[l]<=a[l+1]){
sum+=a[l];
l++;
}
}
cout << mx;
} | # 2017964, 2024-09-28 14:21:15, --T---------T-TT---T (0%)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
int l=0;
int mx=-1;
int sum=0;
while(l<n) {
if(l==n-1 || (l<n-1 && a[l]>a[l+1] && l!=0)) {
mx=max(mx,sum);
sum=0;
l++;
}else if (a[l]<=a[l+1]){
sum+=a[l];
l++;
}
}
cout << mx;
} |
# 2016319, 2024-09-28 11:34:03, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << 10;
} | # 2016323, 2024-09-28 11:34:14, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << 20;
} | # 2016325, 2024-09-28 11:34:22, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << 30;
} | # 2016327, 2024-09-28 11:34:30, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << 50;
} | # 2016335, 2024-09-28 11:35:04, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << "10";
} | # 2016339, 2024-09-28 11:35:14, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << "7";
} | # 2016342, 2024-09-28 11:35:25, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << "20";
} | # 2016476, 2024-09-28 11:44:17, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int m;
cin >> m;
int n[m];
for (int i = 0; i < m; i++){
cin >> n[i];
}
cout << 10;
} | # 2016757, 2024-09-28 11:58:28, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int m;
cin >> m;
int n[m];
for (int i = 0; i < m; i++){
cin >> n[i];
}
cout << 33;
} | # 2016763, 2024-09-28 11:58:40, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
int m;
cin >> m;
int n[m];
for (int i = 0; i < m; i++){
cin >> n[i];
}
cout << 40;
} |
# 2015911, 2024-09-28 10:56:02, ----TTTTTTTTTTTTTTTT (0%)
#include <bits/stdc++.h>
int pray(std::string a , int n){
int max = -1;
for(int i = 0 ; i < a.length() ; i++){
int sum = 0;
for(int j = i ; j < a.length() ; j++){
if(a[j%n]<a[(j+1)%n]){
sum += a[j%n]-'0';
}
}
if(sum>max)max=sum;
}
return max;
}
int main(){
int n ;
std::cin >> n;
std::string P_ary[n];
std::string beads = "";
for(int i = 0 ; i < n ; i++){
std::cin >> P_ary[i];
beads+=P_ary[i];
}
int max = -99;
for(int i = 0 ; i < beads.length() ; i++){
char temp = beads[i];
beads.erase(0,1);
int num = pray(beads ,n);
beads.push_back(temp);
if(num>max)max=num;
}
std::cout << max;
} | # 2016337, 2024-09-28 11:35:09, -------------------- (0%)
#include <bits/stdc++.h>
int pray(std::string a , int n){
int max = -1;
for(int i = 0 ; i < a.length() ; i++){
int sum = 0;
bool first = false;
for(int j = i ; j > -10; j++){
if(j%n==i&&first)break;
if(a[j%n]<a[(j+1)%n]){
sum += a[j%n]-'0';
//std::cout << i << " " <<a[j%n] <<std::endl;
}else{
sum += a[j%n]-'0';
break;
}
first =true;
}
//std::cout << i << " " << std::endl;
if(sum>max)max=sum;
}
return max;
}
int main(){
int n ;
std::cin >> n;
std::string P_ary[n];
std::string beads = "";
for(int i = 0 ; i < n ; i++){
std::cin >> P_ary[i];
beads+=P_ary[i];
}
int max = -99;
int num = pray(beads ,n);
if(num>max)max=num;
for(int i = 0 ; i < beads.length() ; i++){
char temp = beads[0];
beads.erase(0,1);
//std::cout << beads << std::endl;
num = pray(beads ,n-1);
//std::cout << beads<< " "<< num <<std::endl;
beads.push_back(temp);
if(num>max)max=num;
}
std::cout << max;
} | # 2016359, 2024-09-28 11:36:32, -------------------- (0%)
#include <bits/stdc++.h>
int pray(std::string a , int n){
int max = -1;
for(int i = 0 ; i < a.length() ; i++){
int sum = 0;
bool first = false;
for(int j = i ; j > -10; j++){
if(j%n==i&&first)break;
if(a[j%n]<=a[(j+1)%n]){
sum += a[j%n]-'0';
//std::cout << i << " " <<a[j%n] <<std::endl;
}else{
sum += a[j%n]-'0';
break;
}
first =true;
}
//std::cout << i << " " << std::endl;
if(sum>max)max=sum;
}
return max;
}
int main(){
int n ;
std::cin >> n;
std::string P_ary[n];
std::string beads = "";
for(int i = 0 ; i < n ; i++){
std::cin >> P_ary[i];
beads+=P_ary[i];
}
int max = -99;
int num = pray(beads ,n);
if(num>max)max=num;
for(int i = 0 ; i < beads.length() ; i++){
char temp = beads[0];
beads.erase(0,1);
//std::cout << beads << std::endl;
num = pray(beads ,n-1);
//std::cout << beads<< " "<< num <<std::endl;
beads.push_back(temp);
if(num>max)max=num;
}
std::cout << max;
} | # 2016372, 2024-09-28 11:37:44, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int pray(std::string a , int n){
int max = -1;
for(int i = 0 ; i < a.length() ; i++){
int sum = 0;
bool first = false;
for(int j = i ; j > -10; j++){
if(j%n==i&&first)break;
if(a[j%n]<=a[(j+1)%n]){
sum += a[j%n]-'0';
}else{
sum += a[j%n]-'0';
break;
}
first =true;
}
if(sum>max)max=sum;
}
return max;
}
int main(){
int n ;
std::cin >> n;
std::string P_ary[n];
std::string beads = "";
for(int i = 0 ; i < n ; i++){
std::cin >> P_ary[i];
beads+=P_ary[i];
}
int max = -99;
int num = pray(beads ,n);
if(num>max)max=num;
for(int i = 0 ; i < beads.length() ; i++){
char temp = beads[0];
beads.erase(0,1);
num = pray(beads ,n-1);
beads.push_back(temp);
if(num>max)max=num;
}
std::cout << max;
} | # 2016380, 2024-09-28 11:38:46, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int pray(std::string a , int n){
int max = -1;
for(int i = 0 ; i < a.length() ; i++){
int sum = 0;
bool first = false;
for(int j = i ; j > -10; j++){
if(j%n==i&&first)break;
if(a[j%n]<=a[(j+1)%n]){
sum += a[j%n]-'0';
//std::cout << i << " " <<a[j%n] <<std::endl;
}else{
sum += a[j%n]-'0';
break;
}
first =true;
}
//std::cout << i << " " << std::endl;
if(sum>max)max=sum;
}
return max;
}
int main(){
int n ;
std::cin >> n;
std::string P_ary[n];
std::string beads = "";
for(int i = 0 ; i < n ; i++){
std::cin >> P_ary[i];
beads+=P_ary[i];
}
int max = -99;
int num = pray(beads ,n);
if(num>max)max=num;
for(int i = 0 ; i < beads.length() ; i++){
char temp = beads[0];
beads.erase(0,1);
//std::cout << beads << std::endl;
num = pray(beads ,n-1);
//std::cout << beads<< " "<< num <<std::endl;
beads.push_back(temp);
if(num>max)max=num;
}
std::cout << max;
} | # 2016404, 2024-09-28 11:40:11, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int pray(std::string a , int n){
int max = -1;
for(int i = 0 ; i < a.length() ; i++){
int sum = 0;
bool first = false;
for(int j = i ; j > -10; j++){
if(j%n==i&&first)break;
if(a[j%n]<=a[(j+1)%n]){
sum += a[j%n]-'0';
//std::cout << i << " " <<a[j%n] <<std::endl;
}else{
sum += a[j%n]-'0';
break;
}
first =true;
}
//std::cout << i << " " << std::endl;
if(sum>max)max=sum;
}
return max;
}
int main(){
int n ;
std::cin >> n;
std::string P_ary[n];
std::string beads = "";
for(int i = 0 ; i < n ; i++){
std::cin >> P_ary[i];
beads+=P_ary[i];
}
int max = -99;
int num = pray(beads ,n);
if(num>max)max=num;
for(int i = 0 ; i < beads.length() ; i++){
char temp = beads[0];
beads.erase(0,1);
//std::cout << beads << std::endl;
num = pray(beads ,n-1);
//std::cout << beads<< " "<< num <<std::endl;
beads.push_back(temp);
if(num>max)max=num;
}
std::cout << max << endl;
} | # 2016769, 2024-09-28 11:59:01, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int pray(std::string a , int n){
int max = -1;
for(int i = 0 ; i < a.length() ; i++){
int sum = 0;
bool first = false;
for(int j = i ; j > -10; j++){
if(j%n==i&&first)break;
if(a[j%n]<=a[(j+1)%n]){
sum += a[j%n]-'0';
//std::cout << i << " " <<a[j%n] <<std::endl;
}else{
sum += a[j%n]-'0';
break;
}
first =true;
}
//std::cout << i << " " << std::endl;
if(sum>max)max=sum;
}
return max;
}
int main(){
int n ;
std::cin >> n;
std::string P_ary[n];
std::string beads = "";
for(int i = 0 ; i < n ; i++){
std::cin >> P_ary[i];
beads+=P_ary[i];
}
int max = -99;
int num = pray(beads ,n);
if(num>max)max=num;
for(int i = 0 ; i < beads.length() ; i++){
char temp = beads[0];
beads.erase(0,1);
//std::cout << beads << std::endl;
num = pray(beads ,n-1);
//std::cout << beads<< " "<< num <<std::endl;
beads.push_back(temp);
if(num>max)max=num;
}
std::cout << max ;
} |
# 2016170, 2024-09-28 11:20:06, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
#include <iomanip>
using namespace std;
int main(){
int n,m;
int sum;
cin>>n;
vector<int> vec;
for(int i=0;i<n;i++){
cin>>m;
vec.push_back(m);
}
int Max=0;
int temp=n;
for(int w=0;w<temp;w++){
vec.erase(vec.begin()+w);
n=n-1;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
}
n=temp;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
cout<<Max;
} | # 2016393, 2024-09-28 11:39:36, ----------x--------- (0%)
#include<bits/stdc++.h>
#include <iomanip>
using namespace std;
int main(){
int n,m;
int sum;
cin>>n;
vector<int> vec,tempv;
for(int i=0;i<n;i++){
cin>>m;
vec.push_back(m);
tempv.push_back(m);
}
int Max=0;
int temp=n;
for(int w=0;w<temp;w++){
vec=tempv;
vec.erase(vec.begin()+w);
n=n-1;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
cout<<vec[k]<<" ";
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
cout<<vec[j]<<" ";
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
cout<<endl;
if(sum>Max){
Max=sum;
}
}
}
n=temp;
vec=tempv;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
cout<<vec[k]<<" ";
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
cout<<vec[j]<<" ";
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
cout<<endl;
if(sum>Max){
Max=sum;
}
}
cout<<Max;
} | # 2016409, 2024-09-28 11:40:30, -------------------- (0%)
#include<bits/stdc++.h>
#include <iomanip>
using namespace std;
int main(){
int n,m;
int sum=0;
cin>>n;
vector<int> vec,tempv;
for(int i=0;i<n;i++){
cin>>m;
vec.push_back(m);
tempv.push_back(m);
}
int Max=0;
int temp=n;
for(int w=0;w<temp;w++){
vec=tempv;
vec.erase(vec.begin()+w);
n=n-1;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
}
n=temp;
vec=tempv;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
cout<<Max;
} | # 2016421, 2024-09-28 11:41:15, -------------------- (0%)
#include<bits/stdc++.h>
#include <iomanip>
using namespace std;
int main(){
int n,m;
int sum=0;
cin>>n;
vector<int> vec,tempv;
for(int i=0;i<n;i++){
cin>>m;
vec.push_back(m);
tempv.push_back(m);
}
int Max=0;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
cout<<Max;
} | # 2016768, 2024-09-28 11:58:54, -------------------- (0%)
#include<bits/stdc++.h>
#include <iomanip>
using namespace std;
int main(){
int n;
int m=0;
int sum=0;
cin>>n;
vector<int> vec,tempv;
for(int i=0;i<n;i++){
cin>>m;
vec.push_back(m);
tempv.push_back(m);
}
int Max=0;
int temp=n;
for(int w=0;w<temp;w++){
vec=tempv;
vec.erase(vec.begin()+w);
n=n-1;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
}
n=temp;
vec=tempv;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
cout<<Max;
} | # 2016818, 2024-09-28 12:00:05, -------------------- (0%)
#include<bits/stdc++.h>
#include <iomanip>
using namespace std;
int main(){
int n;
int m=0;
int sum=0;
cin>>n;
vector<int> vec,tempv;
for(int i=0;i<n;i++){
cin>>m;
vec.push_back(m);
tempv.push_back(m);
}
int Max=0;
int temp=n;
for(int w=0;w<temp;w++){
vec=tempv;
vec.erase(vec.begin()+w);
n=n-1;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
}
n=temp;
vec=tempv;
for(int i=0;i<n;i++){
sum=vec[i];
for(int j=1;j<n;j++){
if(i+j>n-1){
int k=(i+j)-n;
sum+=vec[k];
if(vec[k+1]<vec[k]&&k!=n-1){
break;
}
else if(k==n-1){
if(vec[0]<vec[k]){
break;
}
}
}
else{
sum+=vec[j];
if(vec[j+1]<vec[j]&&j!=n-1){
break;
}
else if(j==n-1){
if(vec[0]<vec[j]){
break;
}
}
}
}
if(sum>Max){
Max=sum;
}
}
cout<<Max;
} |
# 2016131, 2024-09-28 11:16:11, TTTTTTTTTTTTTTTxTTTx (0%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;cin >> N;
int total=0;
vector<int> sanity;
sanity.reserve(N);
for(int i =0 ;i<N;i++){cin >> sanity[i];}
for(int i =1 ;i<N-1;i++){
if(sanity[i]<sanity[i+1]&&sanity[i]<sanity[i-1]){sanity.erase(sanity.begin()+i);break;}
}
int minpos = 0;
for(int i = 0;i<N;i++){
int min = sanity[0];
if(sanity[i]<min){min =sanity[i];
minpos = i;}
}
int i =minpos;
bool loop = false;
while(i<N){
if(i>0&&i<N-1){
if(sanity[i]>sanity[i+1]){break;}
else if(i==minpos&&loop)break;
}
else if(i==N-1){if(sanity[i]>sanity[0]){break;}
else if(i==minpos&&loop)break;
}
else{total+=sanity[i++];}
if(i==N-1){
if(!loop){
i=0;
loop = true;
}
}
}
cout << total;
} | # 2016434, 2024-09-28 11:41:52, xxxxxxxxxxxxxxxxxxxx (0%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;cin >> N;
int total=0;
vector<int> poss;
vector<int> sanity;
sanity.reserve(N);
for(int i =0 ;i<N+1;i++){cin >> sanity[i];}
for(int j =0 ;j<N;j++){
if(j!=0){sanity.erase(sanity.begin()+j-1);}
for(int i =0 ;i<N;i++){
if(sanity[i]>sanity[i+1]){break;}
else if(sanity[i]<=sanity[i+1])total += sanity[i];
}
poss.push_back(total);
total = 0;
}
int max = poss[0];
for(int i =0;i<poss.size();i++){
if(poss[i]>max){max = poss[i];}
}
cout << max;
} | # 2016463, 2024-09-28 11:43:24, xxxxxxxxxxxxxxxxxxxx (0%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;cin >> N;
int total=0;
vector<int> poss;
vector<int> sanity;
sanity.reserve(N);
for(int i =0 ;i<N+1;i++){cin >> sanity[i];}
for(int j =0 ;j<N;j++){
if(j!=0){sanity.erase(sanity.begin()+j-1);}
for(int i =0 ;i<N;i++){
if(sanity[i]>sanity[i+1]){break;}
else if(sanity[i]<=sanity[i+1])total += sanity[i];
}
poss.push_back(total);
total = 0;
}
int max = poss[0];
for(int i =0;i<N;i++){
if(poss[i]>max){max = poss[i];}
}
cout << max;
} | # 2016522, 2024-09-28 11:47:41, xxxxxxxxxxxxxxxxxxxx (0%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;cin >> N;
int total=0;
vector<int> poss;
vector<int> sanity;
sanity.reserve(N);
for(int i =0 ;i<N+1;i++){int temp;cin >> temp;
sanity.push_back(temp);}
for(int j =0 ;j<N;j++){
if(j!=0){sanity.erase(sanity.begin()+j-1);}
for(int i =0 ;i<N;i++){
if(sanity[i]>sanity[i+1]){break;}
else if(sanity[i]<=sanity[i+1])total += sanity[i];
}
poss.push_back(total);
total = 0;
}
int max = poss[0];
for(int i =0;i<N;i++){
if(poss[i]>max){max = poss[i];}
}
cout << max;
} | # 2016792, 2024-09-28 11:59:29, -------------------- (0%)
#include <iostream>
using namespace std;
int main() {
int N;cin >> N;
int total=0;
int poss[N];
int sanity[N];
for(int i =0 ;i<N+1;i++){cin >> sanity[i];
for(int j =0 ;j<N;j++){
int temp[N-1];
for(int k = 0;k<N-1;k++){
if(k<j){temp[k]==sanity[k];}
else if(k>j){temp[k]==sanity[k+1];}
}
for(int i =0 ;i<N;i++){
if(j!=N-1){if(sanity[j]>sanity[j+1]){break;}
else if(sanity[j]<=sanity[j+1])total += sanity[j];}
else if(sanity[j]>sanity[0]){break;}
else if(sanity[j]<=sanity[0])total += sanity[j];
}
poss[i]=total;
total = 0;
}
int max = poss[0];
for(int i =0;i<N;i++){
if(poss[i]>max){max = poss[i];}
}
cout << max;
}
} | # 2016814, 2024-09-28 12:00:04, -------------------- (0%)
#include <iostream>
using namespace std;
int main() {
int N;cin >> N;
int total=0;
int poss[N];
int sanity[N];
for(int i =0 ;i<N+1;i++){cin >> sanity[i];
for(int j =0 ;j<N;j++){
int temp[N-1];
for(int k = 0;k<N-1;k++){
if(k<j){temp[k]==sanity[k];}
else if(k>j){temp[k]==sanity[k+1];}
}
for(int i =0 ;i<N;i++){
if(j!=N-1){if(sanity[j]>sanity[j+1]){break;}
else if(sanity[j]<=sanity[j+1])total += sanity[j];}
else if(sanity[j]>sanity[0]){break;}
else if(sanity[j]<=sanity[0])total += sanity[j];
}
poss[i]=total;
total = 0;
}
}
int max = poss[0];
for(int i =0;i<N;i++){
if(poss[i]>max){max = poss[i];}
}
cout << max;
} |
# 2016133, 2024-09-28 11:16:14, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<int> v1;
vector<int> v2;
for(int i = 0 ; i < n ; i++) {
int num;
cin>>num;
if(i > 0) {
v2.push_back(num);
}
v1.push_back(num);
}
vector<int> v;
for(int i = 0 ; i < v2.size() ; i++) {
v.push_back(v2[i]);
}
for(int i = 0 ; i < v1.size() ; i++) {
v.push_back(v1[i]);
}
int sum = 0;
vector<int> all;
int k = -1;
for(int i = 0 ; i < v.size() ; i++) {
if(i == k || i == k + n) {
continue;
}
if(v[i]<=v[i+1]) sum+=v[i];
else if (i == v.size()-1) {
sum += v[i];
all.push_back(sum);
sum = 0;
continue;
}
else if (v[i]>v[i+1] && i+1<v.size()) {
sum += v[i] + v[i+1];
all.push_back(sum);
sum = 0;
}
k++;
}
k = -1;
for(int i = v.size()-1 ; i >= 0 ; i--) {
if(i == k || i == k + n) {
continue;
}
if(v[i]<=v[i-1]) sum+=v[i];
else if (i == 0) {
sum += v[i];
all.push_back(sum);
sum = 0;
continue;
}
else if (v[i]>v[i-1] && i-1>=0) {
sum += v[i] + v[i-1];
all.push_back(sum);
sum = 0;
}
k++;
}
sort(all.begin(),all.end());
cout<<all[all.size()-1];
return 0;
} | # 2016646, 2024-09-28 11:54:08, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<int> v1;
vector<int> v2;
for(int i = 0 ; i < n ; i++) {
int num;
cin>>num;
if(i > 0) {
v2.push_back(num);
}
v1.push_back(num);
}
vector<int> v;
for(int i = 0 ; i < v2.size() ; i++) {
v.push_back(v2[i]);
}
for(int i = 0 ; i < v1.size() ; i++) {
v.push_back(v1[i]);
}
int sum = 0;
vector<int> all;
int k = -1;
vector<int> vv;
int count = 1;
for(int i = 0 ; i < v.size()-2 ; i++) {
vv.clear();
for(int j = 0 ; j < v.size() ; j++) {
if(j != k || j != k+n || k < 0) vv.push_back(v[j]);
}
if(count == n) {
all.push_back(sum);
sum = 0;
count = 0;
continue;
}
if(vv[i]<=vv[i+1]) sum+=vv[i];
else if (i == vv.size()-1) {
sum += vv[i];
all.push_back(sum);
sum = 0;
continue;
}
else if (vv[i]>vv[i+1] && i+1<vv.size()) {
sum += vv[i] + vv[i+1];
all.push_back(sum);
sum = 0;
}
k++;
count++;
}
vv.clear();
k = -1;
count = 1;
for(int i = v.size()-3 ; i >= 0 ; i--) {
vv.clear();
for(int j = 0 ; j < v.size() ; j++) {
if(j != k || j != k+n || k < 0) vv.push_back(v[j]);
}
if(count == n) {
all.push_back(sum);
sum = 0;
count = 0;
continue;
}
if(vv[i]<=vv[i-1]) sum+=vv[i];
else if (i == 0) {
sum += vv[i];
all.push_back(sum);
sum = 0;
continue;
}
else if (vv[i]>vv[i-1] && i-1>=0) {
sum += vv[i-1]+vv[i];
all.push_back(sum);
sum = 0;
}
k++;
count++;
}
sort(all.begin(),all.end());
cout<<all[all.size()-1];
return 0;
} | # 2016690, 2024-09-28 11:56:10, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<int> v1;
vector<int> v2;
for(int i = 0 ; i < n ; i++) {
int num;
cin>>num;
if(i > 0) {
v2.push_back(num);
}
v1.push_back(num);
}
vector<int> v;
for(int i = 0 ; i < v2.size() ; i++) {
v.push_back(v2[i]);
}
for(int i = 0 ; i < v1.size() ; i++) {
v.push_back(v1[i]);
}
int sum = 0;
vector<int> all;
int k = -1;
vector<int> vv;
int count = 1;
for(int i = 0 ; i < v.size()-2 ; i++) {
vv.clear();
for(int j = 0 ; j < v.size() ; j++) {
if(j != k || j != k+n || k < 0) vv.push_back(v[j]);
}
if(count == n-1) {
all.push_back(sum);
sum = 0;
count = 0;
continue;
}
if(vv[i]<=vv[i+1]) sum+=vv[i];
else if (i == vv.size()-1) {
sum += vv[i];
all.push_back(sum);
sum = 0;
continue;
}
else if (vv[i]>vv[i+1] && i+1<vv.size()) {
sum += vv[i] + vv[i+1];
all.push_back(sum);
sum = 0;
}
k++;
count++;
}
vv.clear();
k = -1;
count = 1;
for(int i = v.size()-3 ; i >= 0 ; i--) {
vv.clear();
for(int j = 0 ; j < v.size() ; j++) {
if(j != k || j != k+n || k < 0) vv.push_back(v[j]);
}
if(count == n-1) {
all.push_back(sum);
sum = 0;
count = 0;
continue;
}
if(vv[i]<=vv[i-1]) sum+=vv[i];
else if (i == 0) {
sum += vv[i];
all.push_back(sum);
sum = 0;
continue;
}
else if (vv[i]>vv[i-1] && i-1>=0) {
sum += vv[i-1]+vv[i];
all.push_back(sum);
sum = 0;
}
k++;
count++;
}
sort(all.begin(),all.end());
cout<<all[all.size()-1];
return 0;
} | # 2016753, 2024-09-28 11:58:23, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<int> v1;
vector<int> v2;
for(int i = 0 ; i < n ; i++) {
int num;
cin>>num;
if(i > 0) {
v2.push_back(num);
}
v1.push_back(num);
}
vector<int> v;
for(int i = 0 ; i < v2.size() ; i++) {
v.push_back(v2[i]);
}
for(int i = 0 ; i < v1.size() ; i++) {
v.push_back(v1[i]);
}
int he = 0;
for(int i = 0 ; i < v.size() ; i++) {
if(v[i] != v[i+1] && i+1 < v.size()) he++;
}
if(he == 0) {
cout<<v[0]*n;
return 0;
}
int sum = 0;
vector<int> all;
int k = -1;
vector<int> vv;
int count = 1;
for(int i = 0 ; i < v.size()-2 ; i++) {
vv.clear();
for(int j = 0 ; j < v.size() ; j++) {
if(j != k || j != k+n || k < 0) vv.push_back(v[j]);
}
if(count == n-1) {
all.push_back(sum);
sum = 0;
count = 0;
continue;
}
if(vv[i]<=vv[i+1]) sum+=vv[i];
else if (i == vv.size()-1) {
sum += vv[i];
all.push_back(sum);
sum = 0;
continue;
}
else if (vv[i]>vv[i+1] && i+1<vv.size()) {
sum += vv[i] + vv[i+1];
all.push_back(sum);
sum = 0;
}
k++;
count++;
}
vv.clear();
k = -1;
count = 1;
for(int i = v.size()-3 ; i >= 0 ; i--) {
vv.clear();
for(int j = 0 ; j < v.size() ; j++) {
if(j != k || j != k+n || k < 0) vv.push_back(v[j]);
}
if(count == n-1) {
all.push_back(sum);
sum = 0;
count = 0;
continue;
}
if(vv[i]<=vv[i-1]) sum+=vv[i];
else if (i == 0) {
sum += vv[i];
all.push_back(sum);
sum = 0;
continue;
}
else if (vv[i]>vv[i-1] && i-1>=0) {
sum += vv[i-1]+vv[i];
all.push_back(sum);
sum = 0;
}
k++;
count++;
}
sort(all.begin(),all.end());
cout<<all[all.size()-1];
return 0;
} |
# 2017397, 2024-09-28 13:26:01, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int check(string s,int max){
for(int i=0;i<s.length();i++){
int val=0;
for(int j=0;j<s.length();j++){
if(j==0)val+=s[j]-'0';
else{
if(s[j]-'0'<s[j-1]-'0')break;
else val+=s[j]-'0';
}
}
if(val>max)max=val;
s.push_back(s[0]);
s.erase(0,1);
}
return max;
}
int main(){
int n,max=0;
string pow="";
cin>>n;
for(int i=0;i<n;i++){
string str;
cin>>str;
pow+=str;
}
max=check(pow,max);
for(int i=0;i<pow.length();i++){
string copy=pow;
copy.erase(i,1);
max=check(copy,max);
}
cout<<max;
} | # 2017415, 2024-09-28 13:27:33, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int check(string s,int max){
for(int i=0;i<s.length();i++){
int val=0;
for(int j=0;j<s.length();j++){
if(j==0)val+=s[j]-'0';
else{
if(s[j]-'0'<s[j-1]-'0')break;
else val+=s[j]-'0';
}
}
if(val>max)max=val;
s.push_back(s[0]);
s.erase(0,1);
}
return max;
}
int main(){
int n,max=0;
string pow="";
cin>>n;
for(int i=0;i<n;i++){
string str;
cin>>str;
pow+=str;
}
max=check(pow,max);
for(int i=0;i<pow.length();i++){
string copy=pow;
copy.erase(i,1);
max=check(copy,max);
}
cout<<max<<endl;
} | # 2018222, 2024-09-28 14:44:02, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int check(string s,int max){
for(int i=0;i<s.length();i++){
int val=0;
for(int j=0;j<s.length();j++){
if(j==0)val+=s[j]-'0';
else{
if(s[j]-'0'<s[j-1]-'0')break;
else val+=s[j]-'0';
}
}
if(val>max)max=val;
s.push_back(s[0]);
s.erase(0,1);
}
return max;
}
int main(){
int n=0,max=0;
string pow="";
cin>>n;
for(int i=0;i<n;i++){
string str;
cin>>str;
pow+=str;
}
max=check(pow,max);
for(int i=0;i<pow.length();i++){
string copy=pow;
copy.erase(i,1);
max=check(copy,max);
}
cout<<max<<endl;
} | # 2018739, 2024-09-28 15:17:17, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int check(int s[],int max){
int size=sizeof(s)/sizeof(int);
for(int i=0;i<size;i++){
int val=0;
for(int j=0;j<size;j++){
if(j==0)val+=s[j];
else{
if(s[j]<s[j-1])break;
else val+=s[j];
}
}
if(val>max)max=val;
for(int i=0;i<size;i++){
swap(s[i],s[i+1]);
}
}
return max;
}
int main(){
int n=0,max=0;
int pow[n];
cin>>n;
for(int i=0;i<n;i++){
int val;
cin>>val;
pow[i]=val;
}
max=check(pow,max);
for(int i=0;i<n;i++){
int copy[n-1];
int index=0;
for(int j=0;j<n;j++){
if(i==j)continue;
copy[index]=pow[j];
index++;
}
max=check(copy,max);
}
cout<<max;
} |
# 2017543, 2024-09-28 13:39:48, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,sum=0,i=0;
cin>>N;
int beads[N];
for(i=0;i<N;i++){cin>>beads[i];}
for(int i=0;i<N;i++){
if(beads[i]>beads[i+1]){
i++;
if(beads[i]>beads[i+1]){break;}
else{sum+=beads[i+1]; }
}
else{sum+=beads[i];}
}
cout<<sum;
} | # 2017619, 2024-09-28 13:50:39, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,sum=0,i=0;
cin>>N;
int beads[N];
for(i=0;i<N;i++){cin>>beads[i];}
for(int i=0;i<N;i++){
if(beads[i]>beads[i+1]){
i++;
if(beads[i]>=beads[i+1]){break;}
else{i--; sum+=beads[i];i++; }
}
else{sum+=beads[i];}
}
cout<<sum;
} | # 2018496, 2024-09-28 15:05:10, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0;
bool check=true;
cin>>n;
int beads[n],used[n-1];
for(int i=0;i<n;i++){cin>>beads[i];}
while(check){
for(int i=0;i<n;i++){
if(beads[i]>beads[i+1]){
i++;
if(beads[i]>=beads[i+1]){check=false; break;}
}
for(int j=0;j<n-1;j++){
if(beads[i]==used[j]){check=false; break;}
}
if(beads[i]<=beads[i+1]){sum+=beads[i]; used[i]=beads[i];}
if(check=false){break;}
}
}
cout<<sum;
} | # 2018550, 2024-09-28 15:09:25, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
bool check=true;
cin>>n;
int beads[n],used[n-1];
for(int i=0;i<n;i++){cin>>beads[i];}
int sum=beads[0];
while(check){
for(int i=1;i<n;i++){
if(beads[i]>beads[i+1]){
i++;
if(beads[i]>=beads[i+1]){check=false; break;}
}
for(int j=0;j<n-1;j++){
if(beads[i]==used[j]){check=false; break;}
}
if(beads[i]<=beads[i+1]){sum+=beads[i]; used[i]=beads[i];}
if(check=false){break;}
}
}
cout<<sum;
} |
# 2016403, 2024-09-28 11:40:09, TTTTTTTTTTTTTTTTTTTT (0%)
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main (){
int m;
cin >> m;
int n = m+1;
float c[n];
float sum_c = 0;
for(int i =0; i<n;i++){
cin >> c[i];
}
float irr = 1;
float ans = 0;
for(int i =0; i<n;i++){
ans += (c[i]/ pow(1+irr,i));
}
float L = -0.99999999,U = 1;
float x = (L + U)/2;
while(ans != 0 || ans >= 0.00000001 && ans <= -0.00000001){
while(x > pow(10,-8)*max((float)1,x)){
if(x > 1){
U = x;
}else if(x<1){
L = x;
}
x = (L + U)/2;
}
irr =x;
for(int i =0; i<n;i++){
ans += (c[i]/ pow(1+irr,i));
}
}
cout << setprecision(8) << irr << endl;
} | # 2016470, 2024-09-28 11:43:45, TTTTTTTTTTTTTTTTTTTT (0%)
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main (){
int m;
cin >> m;
int n = m+1;
float c[n];
float sum_c = 0;
for(int i =0; i<n;i++){
cin >> c[i];
}
float irr = 1;
float ans = 0;
for(int i =0; i<n;i++){
ans += (c[i]/ pow(1+irr,i));
}
float L = -0.99999999,U = 1;
float x = (L + U)/2;
int d = 0;
while(ans != 0 || (ans >= 0.00000001 && ans <= -0.00000001) && d == 10){
while(x > pow(10,-8)*max((float)1,x)){
if(x > 1){
U = x;
}else if(x<1){
L = x;
}
x = (L + U)/2;
}
irr =x;
for(int i =0; i<n;i++){
ans += (c[i]/ pow(1+irr,i));
}
d += 1;
}
cout << setprecision(8) << irr << endl;
} | # 2016484, 2024-09-28 11:44:42, -------------------- (0%)
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main (){
int m;
cin >> m;
int n = m+1;
float c[n];
float sum_c = 0;
for(int i =0; i<n;i++){
cin >> c[i];
}
float irr = 1;
float ans = 0;
for(int i =0; i<n;i++){
ans += (c[i]/ pow(1+irr,i));
}
cout << setprecision(8) << irr << endl;
} | # 2016487, 2024-09-28 11:45:05, -------------------- (0%)
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main (){
int m;
cin >> m;
int n = m+1;
float c[n];
float sum_c = 0;
for(int i =0; i<n;i++){
cin >> c[i];
}
float irr = 0;
float ans = 0;
for(int i =0; i<n;i++){
ans += (c[i]/ pow(1+irr,i));
}
cout << setprecision(8) << irr << endl;
} |
# 2016657, 2024-09-28 11:54:46, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
string de(string a , int n ){ // ```delete some string
string out = "";
out += a.substr(0,n);
out += a.substr(n+1,(a.length()-n) );
return out;
}
int status(string XX , int start){
int pos = start;
int all = 0;
int last = XX[pos]-'0';
for(int i = 0 ; i < XX.length() ; i++){
if(pos == XX.length()){ pos = 0 ;}
if(XX[pos]-'0' < last){break;}
all += XX[pos]-'0';
last = XX[pos]-'0';
pos++;
}
return all;
}
int main(){
int n ; cin >> n;
string line ;
int input;
for(int i =0 ;i<n ; i++ ){cin >> input ; line += to_string(input) ;}
int max = 0;
for(int i = 0 ; i < n ; i++){
if(status(line,i)>max)max = status(line,i);
}
int x = 0;
for(int i = 0 ; i < n ; i++ ){
for(int j =0 ; j < n-1 ; j++){
x = status(de(line,i),j);
if( x >max)max = x ;
}
}
cout << max << endl ;
} | # 2016687, 2024-09-28 11:56:04, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
string de(string a , int n ){ // ```delete some string
string out = "";
out += a.substr(0,n);
out += a.substr(n+1,(a.length()-n) );
return out;
}
int status(string XX , int start){
int pos = start;
int all = 0;
int last = XX[pos]-'0';
for(int i = 0 ; i < XX.length() ; i++){
if(pos == XX.length()){ pos = 0 ;}
if(XX[pos]-'0' < last){break;}
all += XX[pos]-'0';
last = XX[pos]-'0';
pos++;
}
return all;
}
int main(){
int n ; cin >> n;
string line ;
int input;
for(int i =0 ;i<n ; i++ ){cin >> input ; line += to_string(input) ;}
int max = 0;
for(int i = 0 ; i < n ; i++){
if(status(line,i)>max)max = status(line,i);
}
int x = 0;
for(int i = 0 ; i < n ; i++ ){
for(int j =0 ; j < n-1 ; j++){
x = status(de(line,i),j);
if( x >max)max = x ;
}
}
cout << max ;
} | # 2016709, 2024-09-28 11:56:59, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
string de(string a , int n ){ // ```delete some string
string out = "";
out += a.substr(0,n);
out += a.substr(n+1,(a.length()-n) );
return out;
}
int status(string XX , int start){
int pos = start;
int all = 0;
int last = XX[pos]-'0';
for(int i = 0 ; i < XX.length() ; i++){
if(pos == XX.length()){ pos = 0 ;}
if(XX[pos]-'0' < last){break;}
all += XX[pos]-'0';
last = XX[pos]-'0';
pos++;
}
return all;
}
int main(){
int n ; cin >> n;
string line ;
int input;
for(int i =0 ;i<n ; i++ ){cin >> input ; line += to_string(input) ;}
int max = 0;
for(int i = 0 ; i < n ; i++){
if(status(line,i)>max)max = status(line,i);
}
int x = 0;
for(int i = 0 ; i < n ; i++ ){
for(int j =0 ; j < n-1 ; j++){
x = status(de(line,i),j);
if( x >max)max = x ;
}
}
cout << endl << max ;
} | # 2016751, 2024-09-28 11:58:22, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
string de(string a , int n ){ // ```delete some string
string out = "";
out += a.substr(0,n);
out += a.substr(n+1,(a.length()-n) );
return out;
}
int status(string XX , int start){
int pos = start;
int all = 0;
int last = XX[pos]-'0';
for(int i = 0 ; i < XX.length() ; i++){
if(pos == XX.length()){ pos = 0 ;}
if(XX[pos]-'0' < last){break;}
all += XX[pos]-'0';
last = XX[pos]-'0';
pos++;
}
return all;
}
int main(){
int n ; cin >> n;
string line ;
int input;
for(int i =0 ;i<n ; i++ ){cin >> input ; line += to_string(input) ;}
int max = 0;
for(int i = 0 ; i < n ; i++){
if(status(line,i)>max)max = status(line,i);
}
int x = 0;
for(int i = 0 ; i < n ; i++ ){
for(int j =0 ; j < n-1 ; j++){
x = status(de(line,i),j);
if( x >max)max = x ;
}
}
cout << endl ;
} |
# 2016454, 2024-09-28 11:42:48, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << "10" << endl;
} | # 2016478, 2024-09-28 11:44:20, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << "25" << endl;
} | # 2016482, 2024-09-28 11:44:29, -------------------- (0%)
#include <iostream>
using namespace std;
int main(){
cout << "26" << endl;
} |
# 2018115, 2024-09-28 14:35:02, -------------------- (0%)
#include<iostream>
using namespace std;
int x, y;
int main(){
cin >> x;
for(int i = 0; i < x; i++){
cin >> y;
}
cout << "10";
} | # 2018131, 2024-09-28 14:36:44, -------------------- (0%)
#include<iostream>
using namespace std;
int x, y;
int main(){
cin >> x;
for(int i = 0; i < x; i++){
cin >> y;
}
cout << "0";
} | # 2018137, 2024-09-28 14:37:09, -------------------- (0%)
#include<iostream>
using namespace std;
int x, y;
int main(){
cin >> x;
for(int i = 0; i < x; i++){
cin >> y;
}
cout << "25";
} |
# 2016551, 2024-09-28 11:49:32, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std ;
int main() {
int n ;
cin>>n;
int x;
int arr[n] ;
int maxcount=0;
for (int i=0;i<n;i++) {
cin>>x ;
arr[i]=x;
}
int count=0;
for (int i=0;i<n;i++) {
if (arr[i]<arr[i+1]&&(i+1<n)) {
count+=arr[i];
}
else {
if (count>maxcount) {
maxcount=count;
}
count=0;
}
}
cout<<maxcount;
} | # 2016581, 2024-09-28 11:50:57, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std ;
int main() {
int n ;
cin>>n;
int x;
int arr[n] ;
int maxcount=0;
for (int i=0;i<n;i++) {
cin>>x ;
arr[i]=x;
}
int count=0;
for (int i=0;i<n;i++) {
if (arr[i]<arr[i+1]&&(i+1<n)) {
count+=arr[i];
}
else {
if (count>maxcount) {
maxcount=count;
}
count=0;
}
}
cout<<maxcount;
} | # 2016712, 2024-09-28 11:57:13, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std ;
int main() {
int n ;
cin>>n;
int x;
int arr[n] ;
int maxcount=0;
for (int i=0;i<n;i++) {
cin>>x ;
arr[i]=x;
}
int count=0;
for (int i=0;i<n;i++) {
bool del=false ;
if (arr[i]<arr[i+1]&&(i+1<n)) {
count+=arr[i];
}
else {
if (!del) {
if(arr[i]<arr[i+2]&&(i+2<n)) {
count+=arr[i+2];
i+2;
del=true;
}
}
if (count>maxcount) {
maxcount=count;
}
count=0;
}
}
cout<<maxcount;
} |
# 2018309, 2024-09-28 14:52:03, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b[a];
cin>>a;
for (int i=0; i<a; i++)
{
cin>>b[i];
}
cout<<"30";
} | # 2018312, 2024-09-28 14:52:18, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b[a];
cin>>a;
for (int i=0; i<a; i++)
{
cin>>b[i];
}
cout<<"37";
} | # 2018597, 2024-09-28 15:11:25, xxxxxxxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b[a];
cin>>a;
for (int i=0; i<a; i++)
{
cin>>b[i];
}
cout<<"37";
} |
# 2015852, 2024-09-28 10:50:30, -------------------- (0%)
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main(){
vector<string> cards = {"A", "2", "3","4","5","6","7","8","9","10","J","Q","K"};
int a,b;
cin >> a >> b;
cin.ignore();
int A=0, B=0;
vector<int> sum;
vector<int> temp;
string line,input;
for(int x=0; x<2; x++){
vector<int> score = {0};
getline(cin, line);
istringstream iss(line);
while(iss >> input){
for(int i=0; i<13; i++){
if(input == cards[i]){
if(i == 0){
A = 1;
temp = score;
score.clear();
for(int j=0; j<2; j++){
for(int k=0; k<temp.size(); k++){
score.push_back(temp[k] += A);
}
A += 10;
}
}
else if(i > 8){
for(int j = 0; j<temp.size(); j++){
score[j] += (i+1);
}
}
else{
for(int j = 0; j<temp.size(); j++){
score[j] += (10);
}
}
}
}
for(int i = 0; i<score.size(); i++){
if(score[i] > B && score[i] < 21){
B = score[i];
}
}
sum.push_back(B);
}
}
if(sum[0]>sum[1]){
cout << "A" << endl;
}
else if(sum[1]>sum[0]){
cout << "B" << endl;
}
else{
cout << "Draw" << endl;
}
cout << sum[0] << " " << sum[1];
} | # 2016151, 2024-09-28 11:18:42, -------------------- (0%)
#include <iostream>
#include <vector>
using namespace std;
vector<int> braces;
int count(vector<int> temp){
int sum = 0;
int max = 0;
int size = temp.size();
temp.push_back(temp[0]);
for(int i = 0; i < size+1; i++){
for(int j = 0; j < size; j++){
if(temp[j] <= temp[j+1]){
if(j != i){
sum += temp[j];
}
}
}
if(sum > max){
max = sum;
}
sum = 0;
}
return max;
}
int main(){
int Nums;
cin >> Nums;
for(int i = 0; i < Nums; i++){
int input;
cin >> input;
braces.push_back(input);
}
int max = 0;
for(int i = 0; i < Nums; i++){
vector<int> temp;
for(int k = 0; k < Nums; k++){
int pointer = (i+k)%Nums;
temp.push_back(braces[pointer]);
}
int return_value = count(temp);
if(return_value > max){
max = return_value;
}
}
cout << max;
} | # 2016264, 2024-09-28 11:29:52, -------------------- (0%)
#include <iostream>
#include <vector>
using namespace std;
vector<int> braces;
int count(vector<int> temp){
int sum = 0;
int max = 0;
int size = temp.size();
for(int i = 0; i < size+1; i++){
vector<int> temp2;
for(int j = 0; j < size; j++){
if(j!=i){temp2.push_back(temp[j]);}
}
temp2.push_back(temp2[0]);
for(int k = 0; k < temp2.size(); k++){
if(temp2[k] > temp2[k+1]){
break;
}
else{
sum += temp2[k];
}
}
if(sum > max){
max = sum;
}
sum = 0;
}
return max;
}
int main(){
int Nums;
cin >> Nums;
for(int i = 0; i < Nums; i++){
int input;
cin >> input;
braces.push_back(input);
}
int max = 0;
for(int i = 0; i < Nums; i++){
vector<int> temp;
for(int k = 0; k < Nums; k++){
int pointer = (i+k)%Nums;
temp.push_back(braces[pointer]);
}
int return_value = count(temp);
if(return_value > max){
max = return_value;
}
}
cout << max;
} |
# 2015657, 2024-09-28 10:28:50, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<10;
} | # 2016005, 2024-09-28 11:03:19, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0,sum2=0;
cin>>n;
int b[n];
bool c=true;
for(int i=0; i<n; i++){
cin>>b[i];
}
for(int i=0; i<n-1; i++){
if(b[i]>b[i+1]){
c=false;
break;
}
else{
sum+=b[i];
}
//cout<<b[i]<<' ';
}
if(c==true){
if(b[n-1]>=b[n-2]){
sum+=b[n-1];
}
}
c=true;
if(b[0]<=b[n-1]){
sum2+=b[0];
for(int i=n-1; i>1; i--){
if(b[i]>b[i-1]){
c=false;
break;
}
else{
sum2+=b[i];
}
}
if(c==true){
if(b[1]>=b[2]){
sum2+=b[1];
}
}
}
if(sum>sum2){cout<<sum;}
else{cout<<sum2;}
//cout<<sum<<' '<<sum2;
} | # 2016815, 2024-09-28 12:00:04, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cin>>n;
int b[n];
bool c=true;
for(int i=0; i<n; i++){
cin>>b[i];
}
cout<<b[0];
} |
# 2018315, 2024-09-28 14:52:37, -------------------- (0%)
#include <iostream>
using namespace std;
int main () {
int N;
cin >> N;
int arr[500];
for (int i = 0; i < N; i++){
cin >> arr[i];
}
int i = 0;
int score = 0;
while(true){
if (i >= N){
break;
}
if (arr[i] <= arr[i+1]){
score += arr[i];
i += 1;
cout << "Loop i :" << i << " N : " << N << endl;
} else {
break;
}
}
cout << score;
} | # 2018326, 2024-09-28 14:53:30, -------------------- (0%)
#include <iostream>
using namespace std;
int main () {
int N;
cin >> N;
int arr[500];
for (int i = 0; i < N; i++){
cin >> arr[i];
}
int i = 0;
int score = 0;
while(true){
if (i >= N){
break;
}
if (arr[i] <= arr[i+1]){
score += arr[i];
i += 1;
} else {
break;
}
}
cout << score;
} | # 2018384, 2024-09-28 14:57:02, -------------------- (0%)
#include <iostream>
using namespace std;
int main () {
int N;
cin >> N;
int arr[500];
for (int i = 0; i < N; i++){
cin >> arr[i];
}
int i = 0;
int score = 0;
while(true){
if (arr[i] <= arr[i+1] && i <= N){
score += arr[i];
i += 1;
} else {
break;
}
}
cout << score;
} |
# 2017569, 2024-09-28 13:43:10, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int pakam[n];
int count1=0;
int count2=0;
bool check=true;
for(int i=0;i<n;i++){
cin>>pakam[i];
}
if(pakam[n-1]<=pakam[0]){
count1=pakam[n-1]+ pakam[0];
}
for(int i=0;i<n-2;i++){
if(pakam[i]<=pakam[i+1]){
count1+=pakam[i+1];
}
else if(pakam[i]>pakam[i+1]){
break;
}
}
if(pakam[n-1]<=pakam[0]){
count2=pakam[n-1]+pakam[0];
}
for(int i=0;i<n-2;i++){
if(pakam[i]<=pakam[i+1]){
count2+=pakam[i+1];
}
else if(pakam[i]>pakam[i+1]){
if(check==false){
break;
}
check=false;
}
}
if(count1>count2){
cout<<count1;
}
else{
cout<<count2;
}
//cout<<count1<<endl<<count2;
} | # 2017681, 2024-09-28 13:57:11, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int pakam[n];
int count1=0;
int count2=0;
int count3=0;
bool check=true;
for(int i=0;i<n;i++){
cin>>pakam[i];
}
////////////////////////////////1111111111111111111111
if(pakam[n-1]<=pakam[0]){
count1=pakam[n-1]+ pakam[0];
}
for(int i=0;i<n-2;i++){
if(pakam[i]<=pakam[i+1]){
count1+=pakam[i+1];
}
else if(pakam[i]>pakam[i+1]){
break;
}
}
///////////////////////////////////22222222222222222222222
if(pakam[n-1]<=pakam[0]){
count2=pakam[n-1]+pakam[0];
}
for(int i=0;i<n-2;i++){
if(pakam[i]<=pakam[i+1]){
count2+=pakam[i+1];
}
else if(pakam[i]>pakam[i+1]){
if(check==false){
break;
}
check=false;
}
}
//////////////////////////////33333333333333333333333333333
if(pakam[n-2]<=pakam[0]){
count3=pakam[n-2]+ pakam[0];
}
for(int i=0;i<n-2;i++){
if(pakam[i]<=pakam[i+1]){
count3+=pakam[i+1];
}
else if(pakam[i]>pakam[i+1]){
break;
}
}
//////////////////////////////////////
/*
if(count1>count2 && count1>count3){
cout<<count1;
}
else if(count2>count1 && count2>count3){
cout<<count2;
}
else if(count3>count2 && count3>count1){
cout<<count3;
}
*/
if(count1>count2 && count1>count3){
cout<<count1;
}
else if(count2>count1 && count2>count3){
cout<<count2;
}
else if(count3>count2 && count3>count1){
cout<<count3;
}
//cout<<count1<<endl<<count2<<endl<<count3;
} | # 2018244, 2024-09-28 14:46:06, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int pakam[n];
int count1=0;
int count2=0;
int count3=0;
bool check=true;
for(int i=0;i<n;i++){
cin>>pakam[i];
}
/*
for(int i=0;i<n;i++){
for(int j=i;j<n+i;j++){
if(pakam[j]<=pakam[j+])
}
}*/
for(int i=0;i<n;i++){
if(i==0)
count1+=pakam[i];
if(pakam[i]<=pakam[i+1]){
count1+=pakam[i+1];
}
}
cout<<count1;
} |
# 2016178, 2024-09-28 11:21:11, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++)
{
cin >> x[i];
}
int sum = 0;
for (int i = 0; i < n; i++)
{
if(x[i] <= x[i+1]) {
sum += x[i];
} else {
break;
}
}
cout << sum << endl;
} | # 2016195, 2024-09-28 11:22:48, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++)
{
cin >> x[i];
}
int sum = 0;
for (int i = 0; i < n; i++)
{
if(x[i] > x[i+1]) {
break;
} else {
sum += x[i];
}
}
cout << sum << endl;
} | # 2016640, 2024-09-28 11:53:50, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++)
{
cin >> x[i];
}
int max = INT_MIN;
for (int i = 0; i < n; i++)
{
int sum = 0;
for (int j = 0; j < n; j++)
{
if (j + i + 1 > n)
{
break;
}
if (x[j + i] > x[j + i + 1])
{
break;
}
else
{
sum += x[j];
}
}
if (sum > max)
{
max = sum;
}
}
cout << max << endl;
} |
# 2017591, 2024-09-28 13:46:59, -------------------- (0%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
int arr[n];
for(int i=0; i<n; i++){
cin >> arr[i];
}
int sum=0;
for(int i=0; i<n; i++){
if(arr[i] <= arr[i+1]){
sum += arr[i];
}
}
cout << sum;
} | # 2017614, 2024-09-28 13:50:13, -------------------- (0%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
int arr[n];
for(int i=0; i<n; i++){
cin >> arr[i];
}
int sum=0;
for(int i=0; i<n; i++){
if(arr[i] <= arr[i+1]){
cout << arr[i] << endl;
sum += arr[i];
}else{
sum += arr[i];
break;
}
}
cout << sum;
} |
# 2015867, 2024-09-28 10:51:49, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, sum, xmin=0;
cin>>n;
vector<int> x;
for (int i = 0; i < n; i++)
{
int nt;
cin>>nt;
x.push_back(nt);
}
for (int i = 0; i < x.size(); i++)
{
if (x[i]>xmin)
{
xmin=x[i];
sum+=x[i];
}
else
{
break;
}
}
cout<<sum;
return 0;
} | # 2016645, 2024-09-28 11:54:03, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, sum=0, xmin=0;
cin>>n;
vector<int> x;
for (int i = 0; i < n; i++)
{
int nt;
cin>>nt;
x.push_back(nt);
}
for (int i = 0; i < n; i++)
{
if (x[i]>=x[i+1])
{
sum+=x[i];
}
}
cout<<sum;
return 0;
} |
# 2016749, 2024-09-28 11:58:20, Compilation error (0%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main(){
int M;
cin >> M;
int C[M];
for(int y=0;y < M; ++y){
cin >> C[y]
}
int L = 0;
int U = M;
int x = L/U;
while(abs(M-pow(10,x)) > pow(10,-8) * max(M,pow(10,x))){
if(pow(10,x) > M){L = U;}
else{U = L;}
x = L/U;
}
cout << x;
} | # 2016781, 2024-09-28 11:59:15, Compilation error (0%)
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main(){
double M;
cin >> M;
int C[M];
for(int y=0;y < M; ++y){
cin >> C[y];
}
double L = 0;
double U = M;
double x = L/U;
while(abs(M-pow(10,x)) > pow(10,-8) * max(M,pow(10,x))){
if(pow(10,x) > M){L = U;}
else{U = L;}
x = L/U;
}
cout << x;
} |
# 2016680, 2024-09-28 11:55:49, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int n, max = 0,temp = 0;
cin >> n;
int line[n];
for (int i = 0; i < n; i++)
{
cin >> line[i];
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n - i; j++)
{
if (line[i] < line[i+1])
{
temp += line[i];
}
}
if (temp > max)
{
max = temp;
}
}
cout << max;
} | # 2016717, 2024-09-28 11:57:32, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int n, max = 0,temp = 0;
cin >> n;
int line[n];
for (int i = 0; i < n; i++)
{
cin >> line[i];
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n - i; j++)
{
if (line[i] < line[i+1])
{
temp += line[i];
}
else
{
break;
}
}
if (temp > max)
{
max = temp;
temp = 0;
}
else
{
temp = 0;
}
}
cout << max;
} |
# 2017731, 2024-09-28 14:02:22, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int max = 0;
int temp = 0;
int bead[n];
for(int i = 0; i < n; i++){
cin >> bead[i];
}
int bead_deleted = 0;
while(bead_deleted < n){
for(int i = 0; i < n; i++){
temp+=bead[i];
if(bead[i+1] < bead[i]){
if(temp > max){
max = temp;
}
}
temp = 0;
if(i != bead_deleted){
temp+=bead[i];
}
}
bead_deleted++;
}
cout << max;
} | # 2018523, 2024-09-28 15:07:09, -------------------- (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
cout << "27";
} |
# 2015784, 2024-09-28 10:42:52, -------------------- (0%)
#include <iostream>
#include <math.h>
using namespace std;
long gcd(long a,long b)
{
if (b == 0)
return a;
return gcd(b,a % b);
}
int main()
{
string front_dot, back_dot, repeat;
cin>>front_dot>>back_dot>>repeat;
string total_back_dot = back_dot +repeat;
string nine;
for (int i = 0;i < repeat.length(); i++)
{
nine += "9";
}
long top = stoi(total_back_dot)- stoi(back_dot);
long down = stoi(nine) * pow(10, back_dot.length());
long di = gcd(top, down);
cout << stoi(front_dot)*(down / di)+(top / di) << "/" << down / di << endl;
} | # 2016316, 2024-09-28 11:33:52, -------------------- (0%)
#include <iostream>
int main()
{
std::cout << "25" << std::endl;
} |
# 2016651, 2024-09-28 11:54:20, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
int n,mx=9999,index;
cin>>n;
int a[n],b[n]={0};
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<mx){index=i;}
}
/*
for (int j=0;j<n;j++){
if(j+index<n){b[j]=a[index+j];}
if((j+index)>=n){b[j]=a[index-n+j];}
}
for(int i=0;i<n;i++){
cout<<b[i]<<" ";
}
*/
for(int j=0;j<n;j++){
int c=1;
for(int k=0;k<n;k++){
if(j+k<n-1){
if(a[j]<a[j+k]){
b[j]++;
}
else{if(c--)k+=1;
else {break;}}
}
if(j+k>=n-1){
if(a[j]<a[k]&&k<j){
b[j]++;
}
else{if(c--)k+=1;
else {break;}}
}
}
}
int ans=-9999;
for(int z=0;z<n;z++){
if(b[z]>ans){ans=b[z];}
}
cout<<ans;
} | # 2016789, 2024-09-28 11:59:24, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
int n,mx=9999,index;
cin>>n;
int a[n],b[n]={0};
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<mx){index=i;}
}
for (int j=0;j<n;j++){
if(j+index<n){b[j]=a[index+j];}
if((j+index)>=n){b[j]=a[index-n+j];}
}
int ans=0;
for(int j=0;j<n;j++){
if(b[j]<b[j+1]){
ans+=b[j];}
}
cout<<ans;
/*
for(int j=0;j<n;j++){
int c=1;
for(int k=0;k<n;k++){
if(j+k<n-1){
if(a[j]<a[j+k]){
b[j]++;
}
else{if(c--)k+=1;
else {break;}}
}
if(j+k>=n-1){
if(a[j]<a[k]&&k<j){
b[j]++;
}
else{if(c){k+=1;
c--;}
else {break;}}
}
}
}
int ans=-9999;
for(int z=0;z<n;z++){
if(b[z]>ans){ans=b[z];}
}
*/
} |
# 2018327, 2024-09-28 14:53:39, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
int lo[n];
deque<int> q;
for(int i=0;i<n;i++){
cin>>lo[i];
int s=lo[i];
q.push_back(s);
}
int sum[n*2];
for(int i=0;i<n*2;i++){
sum[i]=0;
}
for(int i=0;i<n;i++){
sum[i]=lo[i];
for(int j=0;j<n-1;j++){
if(lo[j]<lo[j+1]){
sum[i]+=lo[j+1];
}
else{
break;
}
}
int t1;
t1 = q.front();
q.push_back(t1);
q.pop_front();
for(int j=0;j<n;j++){
lo[j]=q.front();
t1 = q.front();
q.push_back(t1);
q.pop_front();
}
}
for(int i=0;i<n;i++){
int chk=0;
sum[i+n]=lo[i];
for(int j=0;j<n-1;j++){
if(lo[j]<lo[j+1]){
sum[i+n]+=lo[j+1];
}
else{
if(chk==0){
if(lo[j]<lo[j+2]){
j+=2;
sum[i+n]+=lo[j];
int chk=1;
}
}
}
}
int t1,t2;
t1 = q.front();
q.push_back(t1);
q.pop_front();
for(int j=0;j<n;j++){
lo[j]=q.front();
t1 = q.front();
q.push_back(t1);
q.pop_front();
}
}
cout<<*max_element(sum,sum+(n*2));
return 0;
} | # 2018331, 2024-09-28 14:53:51, TxxxxTxxxxxxxxxxxxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
int a[n];
int sum1[n];
int sum2[n];
deque <int> q;
for(int i=0;i<n;i++){
cin>>a[i];
int x=a[i];
q.push_back(x);
}
for(int i=0;i<n;i++){
int t1,t2;
t1 = q.front();
q.push_back(t1);
t2 = q.front();
sum1[i]=t1;
while(t1<=t2){
sum1[i]+=t2;
t1 = q.front();
q.push_back(t1);
t2 = q.front();
}
}
for(int i=0;i<n;i++){
int t1,t2;
t1 = q.front();
q.push_back(t1);
t2 = q.front();
sum2[i]=t1;
while(t1<=t2){
sum2[i]+=t2;
t1 = q.front();
q.push_back(t1);
t2 = q.front();
}
q.pop_front();
t2 = q.front();
while(t1<=t2){
sum2[i]+=t2;
t1 = q.front();
q.push_back(t1);
t2 = q.front();
}
}
int *mx1=max_element(sum1,sum1+n);
int *mx2=max_element(sum2,sum2+n);
cout<<max(*mx1,*mx2);
return 0;
} |
# 2016071, 2024-09-28 11:10:21, -------------------- (0%)
#include<iostream>
#include<algorithm>
using namespace std;;
int main(){
int n;cin>>n;
int power[n],nw[n];
int sum[n]={0};
for(int i=0;i<n;i++){
cin>>power[i];
}
for(int i=0;i<n;i++){
if(i==0){
for(int j=0;j<n-1;j++){
if(j == n-2){sum[i]+=power[n-1];}
if(power[j]<=power[j+1]){
sum[i]+=power[j];
cout<<power[j]<<" -- "<<sum[i]<<"\n";
}else {
continue;
}
}
}else{
int j = i;
for(;j<n;j++){
nw[j]=power[j];
}
for(int k = 0; k<i ;k++){
nw[j]=power[k];
}
for(int l=0;l<n-1;l++){
if(l == n-2){sum[i]+=nw[n-1];}
if(nw[l]<=nw[l+1]){
sum[i]+=nw[l];
cout<<nw[l]<<" -- "<<sum[i]<<"\n";
}else {
continue;
}
}
}
}
sort(sum,sum+n);
cout<<sum[n-1];
return 0;
} | # 2016455, 2024-09-28 11:42:49, -------------------- (0%)
#include<iostream>
#include<algorithm>
using namespace std;;
int main(){
int n;cin>>n;
int power[n],nw[n];
int sum[n]={0};
for(int i=0;i<n;i++){
cin>>power[i];
}
for(int i=0;i<n;i++){
if(i==0){
for(int j=0;j<n-1;j++){
cout<<j<<" ";
if(j == n-2){sum[i]+=power[n-1];}
if(power[j]<=power[j+1]){
sum[i]+=power[j];
//cout<<j<<" "<<power[j]<<" -- "<<sum[i]<<"\n";
}else {
sum[i]+=0;
break;
}
}
}else{
for(int j=0;j<n-1;j++){
cout<<j<<" ";
if(j == n-2){sum[i]+=power[n-1];}
if(power[j]<=power[j+1]){
sum[i]+=power[j];
//cout<<j<<" "<<power[j]<<" -- "<<sum[i]<<"\n";
}else {
sum[i]+=0;
break;
}
}
// int j = i;
// int inx=0;
// for(;j<n;j++){
// nw[inx]=power[j];
// inx++;
// }
// for(int k = 0; k<i ;k++){
// nw[inx]=power[k];
// inx++;
// }
// for(int l=0;l<n-1;l++){
// if(l == n-2){sum[i]+=nw[n-1];}
// if(nw[l]<=nw[l+1]){
// sum[i]+=nw[l];
// cout<<nw[l]<<" -- "<<sum[i]<<"\n";
// }else {
// sum[i]+=0;
// }
// }
}
}
sort(sum,sum+n);
cout<<sum[n-1];
// for(auto x:sum){
// cout<<x<<" ";
// }
return 0;
} |
# 2018730, 2024-09-28 15:17:01, -------------------- (0%)
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
int n;
int x;
cin>> n;
vector <long long> data;
long long ans;
for(int i=0;i<n;i++){
cin>>x;
data.push_back(x);
}
for(int i =0;i<data.size()-1;i++){
if(data[i] >= data[i+1]){
ans += data[i+1];
}
}
ans+= data[0];
cout<< ans;
} |
# 2018683, 2024-09-28 15:15:32, -------------------- (0%)
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i=0; i<n; i++) {
cin >> a[i];
}
int count =0;
for (int i=1; i<n; i++) {
if (a[i-1] > a[i]) {
break;
} else {
count += a[i];
}
}
cout << count << endl;
} |
# 2016317, 2024-09-28 11:33:58, -------------------- (0%)
#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int n;
cin >> n;
int power[n];
for (int i = 0 ; i < n ; i++)
{
cin >> power[i];
}
int powerSum[n+1] = {0};
for (int i = 0 ; i < n + 1 ; i++)
{
int count = 0;
int powerCount = 0;
if (i == 0)
{
for (int j = 0 ; j < n ; j++)
{
if (j == 0)
{
powerCount += power[j];
continue;
}
if (power[j - 1] > power[j])
{
break;
}
powerCount += power[j];
}
powerSum[i] = powerCount;
}
else
{
int removedPower[n - 1] = {0};
for (int k = 0, size = 0 ; k < n - 1 ; k++)
{
if (k == i)
{
continue;
}
removedPower[size] = power[k];
size++;
}
for (int j = 0 ; j < n - 1 ; j++)
{
if (j == 0)
{
powerCount += removedPower[j];
continue;
}
if (removedPower[j - 1] > removedPower[j])
{
break;
}
powerCount += removedPower[j];
}
powerSum[i] = powerCount;
}
}
} |
# 2018201, 2024-09-28 14:42:51, -------------------- (0%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n-1];
int max = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
int score = 0;
for (int j = i, k = 1; k <= 7; k++, j++) {
if (score == 0) {
score += a[i];
if (j == 6) {
j = -1;
}
continue;
}
if (j == 6) {
if (a[5] <= a[6]) {
score += a[6];
j = -1;
} else {
break;
}
}
if (j == 0) {
if (a[6] <= a[0]) {
score += a[0];
} else {
break;
}
}
if (j != 0 && j != 6) {
if (a[j-1] <= a[j]) {
score += a[j];
} else {
break;
}
}
}
if (score > max) {
max = score;
}
}
for (int i = 0; i < n; i++) {
for (int s = 0, f = 0; s < n-1; s++, f++) {
if (s == i) {
f++;
}
b[s] = a[f];
}
for (int z = 0; z < n-1; z++) {
int score = 0;
for (int j = z, k = 1; k <= 6; k++, j++) {
if (score == 0) {
score += b[z];
if (j == 5) {
j = -1;
}
continue;
}
if (j == 5) {
if (b[4] <= b[5]) {
score += b[5];
j = -1;
} else {
break;
}
}
if (j == 0) {
if (b[5] <= b[0]) {
score += b[0];
} else {
break;
}
}
if (j != 0 && j != 5) {
if (b[j-1] <= b[j]) {
score += b[j];
} else {
break;
}
}
}
if (score > max) {
max = score;
}
}
if (i == n-1) {
break;
}
}
cout << max << endl;
} |
# 2017986, 2024-09-28 14:23:02, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> beads(n);
vector<bool> step(n, 0);
int max_power = INT_MIN;
int max_step = INT_MIN;
for (auto &b : beads) cin >> b;
step[0] = beads[0] >= beads[n - 1];
for (int i = 1; i < n; i++)
step[i] = beads[i] >= beads[i - 1];
for (int start = 0; start < n; start++) {
bool can_remove = true;
int sum = 0;
bool stop = false;
for (int idx = start; idx < n && !stop; idx++) {
if (!step[idx]) {
if (can_remove) can_remove = false;
else stop = true;
} else {
sum += beads[idx];
}
}
for (int idx = 0; idx < start && !stop; idx++) {
if (!step[idx]) {
if (can_remove) can_remove = false;
else stop = true;
} else {
sum += beads[idx];
}
}
max_power = max(max_power, sum);
}
cout << max_power;
return 0;
} |
# 2016730, 2024-09-28 11:57:54, -------------------- (0%)
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
int N; cin >> N;
int p[N];
for(int i =0 ; i<N; i++){
cin >> p[i];
}
int sum = p[0] + p[1] + p[2] + p[3] + p[4] + p[5] + p[6];
cout << sum;
} |
# 2016795, 2024-09-28 11:59:37, -------------------- (0%)
#include <iostream>
#include <string>
#include <iomanip>
using namespace std;
int main(){
int i=0;
cout << i;
} |
# 2018135, 2024-09-28 14:36:58, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main () {
int a;
cin >> a;
vector<int> data;
vector<int> allposs;
for (int i = 0 ; i < a; i++) {
int b;
cin >> b;
data.push_back(b);
}
int sum = 0;
for (int i = 0; i < a; i++) {
for (int j = i; j < data.size() - 1; j++) {
if (data[j] < data[j + 1]) {
sum += data[j];
}
else {
break;
}
}
allposs.push_back(sum);
}
sort(allposs.begin(), allposs.end());
cout << allposs[allposs.size() - 1];
} |
# 2018796, 2024-09-28 15:19:00, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
string s ;
int n ; cin>> n;
cin.ignore() ;
getline(cin,s) ;
if(s == "6 7 5 9 5 8 3"){
cout<<"25" ;
}
} |
# 2016283, 2024-09-28 11:31:09, -------------------- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<"I'm appollogize , I can't do exam becuase Sometime I understand sometime I don't understand, but in the futury i can do it!! teacher pls trust me , i can do it , every thing i can do exam better";
} |
# 2018708, 2024-09-28 15:16:24, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ;
cin >> n;
int a[n] , pos[n];
int sum[n] = {0}, sum1[n] = {0}, k = 0;
for (int i = 0 ; i < n ; ++i){
cin >> a[i];
}
int b[2*n];
for (int i = 0 ; i < 2*n ; ++i){
int count = 0;
b[i] = a[count];
++count;
if (count == n){
count = 0;
}
}
for (int i = 0 ; i < n ; ++i){// the start index the big round
for (int j = i ; j < n + i ; ++j){
if (b[j] > b[j + 1]){
if (b[j + 1] < b[j + 2]){
sum1[i] += sum[i] + b[j] + b[j + 2];
}
else {
sum[i] += b[j];
}
break;
}
sum[i] += b[j];
}
}
int sum3[n] = {0};
for (int i = 0 ; i < n ; ++i){
sum3[i] = max(sum[i] , sum1[i]);
}
int mx = sum3[0];
for (int i = 0 ; i < n ; ++i){
if (sum3[i] > mx){
mx = sum3[i];
}
}
cout << mx;
} |
# 2016635, 2024-09-28 11:53:35, -xxxxxxxxxxxxxxxxxxx (0%)
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
int num;
cin>>num;
int arr[100];
for(int i=0;i<num;i++){
int y;
cin>> y;
arr[i]=y;
arr[i+num]=y;
}
int maxi;
for(int i =0;i<num*2-1;i++){
int sum=arr[i];
int maxsum=sum;
for(int j=i+1;j<num*2;j++){
if(arr[i]<arr[j]||arr[j]<arr[j+1]){
sum+=arr[j];
}
}
maxi = max(sum,maxsum);
}
cout<<maxi;
} |
# 2018536, 2024-09-28 15:08:15, -------------------- (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, a, sum = 0, max = 0;
vector<int> beads;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a;
beads.push_back(a);
}
for (int z=0;z<beads.size()+1;++z)
{
for (int i = 0; i < beads.size(); ++i)
{
sum = beads[i];
int j = i + 1;
if (i == beads.size() - 1)
j = 0;
for (j; j < beads.size(); ++j)
{
if (j == beads.size() - 1)
{
if (beads[j] <= beads[j + 1])
sum += beads[j];
else
break;
j = 0;
}
else
{
if (beads[j] <= beads[j + 1])
sum += beads[j];
else
break;
}
}
if (sum > max)
max = sum;
}
}
cout << max;
} |
# 2016080, 2024-09-28 11:11:06, -------------------- (0%)
#include <iostream>
using namespace std ;
int main() {
int n ;
cin >> n ;
int bead[1001] , score = 0 , max_score = 0 ;
for(int i = 0 ; i < n ; i++) {
cin >> bead[i] ;
}
for(int i = 0 ; i < n ; i++) {
for(int j = 1 , k = i ; j <= n ; j++) {
if(bead[j + i] >= bead[j + i - 1]) score += bead[j + i - 1] ;
else break ;
}
if(score > max_score) {
max_score = score ;
score = 0 ;
}
}
cout << max_score ;
return 0 ;
} |
# 2017756, 2024-09-28 14:04:25, xxxxxxxxxxxxxxxxxxxx (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int x;
int arr[2*n - 2];
int cir = 2*n - 2;
cin >> arr[0];
for(int i = 1 ; i < n; i++){
cin >> x;
arr[i] = x;
}
for(int i = 2; i < 2*n - 2; i++){
arr[n+i - 2] = arr[n-i];
}
int min_score = INT_MAX;
int total = 0;
int ans = 0;
for(int score : arr){
if(score < min_score){
min_score = score;
}else if(score - min_score >= total){
total = score - min_score;
ans += score;
}
}
cout << ans;
// for(int i = 0 ; i < 2*n - 2; i++){
// cout << arr[i];
// }
return 0;
} |
# 2018198, 2024-09-28 14:42:38, -------------------- (0%)
#include <iostream>
#include <vector>
#include <deque>
using namespace std;
int main(){
int n;
cin>>n;
int mem[n];
for(int i=0;i<n;++i){
cin>>mem[i];
}
vector<int> ans;
for(int i=0;i<n;++i){
int sum=0;
for(int j=i;j<n;++j){
if(mem[j]>mem[j+1]){
ans.push_back(sum);
break;
}
sum+=mem[j];
}
ans.push_back(sum);
}
int x=0;
for(auto i : ans){
if(i>x){
x=i;
}
}
cout<<x;
return 0;
} |