Submission #3602117
Source Code Expand
#include<iostream> using namespace std; int dp[3][110]={}; //dp[i][j]:(i,j)までの点で得ることのできるアメの最大値 int main(){ int N; cin>>N; int field[3][110]; for(int i=1; i<=2; i++){ for(int j=1; j<=N; j++)cin>>field[i][j]; } dp[1][0]=0;//dp初期条件 dp[2][0]=0; for(int i=1; i<=2; i++){ for(int j=0; j<N; j++){ //dp漸化式 //dp[i][j+1]=max(dp[i][j],dp[i-1][j+1])+field[i][j+1](i==2) //dp[i][j+1]=dp[i][j]+field[i][j+1](i==1) if(i==1) dp[i][j+1]=dp[i][j]+field[i][j+1]; else dp[i][j+1]=max(dp[i][j],dp[i-1][j+1])+field[i][j+1]; } } cout<<dp[2][N]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Candies |
User | izumo1627 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 811 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample01.txt, sample02.txt, sample03.txt, sample04.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample01.txt, sample02.txt, sample03.txt, sample04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
sample01.txt | AC | 1 ms | 256 KB |
sample02.txt | AC | 1 ms | 256 KB |
sample03.txt | AC | 1 ms | 256 KB |
sample04.txt | AC | 1 ms | 256 KB |