Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <deque>
#include <algorithm>
#include <math.h>
#include <random>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define int long long
#define do... | 499 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int MAX_N = 110;
#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
int Sum1[MAX_N], Sum2[MAX_N];
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i++){
int x;
cin >> x;
Sum1[i... | 224 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
#include <cmath>
using namespace std;
typedef long long ll;
//typedef pair<ll, ll> P;
#define rep(i, m) for(ll i=0;i<(m);i++)
#define rep1(i, m) for(ll i=1;i<=(m);i++)
int N, D;
int A[3][110];
ll dp[3][110];
int main() {... | 225 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define pb push_back
#define mp make_pair
#define all(v) v.begin() , v.end()
#define allr(v) v.rbeginq(), v.rend()
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9+7;
const int MAX = 1e5+5;
int n;
int a... | 310 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#de... | 290 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = 1e... | 265 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SIZE(a) ((int)(a).size())
const int N = 105;
int n, a[2][N];
int f[2][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
REP(i, 2) REP(j, n) {
cin >> a[i][j];
f[i][j... | 174 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef ... | 401 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int n,a[101][101];
int dp[2][101],ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
if(i==1) dp[1][j]+=dp[i][j-1]+a[1][j];
}
}
for(int i=n;i>0;i--)
{
dp[2][n-i+1]+=dp... | 177 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define Fast_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
int32_t main(){
Fast_IO
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w",stdout);
// #endif
int n;cin>>n;
vector<int> a(n+... | 265 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
///////////////////////////////////Nikhil Srivastava////////////////////////////////////////
///////////////////////////////////IIT Jodhpur//////////////////////////////////////////////
///////////////////////////////////Bazinga///////////////////////////////////////////////... | 789 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef double D;
const ll inf=(1ll<<62);
const ll mod=1e9+7;
const int MX=3e5+9;
int n,a[2][MX],dp[2][MX];
int main(){
cin>>n;
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
scanf("%d",&a[i][j]);
... | 227 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef unsigned long long uLL;
typedef pair< int,int > ii;
typedef pair< int,ii > iii;
const int inf = 1e9;
const LL INF = 1e18;
const int N = 100005;
const int MOD = 1e9+7;
const double EPS = 1e-6;
const double PI = acos(-1.0);
int n;
int ara[ ... | 362 |
Project_CodeNet | 2,018 | //submitted by HimJ
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define fi first
#define se second
#define fr(i,s,e) for(i=s;i<e;i++)
#define ms(arr,val) memset(arr,val,sizeof(arr))
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
co... | 389 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int N;
vector< vector <int> > w;
int dfs(int row, int col, int c){
int n;
n = w[row][col];
if(col == N - 1 && row == 1){
return n + c;
}
else if(col == N -1 && row == 0){
return dfs(1, col, c+n);
}
else{
if(row == 0){
return ... | 235 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll; typedef vector<int> VI; ... | 315 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int MAXN = 105;
int a[5][MAXN], f[5][MAXN];
int n;
int main()
{
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= n; j++)
cin >> a[i][j];
memset(f, 0, sizeof(f));
... | 185 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
int n, mx, a, s[2][105];
int main()
{
int i , j;
// freopen ("input.txt", "r", stdin);
cin >> n;
for (j = 0; j < 2; j++) {
for (i = 1; i <= n; i++) {
scanf ("%d", &a);
s[j][i] = s[j][i - 1] + a;
}
}
for (i = 1; i <= n; i++) {
mx = max(mx, s[0][i] ... | 164 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int n;
int a[3][105],dp[3][105];
int main() {
scanf("%d",&n);
for (int i=0; i<2; i++)
for (int j=0; j<n; j++) {
scanf("%d",&a[i][j]);
}
memset(dp,0,sizeof(dp));
dp[0][0] = a[0][0];
for (int i=0; i<2; i++)
for (int j=0; j<n; j++) {
if ... | 209 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000 + 10;
const int M = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
const int oo = 1000000000;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define pb push_back
#define all(c) (c).beg... | 231 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a[2][123];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < n; ++j) {
scanf("%d", a[i] + j);
}
}
int ans = 0;
for (int i = 0; i < n; ++i) {
int cur = 0;
for (int j = 0; j <= i; ++j) {
cur +... | 189 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
//container util
//-------------------... | 293 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x)((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y) - 1; 0 <= (x); (x)--)
#define nepi(x, y... | 1,837 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int q1[123],q2[123],x;
int main()
{
int n,x,ans=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
q1[i+1]=q1[i]+x;
}
for(int i=0;i<n;i++)
{
cin>>x;
q2[i+1]=q2[i]+x;
}
for(int i=0;i<n;i++)
ans=max(ans,q1[i+1]+q2[n]-q2[i]);
cout<<ans;
} | 133 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0... | 308 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define ALL(s) s.begin(),s.end()
#define P pair<int,int>
const int M=100010;
const int MOD=1000000007;
const int INF=1000000007;
using ll=long long;
int main() {
int n,a[110][2]={},u[110]={},d[110]={},dsum=0;
cin>>n;
rep(j,0,2)rep(... | 239 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long n,a[2][105],dp[2][105];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
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... | 210 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>*/
#define pb push_back
#define mp make_pair
#define sz(s) ((int)(s.size()))
#define all(s) s.begin(), s.end()
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#de... | 480 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rep(i, a, b) for (long i = (a); i <= (b); ++i)
#define per(i, a, b) for (long i = (a); i >= (b); --i)
using namespace std;
using I = int;
using L = long;
using F = float;
using S = stri... | 812 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int n,a[3][111],dp[3][111];
int main () {
cin >> n;
for (int i = 1; i <= 2; i ++) {
for (int j = 1; j <= n; j ++) {
cin >> a[i][j];
dp[i][j] = a[i][j];
}
}
for (int i = 1; i <= 2; ... | 192 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int f[2][110];
int n, a[2][110];
int main(){
scanf("%d" , &n);
for(int i = 0 ; i < 2 ; i++)
for(int j = 0 ; j < n ; j++)
scanf("%d" , &a[i][j]);
memset(f, -1, sizeof(f));
f[0][0] = a[0][0];
for(int i = 0 ; i < 2 ; i ++){
for(int j = 0 ; j < n ; j++){
if(j >... | 218 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
using namespace std;
/*#include <ext/pb_ds/assoc_co... | 567 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n,a[2][999];
int main(){
int n;
cin>>n;
for(int i=0;i<2;i++)
for(int j=0;j<n;j++)
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+1],a[i+1][j]);
else if(j!=n-1)a[i][j]+=a[i][j+1];
... | 168 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[102][102], n, res;
int main()
{
cin >> n;
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= n; j++)
cin >> dp[i][j];
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= n; j++)
dp[i][j] += max(dp[i - 1][j], dp[i][j - 1]);
cout << d... | 143 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int mat[2][110], a[2][110];
int main() {
int n;
//freopen("in.in", "r", stdin);
cin >> n;
for(int i = 0; i < 2; i++) {
for(int j = 0; j < n; j++)
cin >> mat[i][j];
}
a[0][0] = mat[0][0];
a[1][0] = mat[0][0] + mat[1][0];
... | 222 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define fore(x,a,b) for(int x=a, qwert=b; x<qwert; x++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define FIN ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define fst first
#define snd second
using namespace std;
typedef long long ll;
c... | 237 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<random>
#include<ctime>
#include<cstdlib>
#include<unordered_map>
#include<string.h>
#include<iostream>
usi... | 232 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a[105][2];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n,ans=0;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i][0];
for(int i=0;i<n;i++)cin>>a[i][1];
for(int i=1;i<n;i++)a[i][0]+=a[i-1][0];
for(int i=n-2;i>=0;i--)a[i][1]+=a[i+1][1];
for(int i=0;i<n;i++)a... | 152 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int n,a[3][105],dp[3][105];
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;
}
| 116 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <cmath>
#include <stdio.h>
#include <time.h>
#include <set>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#include <bitset>
#include <unordered_set>
#define F first
#define S second
#define MP make_pair
#define PB push_back
using namespace std;
typedef l... | 263 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
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];
}
vector<int> suma(n+1);
vector<int> sumb(n);
for(int i=0;i<n;i++){
suma[i+1]=suma[i]+a[i];
... | 178 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<cstdlib>
#include<sys/time.h>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
inline int ri()
{
register int x=0;register bool f=0;register char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar()... | 324 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(){
int N,A[2][100]={},max;
cin >> 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 tmp=0;
for(int j=0;j<=i;j++){
... | 165 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
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[i][j];
}
}
for(int j = 1; j < n; j++) {
a[0][j] += a[0][j - 1];
}
a[1][0] += ... | 190 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) ... | 269 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int i,n,ans=0;
cin>>n;
int a[n+1],a1[n+5]={0},a2[n+5]={0};
for(i=1;i<=n;i++){cin>>a[i],a1[i]=a1[i-1]+a[i];}
for(i=1;i<=n;i++)cin>>a[i];
for(i=n;i>=1;i--){
a2[i]=a2[i+1]+a[i];}
for(i=1;i<=n;i++){ans=max(ans,a1[i]+a2[i]);
}
cout<<ans;
return 0;
}
| 143 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <numeric>
#include <algorithm>
#include <iterator>
int main(){
int N, A1[100], A2[100];
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
scanf("%d", &A1[i]);
}
for (int i = 0; i < N; ++i) {
scanf("%d", &A2[i]);
}
int x[100], ans;
for (int n = 0... | 216 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int a[2][300];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < 2; i++)
for (int j = 1; j <= n; j++) {
int tmp;
cin >> tmp;
a[i][j] = a[i][j-1] + tmp;
}
int ans = 0;
f... | 155 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; exit(... | 672 |
Project_CodeNet | 2,018 | //#pragma comment(linker, "/STACK:102400000,102400000")
//#include <windows.h>
//#include <unordered_map>
//#include <unordered_set>
#include <fstream>
#include <iostream>
#include <functional>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queu... | 672 |
Project_CodeNet | 2,018 | #pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<fstream>
#include<bitset>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define INF 0X3F3F3F3F
#define N 100005
#defi... | 718 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,a[3][105];
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<=n;i++){
a[1][i]+=a[1][i-1];
}
for(int i=1;i<=n;i++){
a[2][i]=max(a[2][i-1],a[1][i])+a[2][i];
}
printf("%d\n",a[2][n]);
return 0;
}
| 142 |
Project_CodeNet | 2,019 | //#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <... | 1,241 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int dp[3][110]={0};
int main()
{
int n;
while(cin>>n)
{
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
cin>>dp[i][j];
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
dp[i][j]+=max(dp[i-1][j],dp[i][j-1]);
... | 127 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#d... | 319 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#define ... | 283 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define rep(a,b) for(int a = 0;a < b;a++)
#define REP(i, x, n) for(int i = x; i < n; i++)
#define P(a) cout << a << endl
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ssort(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define vP(v) for(int i = 0;i < ... | 410 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int memo[2][110], a[2][110], n;
int dp(int x, int y)
{
if (x == 2) return 0;
if (y == n) return 0;
if (memo[x][y]) return memo[x][y];
return max(dp(x+1, y), dp(x, y+1)) + a[x][y];
}
int main()
{
scanf("%d", &n);
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < n; ... | 160 |
Project_CodeNet | 2,019 | //ll _(){
// ll n;
// cin >> n;
// vvl grid(2,vl(n));
// cin >> grid;
// vvl ans = grid;
// rep(i,0,1)
// rep(j,0,n-1){
// if(i == 0){
// if(j)
// grid[i][j] += grid[i][j-1];
// }else if(j == 0){
// if(i)
// ... | 582 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<iostream>
using namespace std;
int N;
int dp[2][101];
int a[2][101];
int main(){
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] = dp[0][0] + a[1][0];
for(int i=0; i<N;i++){
... | 200 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int m[3][n+1];
memset(m,0,sizeof m);
for(int i=1;i<=2;i++) {
for(int j=1;j<=n;j++){
cin>>m[i][j];
m[i][j]+=max(m[i-1][j],m[... | 137 |
Project_CodeNet | 2,018 | //2018-1-28
//miaomiao
//
#include <bits/stdc++.h>
using namespace std;
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define Forr(i, a, b) for(int i = (a); i >= (int)(b); --i)
#define N (100 + 5)
int a1[N], a2[N];
int pre[N], suf[N];
int main(){
int n;
scanf("%d", &n);
For(i, 1, n) scanf("%d", &a1[... | 237 |
Project_CodeNet | 2,018 | //Be Name Khoda
//no comment...
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typena... | 366 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x... | 389 |
Project_CodeNet | 2,018 | #include<cstdio>
using namespace std;
int a[10][110],s1[110],s2[110],i,j,n,ans;
int max(int a,int b){return a>b?a:b;}
int main()
{
scanf("%d",&n);
for (i=1;i<=2;i++)
for (j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for (i=1;i<=n;i++) s1[i]=s1[i-1]+a[1][i];
for (i=1;i<=n;i++) s2[i]=s2[i-1]+a[2][i];
ans=0;
for (i=... | 176 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int n;
int x[2][110];
int main()
{
cin>>n;
int i,a;
for(i=1;i<=n;i++) cin>>x[0][i];
for(i=1;i<=n;i++) cin>>x[1][i];
for(i=n-1;i>=1;i--)
x[1][i]=x[1][i]+x[1][i+1];
for(i=2;i<=n;i++)
x[0][i]=x[0][i]+x[0][i-1];
int sol=-10;
for(i=... | 176 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[110][5];
int s1[110],s2[110];
int main()
{
int n,i,j,k,ans;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i][1]);
for(i=1;i<=n;i++)
scanf("%d",&a[i][2]);
s1[0]=0;
for(i=1;i<=n;i++)
s1[i]... | 202 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
/*
<url:https://arc090.contest.atcoder.jp/tasks/arc090_a>
問題文============================================================
2×N のマス目があります。上から i 行目、左から j 列目... | 567 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pf... | 581 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#define ll long long
#define INF 0x3f3f3f3f
#define N 1005
using namespace std;
int a[3][N];
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... | 147 |
Project_CodeNet | 2,018 | // need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <unordered_map>
//#include <complex>
//#include <deque>
#include <valarray>
// strea... | 1,766 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <complex>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <cstdlib>
#define rep(i, b) for(int i = ... | 479 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int A[2][101];
int n;
int main()
{
scanf("%d",&n);
for(int i = 0; i < 2; i++)
{
for(int j = 0; j < n; j++)
scanf("%d",&A[i][j]);
}
int ans = 0;
for(int i = 0; i < n; i++)
{
int mx = 0;
for(int j = 0; j <= i;... | 181 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <time.h>
#include <vector>
#include <stdio.h>
#include <memory.h>
#include <string>
#include <string.h>
#include <map>
#include <algorithm>
#include <queue>
#include <set>
#include <time.h>
#include <assert.h>
#include <sstream>
//#include <unordered_map>
#i... | 329 |
Project_CodeNet | 2,018 | #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
... | 631 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int A[110],B[110];
int S1[110],S2[110];
int main(){
int n;
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]);
}
int ans = 0;
for(int i = n;i >= 1;i--){
S1[i] = S1[i +... | 193 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n,i,a[105],b[105],c[105],maxx=0,t;
cin>>n;
a[0]=0;
for(i=1;i<=n;i++){
cin>>a[i];
a[i]=a[i]+a[i-1];
}
for(i=1;i<=n;i++)
cin>>b[i];
b[n+1]=0;
for(i=n;i>=1;i--){
b[i]=b[i]+b[i+1];
t=b[i]+a[i];
if(t>maxx)maxx=t;
}
cout<<maxx... | 151 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
using namespace std;
typedef long long ll;
ty... | 305 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#ifdef DEBUG
#define PRINT(x)\
cout<<"func "<<__func__<<": line "<<__LINE__<<": "<<#x<<" = "<<(x)<<endl;
#define PRINTA(a,first,last)\
cout<<"func "<<__func__<<": line "<<__LINE__<<": "<<#a<<"["<<(first)<<", "<<(last)<<")"<<endl;\
for (int i=(first);i<(last);++i){cout<<#a<<"["<<i<<... | 640 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repeq(i,a,b) for(int i=a;i<=(b);++i)
#define debug(x) cerr<<#x<<": "<<x<<endl
#define trav(a,x) for(auto &a:x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int,int> pii;
... | 244 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifdef WIN32
#define I64 "%I64d"
#else
#define I64 "%lld"
#endif
typedef long long ll;
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
#define sz(s) (int(s.size()))
#define fname "a"
#define MAXN 20002
int ... | 274 |
Project_CodeNet | 2,018 | #include<iostream>
#include<fstream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<set>
#include<utility>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a[2];
for(int i = 0; i < 2; i++) a[i].resize(n);
for(in... | 275 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n)
{
int x=0;
int sum[110],sum2[110];
memset(sum,0,sizeof(sum));
memset(sum2,0,sizeof(sum2));
for(int i=1;i<=n;i++)
{
cin >> x;
sum[i]=sum[i-1]+x;
... | 188 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cstdio>
const int N = 100;
int a[2][N];
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < 2; ++ i) {
for (int j = 0; j < n; ++ j) {
scanf("%d", a[i] + j);
}
}
int result = 0;
for (int j = n - 2; j >= 0; -- j) {
a[1][j] ... | 208 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using P = pair<llong, llong>;
#define BE(x) x.begin(), x.end()
const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;
int main(){
int N;
vector<int> A[2];
cin >> N;
A[0].resize(N);
A[1].resize(N);
for(int i = 0; i < 2; i++)
for(int j... | 275 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng... | 644 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
vector<vector<int>> a(2,vector<int>(150));
for(int i=0;i<2;++i){
for(int j=0;j<n;++j)cin>>a[i][j];
}
vector<vector<int>> dp(2,vector<int>(150));
dp[0][0] = a[0][0];
for(int j=0;j<n... | 231 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
istream& operator>>(istream &in, vector<int> &arr) {
for(int i = 0; i < arr.size(); i++) {
in >> arr[i];
}
return in;
}
int A_prefix[102], B_prefix[102];
int main() {
ios_base::sync_with_stdio(false);
//freopen("input.in", "r", stdin);
int... | 248 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) FOR(i, 0, n)
#define SZ(v) ((int)v.size())
#define ZERO(a) memset(a, 0, sizeof(a))... | 1,093 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int n, sol = 0;
cin >> n;
int a[2][n];
for (int i = 0; i < 2; i++)
for (int j = 0; j < n; j++)
cin >> a[i][j];
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = 0; j <= i; j++) tmp += a[0][j];
fo... | 162 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
int A[3][105];
int main()
{
int N;
scanf("%d", &N);
for (int i = 1; i <= N; ++i) scanf("%d", &A[0][i]);
fo... | 245 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
// 82
using namespace std;
int mat[3][101], dp[3][101];
int main() {
//ifstream cin("A.in");
//ofstream cout("A.out");
int i, j, n;
ios::sync_with_stdio(false);
cin >> n;
for(i = 1; i <= 2; i++) {
for(j = 1; j <= ... | 211 |
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));
for (int i = 0; i < 2; ++ i) for (int j = 0; j < N; ++ j) {
cin >> A[i][j];
}
int r = 0;
for (int k = 0; k < N; ++ k) {
int rr = 0;
for (int j = 0; j <= k; ++ j) rr += A[0][j];
for (int j... | 170 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
using namespace std;
#define FOR... | 247 |
Project_CodeNet | 2,018 | // V solo
#include <bits/stdc++.h>
#define forn(i, a, b) for (int i = a; i <= b; ++i)
#define forr(i, a, b) for (int i = a; i >= b; --i)
using namespace std;
const int N = (int)1e5 + 1;
const int INF = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;
typedef pair < ll, ll > pll... | 258 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int dp[3][110];
int N=0;
int A[3][110];
int main(void){
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(j!=0){dp[i][j]=max(dp[i][j],dp[i][j... | 188 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n], b[n];
for (int i=0; i<n; i++) scanf("%d", &a[i]);
for (int i=0; i<n; i++) scanf("%d", &b[i]);
int suma[n+1], sumb[n+1];
suma[0]=0; sumb[0]=0;
for (int i=0; i<n; i++) suma[i+1]=suma[i]+a[i];
for (int i=0; i<n; i++) sum... | 219 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
int N;
int x[110],y[110];
int main()
{
cin >> N;
int sumy = 0, sumx=0, ans = 0;
for(int i = 0 ; i < N; ++i) cin >> x[i];
for(int i = 0 ; i < N; ++i){
cin >> y[i];
sumy+=y[i];
}
for(int i =0; i < N; ++i)
{
sumx+... | 163 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
... | 283 |
Project_CodeNet | 2,019 | // https://atcoder.jp/contests/arc090/tasks/arc090_a
#include "algorithm"
#include "cmath"
#include "functional"
#include "iostream"
#include "numeric"
#include "queue"
#include "set"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define repf(i, from, to) for (ll i = from; i < (to); ++i)
#define r... | 667 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.