Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define debug(x) cerr << fixed << #x << " is " << x << endl;
const int MAX_N = 105;
const int MAX_A = 105;
int n;
int dp[2][MAX_N][MAX_N*MAX_A];
int grid[2][MAX_N];
int dp_solve(int x, int y, int sum)
{
if(x >= 2 || y >= n)
return sum;
if(dp[x][y... | 265 |
Project_CodeNet | 2,020 | #include<iostream>
#include<fstream>
#include<bitset>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<iomanip>
#include<queue>
#include<stack>
#include<numeric>
#include<utility>
#include<regex>
#include<climits>
void Init() {
std::cin.tie(0); std::ios::sync_... | 3,051 |
Project_CodeNet | 2,018 | #include<iostream>
#include<fstream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<queue>
#include<map>
#include<set>
#include<algorithm>
#include<iomanip>
#include<bitset>
using namespace std;
int n, a[2][200];
int main() {
//freopen("ttt", "r", stdin);
cin >> n;
int i, j... | 237 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,b,n) for(int i=b;i<(int)n;i++)
#define rep(i,n) REP(i,0,n)
#define all(obj) (obj).begin(),(obj).end()
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,maxi=0;cin>>n;
vector<int> a(n),b(n);
rep(i,n)cin>>a[i];
... | 178 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
/*入力*/
int N,Max=0;
cin >> N;
int A[2][N];
for(int i=0;i<N;i++)cin >> A[0][i];
for(int i=0;i<N;i++)cin >> A[1][i];
/*最大値全探索*/
for(int i=0;i<N;i++){
int Sum=0;
for(int j=0;j<=i;j++)Sum+=A[0][j];
for(int k=i;k<N;k++)Sum+=A[1][k];
if(Sum>Max)Max=Sum... | 157 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a[105],b[105],c[105],ans,n;
int i,f;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
scanf("%d",&b[i]);
f=a[1];
for(i=1;i<=n;i++)
f+=b[i];
ans=f;
for(i=2;i<=n;i++)
{
... | 154 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(cons... | 663 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#includ... | 461 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
int main() {
std::vector<int> A1;
std::vector<int> A2;
int N;
std::cin >> N;
A1.resize(N);
A2.resize(N);
for (int i = 0; i < N; i++) std::cin >> A1[i];
for (int i = 0; i < N; i++) std::cin >> A2[i];
int sum1 = 0, sum2 = 0;
for (int i = 0;... | 207 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
int main() {
int N;
int top[100], bottom[100];
cin >> N;
for (int i = 0; i < N; i++) {
int t;
cin >> t;
if (i == 0) {
top[i] = t;
} else {
top[i] = t + top[i-1];
}
}
for (i... | 259 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define fi first
#define se second
const int inf = 1e9;
#define rep(i,n) for(int i = 0;i < n;i++)
#define rrep(i,n) for(int i = 1;i <= n;i++)
int a[4][104], dp[4][104];
int main(){
int n;
scanf("%d", &n);
rrep(i,2)rrep(j,n)scanf("%d", &a[i][j]);... | 187 |
Project_CodeNet | 2,018 | #if !defined(__clang__) && defined(__GNUC__)
#include <bits/stdc++.h>
#else
#include <cstdlib>
#include <climits>
#include <iostream>
#include <cstdint>
#include <vector>
#include <string>
#include <complex>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <set>
#include ... | 369 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(... | 397 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pll pair <ll , ll>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define X first
#define Y second
#define LB(x) ((x) & -(x))
#define BIT(a , b) (((a)>>(b)) ... | 242 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e9
#define LINF 1e18
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<int, P> Pi;
typedef pair<P, P> PP;
const int MOD = 1e9 + 7;
const int dy[] = { 0, 0, 1, -1 };
const int dx[] = { 1, -1, 0, 0 };
template <cla... | 335 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
int main()
{
int n;
scanf("%d", &n);
vector<vector<int>> a(3, vector<int>(n + 1, 0));
for(int i = 1; i < 3; ++i)
{
for(int j = 1; j <= n; ++j)
{
scanf("%d", &a[i][j]);
a[i][j] += max(a[i - 1][j], a[i][j - 1]);
}
}
printf("%d\n", a[2][n]);
} | 131 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#define fi first
#define se second
#define pb push_back
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,b) for (int i=a; i<=b; i++)
#define per(i,a,b) for (int i=a; i>=b; i--)... | 354 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
std::vector<int> a(N),b(N);
for(int i=0;i<N;i++)cin>>a[i];
for(int i=0;i<N;i++)cin>>b[i];
for(int i=1;i<N;i++)a[i]+=a[i-1];
for(int i=1;i<N;i++)b[N-1-i]+=b[N-1-i+1];
int ans=0;
for(int i=0;i<N;i++)ans=max(ans,a[i]+b[i]);
cout<... | 140 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <bitset>
#include <climits>
#define REP(i,n) for (int i=0;i<(n);i++)
#define F... | 383 |
Project_CodeNet | 2,018 | /**
In the name of Allah, the Most Gracious, the Most Merciful.
**/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e2 + 5;
const int M = 1e6 + 7;
int n;
int ara[3][N], dp[3][N];
int rec(int i, int j) {
if( i == 2 || j == n ) return 0;
if( i == 1 && j == n ) return 0;
... | 278 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define resz(v, ...) (v).clear(), (v).resize(__VA_ARGS__)
#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)
template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>... | 372 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#pragma GCC target ("avx2")
#pragma GCC optimization ... | 697 |
Project_CodeNet | 2,018 | #include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstdio>
using names... | 315 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
int ame[2][N];
for (int i = 0; i < 2; i++) {
for (int j = 0;j < N; j++) {
cin >> ame[i][j];
}
}
int val[N] = {};
val[0] = ame[0][0];
for(int k = 0;k < N; k++){
val[0] += ame[1][k];
}
for(int ... | 193 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}... | 1,089 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,f[3][105];
int main()
{
scanf("%d",&n);
for (int i=1; i<=2; i++)
for (int j=1; j<=n; j++)
scanf("%d",&f[i][j]),
f[i][j]+=max(f[i-1][j],f[i][j-1]);
printf("%d",f[2][n]);
return 0;
}
| 105 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[2][n];
for(int i=0;i<2;++i){
for(int j=0;j<n;++j){
cin >> a[i][j];
}
}
int dp[2][n];
memset(dp, 0, sizeof dp);
dp[0][0]=a[0][0];
dp[1][0]=a[1][0] + a[0][0];
for(int i=1;i<n;++i){
dp[0][i] = dp[0][i-1] ... | 213 |
Project_CodeNet | 2,020 | #include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <bitset>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long... | 282 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#defi... | 292 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rrep(i,n) for(int i=1,i##_len=(n); i<=i##_len; ++i)
#define drep(i,n) for(int i=(n)-1; i>=0; --i)
#define srep(i,s,t) for(int i=(s);i<(t);++i)
#define rng(obj) (obj).begin()... | 834 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <string>
#include <memory.h>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <time.h>
#include <assert.h>
#include <cmath>
#include <stack>
#include <string.h>
#include <sstream>
#include <algorithm>
using namespace std;
typedef long long ll;
int... | 251 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
long long mem[2][1010], a[2][100010], n;
long long dp(int x, int y){
if(mem[x][y]!=-1)
return mem[x][y];
long long res=a[x][y];
if(x==0){
res=max(res, a[x][y]+dp(x+1, y));
}
if(y<n-1){
res=max(res, a[x][y]+dp(x, y+1));
}
mem[x][y]=res;
return res;
}
int ma... | 210 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n , arr[2][111];
int Do(int i , int j)
{
if(i>2 or j>n) return 0;
return max(Do(i+1 , j) + arr[i][j] , Do(i , j+1) + arr[i][j]);
}
int main()
{
cin >> n;
for(int i = 1 ; i<= 2; i++) for(int j = 1 ; j <= n ; j++) cin >> arr[i][j];
cout << Do(1,1) << endl;
}
| 125 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
ll n, a1[108], a2[108];
int main(){
cin >> n;
for(ll i = 1; i <= n; i++){cin >> a1[i];}
for(ll i = 1; i <= n; i++){cin >> a2[i];}
for(ll i... | 196 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#define INF 1000000000000
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m;... | 319 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) fo... | 691 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fixed thgrerde
#define f(i,f, t) for(int i = f; i < t; i++)
#define fr(i,f, t) for(int i = f; i >= t; i--)
typedef long long ll;
typedef pair<int,int> PII;
const int infint = INT_MAX;
const ll infll = LLONG_MAX;
int sum[2][100];
int main()
{
ios::sync_with... | 428 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n,ai[3][101];
int dp[3][101];
int fun(int i,int j)
{
if(i>=2||j>=n)return 0;
if(dp[i][j]!=-1)return dp[i][j];
return dp[i][j]=max(fun(i+1,j),fun(i,j+1))+ai[i][j];
}
int main()
{
cin>>n;
for(int i=0; i<2; i++)
{
for(int j=0; j<n; j++)sc... | 158 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
using vl = vector<ll>;
int main(){
ll n;
cin>>n;
vl a(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
vl b(n);
for(int i=0;i<n;i++){
cin>>b[i];
}
ll sum =a[0];
for(int i=0;... | 169 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)
using namespace std;
int a[2][101];
int dp[2][101];
int main() {
int n;
cin >> n;
for (int i=0;i<2;i++) {
for (int j=0;j<n;j++) {
cin >> a[i][j];
}
}
dp[0... | 249 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define long long long
using namespace std;
int n,mat[4][102];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
{
cin>>mat[i][j];
mat[i][j]+=max(mat[i][j-1],... | 183 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1010;
int n, a[3][maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= n; j++)
scanf("%d", &a[i][j]);
for (int i = 1; i <= 2; i++)
for (int j = 1; ... | 160 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int N;
int A[2][105];
int main(void)
{
cin >> N;
for(int i = 0; i < 2; i++){
for(int j = 0; j < N; j++){
cin >> A[i][j];
}
}
int ans = 0, sum;
for(int i = 0; i < N; i++){
sum = 0;
for(int j = 0; j <= i; j++) sum += A[0][j];
for(int j = i; j < N; j++) sum +... | 161 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl ... | 294 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i... | 374 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#include <sys/timeb.h>
#include <fstream>
#include <random>
#include <regex>
using namespace std;
// 提出時はコメントアウト
//#define DEBUG_
#define repr(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repr(i,0,n)
#define reprrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,... | 1,426 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
#define fr(i,x,y) for(int i = x; i <= y; i++)
int n;
int a[2][105],b[2][105];
int main(){
scanf("%d",&n);
fr(i,1,2)
fr(j,1,n)
scanf("%d", &a[i][j]);
b[1][1]=a[1][1];
int temp;
fr(i,1,2)fr(j,1,n){
if (i ==... | 199 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int>> A(2,vector<int>(N));
for(int i=0; i<2; i++){
for(int j=0; j<N; j++){
cin >> A.at(i).at(j);
}
}
//何処で下に曲がるか全探索
int ans = 0;
for(int i=0; i<N; i++){
int ... | 181 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define times(n, i) uptil(0, n, i)
#define rtimes(n, i) downto((n) - 1, 0, i)
#define upto(f, t, i) for(auto i##0_to = (t), i = decltype(t)(f); i <= i##0_to; i++)
#define uptil(f, t, i) for(auto i##0_to = (t), i = decltype(t)(f); i < i##0_to; i++)
#define do... | 2,111 |
Project_CodeNet | 2,018 | #include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<com... | 299 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c,x) ((c).find(x) != (c).end()) //O(log n)
#define contains(c,x) (find((c).begin(),(c).end(),x) != (c).end()) //O(n)
#define Ichar(_x) char... | 875 |
Project_CodeNet | 2,019 | //#include "debug.h"
#include <string.h>
#include <limits.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXN 100000
int n;
int a[2][MAXN];
int input() {
if (scanf("%d", &n) < 0) return 0;
for (int k=0; k<2; k++)
for (int i=0; i<n; i++)
scanf("%d", &a[k][... | 293 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n) for(ll i=n;i>=0;i--)
#define all(v)(v).begin()... | 445 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int c()
{
int n;
cin >> n;
vector<vector<int>> a(2, vector<int>(n));
for(int i = 0; i < 2; i++)
{
for(int j = 0; j < n; j++)
{
cin >> a[i][j];
}
}
int max_c... | 221 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int arr[2][104];
int n;
int main() {
cin>>n;
for (int i = 0;i<2;i++)
for(int j = 1;j<=n;j++)
{
cin>>arr[i][j];
if(i==0) arr[i][j]+=arr[i][j-1];
else{
arr[i][j] = max(arr[i][j-1],arr[i-1][j])+arr[i][j];
}
}
cout<<arr[1][n];
return 0;
} | 132 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int A[2][101] = {0};
int sum(int idx, int i, int j) {
return A[idx][j] - A[idx][i];
}
int main() {
int N; scanf("%d", &N);
for (int a = 0; a < 2; ++a)
for (int i = 1; i <= N; ++i)
scanf("%d", &A[a][i]), A[a][i] += A[a][i - 1];
int ans = 0;
for (int i ... | 181 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int n, a1[100], a2[100];
cin>>n;
for(int i=0; i<n; i++) cin>>a1[i];
for(int i=0; i<n; i++) cin>>a2[i];
int t=0;
t+=a1[0];
for(int i=0; i<n; i++) t+=a2[i];
int mxt=t;
for(int i=1; i<n; i++){
t+= a1[i]-a2[i-1];
mxt... | 154 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a[939131],b[30000];
main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int s1=0,s2=0;
for (int i = 0; i < n; i++)
{
cin >> b[i];
s2+=b[i];
}
int ans=0;
for (int i=0; i < n; i++)
... | 161 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserv... | 466 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
int map[10][105];
int main()
{
int n;
scanf("%d", &n);
for (int i = 1;i <= 2;i++)
for (int j = 1;j <= n;j++)
scanf("%d", &map[i][j]);
for (int j = n;j >= 1;j--)
map[2][j] += map[2][j + 1];
int maximum = 0;
int sum = 0;
for (int i = 1;i <= n;i++... | 177 |
Project_CodeNet | 2,018 | /* One original thought is worth a thousand mindless quotings */
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<bitset>
#include<queue>
#define ll long long
#define ld long double
#define ull unsigned long long
#define boost ios_base::sync_with_stdio(false);cin.tie(0);cout... | 546 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
vector<int> a(N); for(auto& x:a) cin >> x;
vector<int> b(N); for(auto& x:b) cin >> x;
vector<int> acca(N+1);
acca[0] = 0; for(int i=1;i<=N;i++) acca[i] = a[i-1]+acca[i-1];
vector<int> accb(N+1);
acc... | 205 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[2][110];
int dp[2][110];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef LOCAL
std::ifstream in("in");
std::cin.rdbuf(in.rdbuf());
#endif
int N;
cin >> N;
for(int i = 0; i < 2; i++){
for(int j = 0; j < N; j++){
cin >> a... | 196 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
int n;
int dp[2][101];
int ca[2][101];
int pick(int x, int y){
if (x==1 && y == n-1) return ca[x][y];
if (dp[x][y] != -1)return dp[x][y];
if (x != 1)dp[x][y]=pick(x+1, y);
if (y+1 < n)dp[x][y] = max(dp[x][y], pick(x, y+1));
dp[... | 255 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;cin>>n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
if(i>0) a.at(i)+=a.at(i-1);
}
for(int i=0;i<n;i++) cin>>b.at(i);
for(int i=n-2;i>-1;i--) b.at(i)+=b.at(i+1);
for(int i=0;i<n;i++) ans=max(ans,a.at(i)+b.at(i));
... | 139 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#define maxn 110
using namespace std;
int n,a[3][maxn];
int main(){
scanf("%d",&n);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for(int i=2;i<=n;i++)a[1][i]+=a[1][i-1];
a[2][1]+=a[1][1];
for(int i=2;i<=n;i++){
a[2][i]+=max(a[1][i],a... | 155 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define Rep(i,a,b) for (int i=(a);i<=(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rRep(i,a,b) for (int i=(a);i>=b;i--)
int n;
int a[2][105],dp[2][105];
int main()
{
cin>>n;
rep(k,2)rep(i,n)
{
cin>>a[k][i];
}
d... | 249 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
const int dx[4]={-1,1,0,0},dy[4]={0,0,-1,1};
typedef long long ll;
const double eps=1e-16;
const int N=105;
int n,a[N],b[N];
using namespace std;
/*struct node
{
int t,next;
}adj[N<<1];
void add(int s,int t)
{
adj[++now]=(node){t,head[s]};
head[s]=now;
}*/
inline int read()
{
char c;int x;... | 364 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a[105][105];
int main()
{
int i, j, k, N;
cin >> N;
for (i = 0; i < 2; i++)
for (j = 0; j < N; j++)
cin >> a[i][j];
a[1][0] += a[0][0];
for (i = 1; i < N; i++) {
a[0][i] += a[0][i - 1];
a[1][i] += max(a[0][i], a[1][i - 1]);... | 164 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#define pi acos(-1)
#define Rep(i,x,y) for (int i=x,_Lim=y;i<=_Lim;i++)
#define Dep(i,x,y) for (int i=x,_Lim=y;i>=_Lim;i--)
using namespace std;
inline int read(){
int f=1,res=0,ch=getchar();
while (ch<'0' || ch>'9'){
if (ch... | 277 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
int main(){
int N;
cin >> N;
ll A[2][N];
REP(i, 2){
REP(... | 199 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
#include <unistd.h>
#include <std... | 368 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector... | 531 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <memory>
#include <cassert>
#include <algorithm>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> fl(100, 0);
vector<int> sl(100, 0);
int dp[2][100];
for(int i=0; i<N; ++i)
cin>>fl[i];
for(int i=0; i<N; ++i)
cin>... | 238 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include<map>
#include <io... | 354 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#de... | 431 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#define mod 1000000007
using namespace std;
int main()
{
int m,n,o=0,i,j,k;
int sum=0,range=0;
//long long int m,n,o,i,j,k=0;
//vector <int> v;
//float f,g,h;
//char c,d;
//st... | 256 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define dep(i, a, n) for(int i = (a); i >= (n); i--)
#define mod (ll)(1e9+7)
#define int ll
__attribute__((constructor))
void... | 285 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using std::pair;
using std::vector;
using std::string;
typedef long long ll;
typedef pair<int, int> pii;
#define fst first
#define snd second
#define pb(a) push_back(a)
#define mp(a, b) std::make_pair(a, b)
#define debug(...) fprintf(stderr, __VA_ARGS__)
template <typename T> bool chkmax... | 432 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int N;
int dp[3][MAXN];
int main() {
scanf("%d", &N);
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= N; j++) {
int x;
scanf("%d", &x);
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + x;
}
printf("%d\n", dp[2][N]);
return 0;
} | 132 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, a[2][N], r;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> n;
for(int i = 0; i < 2; i++) for(int j = 1; j <= n; j++) cin >> a[i][j];
partial_sum(a[0] + 1, a[0] + n + 1, a[0] + 1);
reverse(a[1] + 1, a[1] + n + 1);
parti... | 219 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define sz(x) int((x).size())
#define a... | 409 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mp make_pair
typedef pair<int,int> pii;
typedef priority_queue<int,vector<int>,greater<int> > small_heap;
typedef priority_queue<int> big_heap;
int g[3][110];int n;
int num[3][110];
int dp(int x,int y){
if(x==2&... | 222 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int n;
cin>>n;
vector<vector<int>> a(2,vector<int>(n));
for(int i=0;i<2;++i)
for(int& x:a[i]) cin>>x;
int res=0;
for(int i=0;i<n;++i)
res=max(res,accumulate(a[0].begin(),a[0].begin()+i,0)+a... | 153 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
//part_aとpart_bは後々の処理の簡略化のためにn+1個の要素
//part_a[0]とpart_b[0]は0とする
vector<int> a(n), b(n), part_a(n + 1), part_b(n + 1);
for (auto&& i : a) {
cin >> i;
}
partial_sum(begin(a), end(a), begin(part_a) + 1);
for (auto&& i : b) ... | 232 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
const int N=110;
int i,j,k,n,m,ch,ff,ans;
int A[N],B[N];
void R(int &x) {
ff=x=0;ch=getchar();
while (ch<'0' || '9'<ch) { if (ch=='-') ff=1;ch=getchar();}
while ('0'<=ch && ch<='9') x=x*10+ch-'0',ch=getchar();
if (ff) x=-x;
}
void W(int x) {
if (x<0) putcha... | 245 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<cfloat>
using namespace std;
int mod = 1e9+7;
long long int inf = 1e18;
int main() {
in... | 261 |
Project_CodeNet | 2,018 | // A[0][0:j+1] + A[1][j:N]を最大化するようなj
// セグ木で和を高速に計算
/*
* Contents : ARC 090 C
* Author : Kitaura Hiromi
* LastUpdate : 20180731
* Since : 20180731
*/
#include <bits/stdc++.h>
#define MAX_N 100
using namespace std;
int N, A[2][MAX_N], bit[2][MAX_N + 1];
int sum(int i, int j){
int s = 0;
while(i > 0){
... | 312 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define forl(V, N) for(int V = 0; V < N; V++)
#define forll(V, S, E) for(int V = S; V < E; V++)
#define fore(E, X) for(auto &E:X)
#define print(X) cout << X
#define printsp(X, Y) cout << X << " " << Y << " "
#define println(X) cout << X << endl
#define printv(V) for(int it... | 334 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[3][n+1];
for(int i=1;i<=2;i++){
for(int j=1;j<=n;j++){
cin>>a[i][j];
}
}
int ans=0;
for(int i=1;i<=n;i++){
int sum=0;
for(int j=1;j<=i;j++){
sum+=a[1][j];
}
for(int k=i;k<=n;k++){
sum+=a[2][k];
}
ans=max(ans,su... | 144 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios... | 252 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
using namespace std;
int l[1010],r[1100];
int a[1010];
int n,ans;
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;++i)
scanf("%d",&a[i]),l[i]=l[i-1]+a[i];
for (int i=1;i<=n;++i)
scanf("%d",&a[i]);
for (int i=n;i>=1;--i)
r[i]=r[i+1]+a[i];
for (int i=1;i<=n;++i)
ans=max(ans... | 152 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
ll ans=0,n,a[2][110];
void dfs(ll ans0,ll x,ll y){
ans0+=a[x][y];
//cout<<x<<" "<<y<<endl;
if(x==1&&y==n-1){
ans=max(ans,ans0);
return;
}
if(y<n-1)dfs(ans0,x,y+1);
if(x==0)d... | 178 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_b... | 309 |
Project_CodeNet | 2,018 | //In the name of ALLAH
#include <bits/stdc++.h>
#define pb push_back
#define X first
#define Y second
const bool DEBUG = false;
#define cerr if(DEBUG)cerr
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const long long maxn = 2e5 + 5;
const long long INF ... | 325 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a[2][105];
int dp[2][105];
int main() {
int n;
cin >> n;
for(int i=0;i<2;i++)
for(int j=0;j<n;j++)
cin >> a[i][j];
dp[0][0] = a[0][0];
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
if(i!=0 and j!=0){
dp[i][j] = a[i][j]+max(dp[i-1][j],dp[i][j-1]);
... | 207 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | 386 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin >> N;
int sum=0,ans;
vector<int> A(N);
vector<int> B(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
sum += A[0];
for(int i=0;i<N;i++){
cin >> B[i];
sum += B[i];
}
ans = sum;
for(int i=1;i<N;i++){
sum = sum + A[i] - B[i-... | 139 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <functional>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> a(2, vector<int> (n));
for (int i = 0; i < 2; i ++) {
... | 282 |
Project_CodeNet | 2,018 | #include<iostream>
#include<iomanip>
//#include<cstdio>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cassert>
using namespace std;
typedef long long ll;
const int Nmax = 100;
int A[2][Nmax], N;
int main(){
cin >> N;
for(int j=0; j<2; j++){
for(int i=0; i<N; i++){
c... | 191 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.