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>
#define x first
#define y second
#define pb push_back
#define Set(i, v) memset(i, v, sizeof i)
#define For(i, j, k) for(int i = j; i <= k; i++)
#define Forr(i, j, k) for(int i = j; i >= k; i--)
typedef long long LL;
using namespace std;
const int N = 110;
int A[N], B[N], n;
int main(){
... | 214 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include ... | 255 |
Project_CodeNet | 2,018 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 328 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[2][n];
rep(i, n) cin >> a[0][i];
rep(i, n) cin >> a[1][i];
int ans = 0;
rep(i, n) {
int cnt = 0;
rep(j, n) {
if ... | 190 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<int,int>
#define VI vector<int>
int main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;cin >> n;
int a[n+1],b[n+1], result = 0;
for (int i=1; i<=n; i++) {
cin >> a[i];
}
for (int i=1; i<=n; i++) {
cin >> b[i];
... | 217 |
Project_CodeNet | 2,019 | #include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#include<ra... | 528 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mkp make_pair
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPP(i,n,m) for(int i=(n);i<=(m);i++)
int thing[3][150];
int solve(int n){
int dp[3][150]={0};
REP(i,2){
REP(j,n){
dp[i+1][j+1] = thing[i+1][j+1] + max(dp[i+1][j],dp[i][j+1]);
... | 189 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <string.h>
#include <stdio.h>
#include <queue>
#include <limits.h>
#include <stack>
#include <set>
#include <map>
#define P pair
#define MP make_pair
typedef long long int llint ... | 274 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int arr[5][105];
int dp[5][105];
int n, m;
void solve() {
scanf("%d", &m);
n = 2;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
scanf("%d", &arr[i][j]);
}
}
for (int i = 1; i <= n; ++i) {
for (in... | 205 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int can[5][110];
int n,memo[5][150];
int dp(int x,int y)
{
if(x>1 || y>n-1) return -10000000;
if(x==1&&y==n-1) return can[x][y];
if(memo[x][y]!=-1)return memo[x][y];
int ret=dp(x,y+1)+can[x][y];
if(x==0){
ret=max(ret,dp(x+1,y)+can[x][y]);
}
return memo[x][y]=ret;
}
... | 196 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,s,n) for(int i=s;i<n;i++)
#... | 337 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <list>
#include <set>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
using namespace std;
int N, M, K, W,X;
int dp[3]... | 309 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
const int N=105;
int A[N],B[N];
int n;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",A+i);
for(int i=1;i<=n;i++)
scanf("%d",B+i);
for(int i=1;i<=n;i++)A[i]+=A[i-1];
for(int i=n;i;i--)B[i]+=B[i+1];
int ans=0;
for(int i=1;i<=n;i++)
ans=... | 146 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n; cin>>n;
vector<vector<int>> a(2,vector<int>(n+1,0));
for(int i=1; i<=n; ++i){ cin>>a[0][i]; a[0][i]+=a[0][i-1];}
for(int i=1; i<=n; ++i){ cin>>a[1][i]; a[1][i]+=a[1][i-1];}
int res=0;
for(int i=1; i<=n; ++i) res=max(res,a[0][i]+a[1][n]-a[1]... | 167 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
void init() {
//#if __GLIBCXX__ == 20160609
#ifdef FIRE_MIND
freopen("a.in", "r", stdin);
///freopen("a.out", "w", stdout);
#else
///freopen(TASKNAME".in", "r", stdin);
///freopen(TASKNAME".out", "w", stdout);
#endif
}
typedef long long ll;
const int INF =... | 318 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sys/time.h>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
using namespace std;
void solve(int n, vector<long long> a1, vector<long long> a2) {
long... | 382 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
ll n;
int dp[2][110];
int main(){
cin>>n;... | 318 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <algorithm>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
int a[2][N];
int ans[2][N];
for (int i=0; i<2; i++) {
for (int j=0; j<N; j++) {
cin >> a[i][j];
ans[i][j] = 0;
}
}
for (in... | 296 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
const int maxn = 105;
int a[maxn][maxn];
int dp[maxn][maxn];
int main(){
int n;
scanf("%d",&n);
for (int i = 1; i <= 2; i++)
{
for (int j = 1; j <= n; j++){
... | 189 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
... | 933 |
Project_CodeNet | 2,018 | #include <string>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <iterator>
#include <cmath>
#include <limits>
#include <tuple>
#include <queue>
#include <stack>
#include <array>
using namespace std;
typedef lo... | 282 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
// #include "ane.cpp"
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 105;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;
// comment to disable debug functions
#define DEBUG
// frequently used macros
#if __cplusplus >= 201... | 979 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define N 100
using namespace std;
int a[2][N];
int s[2][N];
int main() {
int n = 2, m;
cin >> m;
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
... | 259 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
int N;
cin >> N;
vector<vector<int>> A(2, vector<int>(N));
for (auto &row : A) {
for (auto &x : row) {
cin >> x;
}
}
int ans = 0;
for (int i = 0; i < N; ++i) {
int result
= accumulate(A[... | 163 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(2, vector<int>(n + 1));
for (int i = 0; i < 2; i++) {
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < 2; i++) {
for (int j = 2; j <= n; j++) {
a[i][j] += a[i][j - 1];
}
}
int m... | 198 |
Project_CodeNet | 2,018 | //Written by Zhu Zeqi
//Come on,baby
//Hack,please
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#inc... | 499 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
#define mp make_pair
using namespace std;
ll a[2][110];
ll sum[2][110];
int main(){
ll n;
cin>>n;
ll ans = -1;
for(int i=1;i<=n;i++){
cin>>a[0][i];
sum[0][i] = sum[0][i-1]+a[0][i];
}
for(int i=1;i<=n;i++){
cin>>a[1][i]... | 209 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define debug(x) cout<<#x<<": "<<x<<endl
#define DEBUG(x) cout<<#x<<": "<<x<<endl
int powint(int a, int x){
int res = 1;
REP(i,x){
res = res *a;
}
return res;
}
using namespace std;
int main(){
int N;
cin>>N;
vector<int> a1(N);
vector<int>... | 217 |
Project_CodeNet | 2,018 |
#include <cassert>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iostream>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
using namespace std;
ty... | 246 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong... | 265 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int n,a[2][105],dp[2][105];
int main()
{
scanf("%d",&n);
for(int i=0;i<2;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
dp[0][1]=a[0][1];
dp[1][1]=a[0][1]+a[1][1];
for(int i=2;i<=n;i++)
{
dp[0][i]=dp[0][i-1]+a[0][i];
}
for(int i=2;i<=n;i++)
{
... | 194 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int a[2][100];
int dp[2][100];
int main() {
int n, i, j;
scanf("%d", &n);
for (i = 0; i < 2; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
dp[0][0] = a[0][0];
for (i = 0; ... | 250 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN = 100000+9;
int num[2][MAXN];
int n;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&num[0][i]);
num[0][i]+=num[0][i-1];
}
for(int i=1;i<=n;i++)
scanf("%d",&num[1][i]);
for(int i=n;i;i--)
num[1][i]+=... | 172 |
Project_CodeNet | 2,018 | #include<cstdio>
int a[105],b[105];
int main()
{
int n,i,ans=0;
scanf("%d",&n);
for(i=1;i<=n;++i)scanf("%d",&a[i]);
for(i=1;i<=n;++i)scanf("%d",&b[i]);
for(i=2;i<=n;++i)a[i]+=a[i-1];
for(i=n;--i;)b[i]+=b[i+1];
for(i=1;i<=n;++i)if(a[i]+b[i]>ans)ans=a[i]+b[i];
printf("%d",ans);
} | 130 |
Project_CodeNet | 2,018 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
using namespace std;
int main (void)
{
int n,a[100][100],x[100],K,pp,ap;
cin >> n;
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < n; j++)
{
cin >> a[i][j];
}
}
for (int j = 0; j < n... | 261 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<(int)n;i++)
const ll INF = (1LL<<60);
const int MOD = 1000000007;
int main(){
int N; cin >> N;
int A[2][110];
rep(i,2)rep(j,N) cin >> A[i][j];
vector<int> S1(110),S2(110);
rep(... | 210 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define... | 526 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(n);i++)
#define ll... | 955 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,c,m;
vector<vector<int>> a;
void dfs(int i,int j){
c+=a[i][j];
if(i==1&&j==n-1){
m=max(m,c);
}
if(a[i][j+1]!=0){
dfs(i,j+1);
}
if(a[i+1][j]!=0){
dfs(i+1,j);
}
c-=a[i][j];
}
int main(){
cin>>n;
a.resize(3);
for(int i=0;i<3;i++){
a[i... | 220 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <string>
using namespace std;
//宣言
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
//数値
#define MOD 1000000007
#define INF (1<<20)
const double EPS = 1e-10;
const double PI = ... | 487 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<vector<int>> A(2, vector<int>(N + 10, 0));
for (int i = 0; i < N; i++) cin >> A.at(0).at(i);
for (int i = 0; i < N; i++) cin >> A.at(1).at(i);
int max = 0;
for (int i = 0; i < N; i++)
{
int candies = 0;
... | 200 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
int sum1=0,sum2=0,f[n-1],s[n-1];
int arr[2][n];
for(int i=0;i<2;i++)
{
for(int j=0;j<n;j++)
{
cin>>arr[i][j];
if(i==0 && j>0)
{
f[j-... | 298 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | 450 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int a[2][100];
int n;cin >> n;
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
cin >> a[i][j];
}
}
int ans = 0;
for(int i=0;i<n;i++){
int sum = 0;
for(int j=0;j<i+1;j++){
sum += a[0][j];
... | 151 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >=0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
typedef long long ll;
#define INF 1e9
int N;
int main(){
cin >> N;
vector<vector<int>> A(2, vector<int>(N));
vector<vec... | 227 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define r... | 591 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstring>
#include<cassert>
#include<cmath>
#include<sstream>
#include<fstream>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<bitset>
using namespace std;
int a[2][105],b[2][105];
int main()
{
int ... | 261 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long ll;
#define SZ(x) ((int)(x).size())
#define BIT(n) (1ll<<(n))
#define SORT(c) sort((c).begin(),(c).end())
#define RALL(a) (a).rbegin(), (a).rend()
#de... | 509 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/reversed.hpp>
#include <limits>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long int;
int main() {
u... | 437 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int n;
std::vector<int> k[2];
std::vector<int> sum[2];
int main(){
cin >> n;
int s = 0;
for(int i=0;i<n;i++){
int tmp;
cin >> tmp;
k[0].push_back(tmp);
s += tmp;
sum[0].push_back(s);
}
s = 0;
fo... | 214 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define lol 1000000007
#define endl '\n'
#define rep(i,a,b) for(int i=a;i<b;i++)
... | 373 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
int a[20][500];
for (int i=1;i<=2;i++){
for (int j=1;j<=n;j++) cin>>a[i... | 272 |
Project_CodeNet | 2,018 | #include <iostream>
#include <array>
#include <map>
#include <algorithm>
#include <cmath>
#include <vector>
#include <fstream>
#include <string>
#include <random>
#include <queue>
#include <iomanip>
#include <functional>
#include <climits>
#include <tuple>
#include <unordered_map>
#include <limits>
#include <functional... | 556 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cmath>
using namespace std;
int main(int argc,char const *argv[])
{
int n;
cin>>n;
int a[2][n];
int dp[2][n];
for(int i = 0;i < 2; ++i)
{
for(int j = 0;j < n; ++j)
{
dp[i][j] = 0;
}
}
for(int i = 0;i < 2; ++i)
{
for(int j = 0;j < n; ++j)
{
cin>>a[i][j];
}
}
dp[... | 278 |
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 < n; i++)
cin>>a[0][i];
for(int i = 0; i < n; i++)
cin>>a[1][i];
int ans = INT_MIN;
for(int i = 0; i < n; i++)
{
int d = a[0][0];
for(int j = 1; j <= ... | 174 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse4")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#defi... | 292 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const int MAX_N=100;
int N,A[2][MAX_N];
int main(){
cin>>N;
REP(i,2){
REP(j,N)
cin>>A[i][j];
}
int ans=0;
REP(i,N){
int tem=0;
REP(j,N){
if (i<=j){
tem+=A[... | 176 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
int main()
{
int n, arr[105][105];
scanf("%d", &n);
for(int i = 1; i <= 2; i++){
for(int j = 1; j <= n; j++){
scanf("%d", &arr[i][j]);
}
}
int Max = 0;
for(int i = 1; i <= n; i++){
int sum1 =... | 206 |
Project_CodeNet | 2,019 | #include <cstdio>
int main() {
int N;
scanf("%d", &N)+1;
int* A1 = new int[N];
int* A2 = new int[N+1];
int tmp, total = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &tmp)+1;
total += tmp;
A1[i] = total;
}
A2[0] = total;
for (int i = 0; i < N; i++) {
scanf("%d", &tmp)+1;
total -= tmp;
A2[i+1] =... | 223 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[3][107];
int f[3][107];
int main()
{
scanf("%d",&n);
for (int i=1;i<=2;i++)
for (int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
f[1][1]=a[1][1];
for (int i=1;i<=2;i++)
for (int j=1;j<=n;j++)
if (i!=1||j!=1)
{
if (i>1) f[i][j]=max(f[i][j],f[i-1][j]... | 199 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n,a[10][200],dp[10][200];
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;j<=n;j++)
dp[i][j] = a[i][j]+max(dp[... | 144 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int main() {
int N;
cin >> N;
vector<int> cnt1(N + 1, 0), cnt2(N + 1, 0), A(N + 1, 0);
for (int i = 1; i <= N; ++i) {
int a;
cin >> a;
cnt1[i] = cnt1[i - 1] + a;
}
for (int i = 1; i <= N; ++i) {
cin >> A[i];
}
... | 248 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<bitset>
#include<complex>
#include<cmath>
using namespace std;
template<typename __T>
inline void read(__T &x)
{
x=0;
int f=1;char c=getchar();
while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
while(isdigi... | 221 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int G[2][100];
int dx[]{0, 1};
int dy[]{1, 0};
signed main() {
int n;
cin >> n;
for(int i=0; i<2; ++i) {
for(int j=0; j<n; ++j) cin >> G[i][j];
}
queue<pair<int, pair<int,int>>> que;
que.push(make_pair(G[0][0], make... | 273 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <string>
#include <bitset>
#include <fstream>
#include <iomanip>
using namespace std;
#define PB push_back
#define M... | 546 |
Project_CodeNet | 2,018 | #include<iostream>
#include<climits>
#include<limits.h>
using namespace std;
int main(){
int n;
cin>>n;
int sum=0;
int s=INT_MIN;
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 q=0;q<=n-1;q++){
sum=0;
for(int f=0;f<=q;f++){
sum=sum+a[0][f];
}
... | 177 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define x first
#define y second
#define all(x) x.begin(),x.end()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(... | 626 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <map>
using namespace std;
int dp[5][110], num[3][110];
int n;
void dfs(int x, int y)
{
if (y > n) return;
if (dp[x][y] != -1) return;
if (x... | 296 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fs first
#define sc second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define pb push_back
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define MP make_pair
#defi... | 384 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))
using ll = long long;
using P = std::tuple<int,int>;
const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1... | 422 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <map>
#include <functional>
using namespace std;
int main() {
int A[2][100];
int max = 0;
int N;
int sum[2][100];
cin >> N;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
... | 298 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PLDLD;
typedef vector<int> VI;
typedef vector<char> VB;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);++i)
#define REP(i,n) FOR(i... | 712 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <string>
#define SIZE 105
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int A[SIZE];
int B[SIZE];
int main()
{
int n;
sc... | 184 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fast_io std::ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define trace(x) cout << '>' << #x << ':' << x << endl;
#define trace2(x,y) cout<< '>' << #... | 501 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,b[10000],c[10000],a[2][10000],ans;
int main(){
cin>>n;
for(int i=1;i<=2;++i)
for(int j=1;j<=n;++j)
cin>>a[i][j];
for(int i=1;i<=n;++i)
b[i]=b[i-1]+a[1][i];
for(int i=n;i;--i)
c[i]=c[i+1]+a[2][i];
for(int i=1;i<=n;++i)
ans=max(ans,b[i]+c[i]);
cout<<an... | 151 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<string,int> P;
typedef pair<P,P> P2;
const ll INF=100000000000000001;
int a[2][100001];
int main() {
int n;
cin>>n;
int a[2][101];
for(int i=0;i<n;++i)cin>>a[0][i];... | 169 |
Project_CodeNet | 2,018 | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include... | 508 |
Project_CodeNet | 2,018 | // Gear4
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define FOR0(i,n) for(int i=0, _##i=(n); i<_##i; ++i)
#define FOR(i,l,r) for(int i=(l), _##i=(r); i<_##i; ++i)
#define FORD(i,l,r) for(int i=(r), _##i=(l); --i>=_##i; )
... | 431 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int maxn = 2e2 + 10;
const int INF = 0x3f3f3f3f;
struct EDGE{ int v, w, nxt; }Edge[maxn * maxn];
int Head[maxn], cnt, id, N;
int ID[3][maxn];
int Weight[3][maxn];
inline void init()
{
memset(Head, -1, sizeof(Head));
cnt = id = 0;
}
inline void AddEdge(int Fr... | 627 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int i,j,n,now;
int ans[105][105];
int main()
{
scanf("%d",&n);
for (i=1;i<=2;i++)
for (j=1;j<=n;j++)
{
scanf("%d",&now);
ans[i][j]=max(ans[i-1][j],ans[i][j-1]);
ans[i][j]+=now;
}
printf("%d",ans[2][n]);
return 0;
} | 113 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cmath>
#include<numeric>
#include<vector>
#include<tuple>
using namespace std;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define vint vector<int>
#define vvint vector<vint>
#define ct(a) cout<<a<<endl
typedef long long ll;... | 222 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
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=0; i<n-1; i++) a[i+1] += a[i];
for(int i=n-1; i>0; i--) b[i-1] += b[i];
int ans = 0;
for(int i=... | 153 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int a[2+1][n+1];
memset(a,0,sizeof(a));
for(int i=1;i<3;i++){
for(int j=1;j<n+1;j++){
cin>>a[i][j];
a[i][j]=max(a[i-1][j]+a[i][j],a[i][j-1]+a[i][j]);
}
}
cout<<a[2][n]<<endl;
return 0;
}
| 127 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int>P;
#define fi first
#define se second
int main(){
int n;
cin>>n;
int a[2][n];
r(i,2)r(j,n)cin>>a[i][j];
for(int i=1;i>=0;i--){
for(int j=n-1;j>=0;j--){
if(j!=n-1&&i==0)a[i][j]=max(a[i][j]+a[i][j+1]... | 215 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
#define FOR(i,j,k) for(int i=j;i<=k;i++)
#define REV(i,j,k) for(int i=j;i>=k;i--)
#define FORR(i,j,k,l) for(int i=j;i<=k;i+=l)
#define inf freopen("in.txt", "r", stdin)
#define outf freopen("out.txt", "w", stdout)
#def... | 518 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int a[2][1000], dp[2][1000];
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];
dp[1][0] = a[0][0] + a[1][0];
for(int j=1;j<n;j++)
dp[0][j] = a[0][j] + dp[0][j-1];
for(int j=1;j<n;j++){
dp[1][j] = max(d... | 181 |
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);
vector<vector<int>> c(2,vector<int>(n,0));
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
c[i][j]=(j==0?a.at(i).at(j... | 182 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,n) for(ll (i) = 0 ; (i) < (n) ; ++(i))
const int N = 1000;
ll tile[2][N];
ll n;
int bfs(int i , int j)
{
if(i == 0){
int k = bfs(i+1,j);
if(j != n){
k = max(bfs(i,j+1),k);
}
return ... | 203 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std ;
int a[5][110] , dp[5][110] ;
int main(){
int N ;
cin >> N ;
for( int i = 1 ; i <= 2 ; i++ )
for( int j = 1 ; j <= N ; j++ )
cin >> a[i][j] ;
for( int i = 1 ; i <= 2 ; i++ )
for( int j = 1 ; j <= N ; j++ )
dp[i][j] = ma... | 164 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int N;
int main()
{
cin >> N;
vector<vector<int>> candy(2, vector<int>(N));
for(int j = 0; j < 2; j++) {
for(int i = 0; i < N; i++) {
int c;
cin >> c;
if (i == 0) {
candy[j][0] = c;
... | 208 |
Project_CodeNet | 2,018 | /*
*/
//#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#include <ctime>
#i... | 398 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
#define Fi first
#define Se second
#define mp make_pair
#define bug cout << "check\n";
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int,int> pii;
typedef pair <ll, ll> ... | 357 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int MOD = 1e... | 326 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) FOR(i,0,b)
#define INF mugen
#define dump(x) cerr<<#x<<"="<<x<<endl
#define all(a) (a).begin(),(a).end()
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<vii> viii;
typedef pair<int,int> P;
template <cla... | 297 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define setbit(s, i) (s|=(1LL<<(i)))
#defi... | 493 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<math.h>
#include<numeric>
#include<iomanip>
#include<queue>
#include<functional>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<... | 275 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 105
int grid[3][N];
int dp[3][N];
int main(){
int n;
scanf ("%d", &n);
for (int i = 1; i <= 2; i++){
for (int j = 1; j <= n; j++){
scanf ("%d", &grid[i][j]);
}
}
for (int i = 1; i <= 2; i++){... | 180 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a[3][100];
int dp[3][100];
int n;
int main()
{
cin >> n;
int i, j;
for(i = 1; i <= 2; i ++)
{
for(j = 1; j <= n; j ++)
cin >> a[i][j];
}
for(i = 1; i <= 2; i ++)
{
for(j = 1; j <= n; j ++)
{
... | 223 |
Project_CodeNet | 2,018 | #include <iostream>
using ll = long long;
using namespace std;
int main() {
ll N, A[100][2];
cin >> N;
for (ll j = 0; j < 2; j++) for (ll i = 0; i < N; i++) cin >> A[i][j];
ll b[100][2];
b[0][0] = A[0][0];
b[0][1] = A[0][0] + A[0][1];
for (ll i = 1; i < N; i++) {
b[i][0] = b[i - 1][0] + A[i][0];
... | 194 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#define ios std::ios::sync_with_stdio(false);cin.tie(NULL)
#define ll long long int
#define PI acos(-1.0)
#define EPS 1e-9 //epsilon 10^-9, checking for equality
#define pb push_back
#define fi first
#define se second
#define go(i,a,n) for(int i=a... | 825 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.