摘要： Best Cow FencesTime Limit:1000MSMemory Limit:30000KTotal Submissions:8772Accepted:2802DescriptionFarmer John's farm consists of a long row of N (1 #include #include using namespace std;int num[100020];int sum[100020];int main(){ int n, f; int ans; while(scanf("%d%d", &n, &f) != 阅读全文

摘要： The Cow LineupTime Limit:1000MSMemory Limit:30000KTotal Submissions:4965Accepted:2966DescriptionFarmer John's N cows (1 #include #include using namespace std;int cow[100005];int visited[100005];int main(){ int n, k, nCount = 0, ans = 0; scanf("%d%d", &n, &k); for (int i = 0; i 阅读全文