Round #169 (Div. 2)A、Police Recruits

最新推荐文章于 2019-02-08 08:17:42 发布
最新推荐文章于 2019-02-08 08:17:42 发布
阅读量239 收藏
点赞数
分类专栏： Codeforces
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/bluecat56/article/details/24911921
版权 
1、Ad-hoc problem。。。具体不用我说，看代码吧（我真是越来越懒了。。。）
#include<cstdio>
using namespace std;
int a[100010];
int main(){
	int n,num=0,ans=0,temp;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&temp);
        if(temp!=-1) num+=temp;
		else{
			if(num>0) num--;
			else ans++;
		}
	}
	printf("%d\n",ans);
    return 0;
}

深蓝色的猫
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
harmonyos2-AntiLudeonChildrenWoohoo:添加了在rimworld中制作儿童的功能
07-01
和声2 RimworldChildrenWoohoo 添加了在 rimworld 中制作儿童的功能 这个项目是在公共领域。 发布 B19 - WooHooer 1.2 版！ Adds Sims (tm) like commands for woohooing with Pawns, including try for baby. ...
Udemy-的工作场所学习趋势（英文）-1-32页.pdf
最新发布
07-25
学习趋势 2： Automation and AI are new recruits to the workplace 自动化和人工智能正在改变我们工作、开发产品和与客户互动的方式。智能自动化工具增强了员工在工作中的能力，并将重新定义可能的事情。 学习...
codeforces Police Recruits
wilver的博客
12-18 331
Description The police department of your city has just started its journey. Initially, they don’t have any manpower. So, they started hiring new recruits in groups.Meanwhile, crimes keeps occurring w
Codeforces Round #244 (Div. 2)a Police Recruits
mousehao
05-03 979
A. Police Recruits time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The police department of your city has ju
Codeforce Problem 427A. Police Recruits
05-11 487
题目链接： http://codeforces.com/problemset/problem/427/A 题目意思：
Codeforces 427A Police Recruits
Polanwind
02-08 201
#define _CRT_SECURE_NO_WARNINGS #include &lt;iostream&gt; #include &lt;cstdio&gt; #include &lt;math.h&gt; #include &lt;string&gt; #include &lt;algorithm&gt; using namespace std; int c, p; int n; i...
Codeforces Round #244 (Div. 2) A. Police Recruits
weixin_30682127的博客
05-03 77
题目的意思就是找出未能及时处理的犯罪数， #include <iostream> using namespace std; int main(){ int n; cin >> n; int a,recruit = 0, crimes = 0;; for(int i = 0 ; i < n; ++ i){ ...
Codeforces Round #451 (Div. 2) - （A，B）
Orz
12-16 366
A. Rounding time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasya has a non-negative integer n. He wants to
Codeforces Round #244 (Div. 2)
Joursion
04-10 498
A. Police Recruits The police department of your city has just started its journey. Initially, they don’t have any manpower. So, they started hiring new recruits in groups. Meanwhile, crimes
Codeforces Round #244 (Div. 2)——A. Police Recruits(水)
清溪浅水
05-05 835
The police department of your city has just started its journey. Initially, they don’t have any manpower. So, they started hiring new recruits in groups. Meanwhile, crimes keeps occurring within th
找国外PhD职位最常用的申请网站.doc
06-18
- **欧洲EM-A** (http://www.em-a.eu/ru/job-vacancies-and-phd-scholarships.html) 这些网站提供了广泛的选择，帮助你找到适合自己的国外PhD职位。在申请过程中，务必关注每个职位的具体要求、申请截止日期以及...
示例代码和说明1
08-08
var recruits = db.Recruits.OrderByDescending(i => i.Date).Skip(pageIndex.Value * pageSize).Take(pageSize).ToList(); ViewBag.Pagination = new Pagination(pageIndex, pageSize, db.Recruits.Count()); ...
FreeMarker手册
12-26
string("EEEE, MMMM dd, yyyy, hh:mm:ss a &#39;(&#39;zzz&#39;)&#39;")} <#assign foo=true/> ${foo?string("yes", "no")} <!-- yes --> <#assign x=2.582/> <#assign y=4/> #{x; M2} <!-- 输出 2.58 --> #{y; M2} <!-- 输出 4 -->...
Round #197 (Div. 2) D 、 Xenia and Bit Operations
08-27 852
1、题目链接：http://codeforces.com/problemset/problem/339/D 2、我是真没想到用二维数组也可以做，本来还以为要用链表的，想想很麻烦，结果比赛还剩50多分钟就在那里干坐着。。。也有人说是线段树，但是我刚好卡在那里没看。。。ORZ。。。参考了某大牛的代码，自己写了下，很容易就AC掉了~这也算是“非主流”线段树了吧。 #include using n
Round #197 (Div. 2) C.、Xenia and Weights
08-27 721
1、题目链接：http://codeforces.com/problemset/problem/339/C 2、本题过了系统数据，但是没有过hack数据。我是用贪心法，从1开始搜索，尽量选小的砝码加，但是1110000000,4这个数据过不了，原因是我并没有考虑到全部情况，如果按我原来的方法，从1开始搜索，那么1,2,3后加不上砝码，就失败了，事实上2,3,2,3是可以过的。由此可见第一个砝码是
Round #195(Div.2)B、Vasily the Bear and Fly
08-11 633
题目链接：http://codeforces.com/contest/336/problem/B 1、这道题是纯数学题，找下规律后发现答案就是下层每个点到上层每个点的连线的长度之和。刚开始想用暴力法理所当然地TLE了，因为重复计算次数太多了，比如水平距离为2的两个圆的最短距离“总和”就是（2*r+2*根号2*r）+（2*r+根号2*r）+（2*r），不用每次都重复算（重复相加），只要保存到数组s
Round #169 (Div. 2)B. Little Girl and Game
05-01 621
1、统计每个字母出现的次数是奇数还是偶数，假如奇数个数为k，则k为0或1时都是zhiji
Round #198 (Div. 2)C、Tourist Problem
09-05 595
1、题目链接：http://codeforces.com/problemset/problem/340/C 2、这道题我在比赛的时候一点思路都没有，比赛结束后就去网上搜题解。可能是因为水平有限吧，我感觉都看不太懂，于是干脆自己想了。 3、这题刚开始比较乱，但也容易想到其实本质就是统计“每对结点间距离”出现的次数。我从最简单的只有两个点的情况开始考虑，比如2，3，发现最左边的2有点特殊，因为0,
fastapi type Schedule add delete select update restapi
04-05
FastAPI is a modern, fast (high-performance) web framework for building APIs with Python 3.6+ based on standard Python type hints. It provides an easy-to-use interface for creating RESTful APIs with minimal boilerplate code. To create a RESTful API for a Schedule, you would typically define the following endpoints: 1. Add: HTTP POST request to add a new schedule item. 2. Delete: HTTP DELETE request to delete an existing schedule item. 3. Select: HTTP GET request to retrieve a list of all schedule items or a single schedule item by ID. 4. Update: HTTP PUT request to update an existing schedule item. Here is an example implementation of these endpoints using FastAPI: ```python from typing import List from fastapi import FastAPI app = FastAPI() class Schedule: def __init__(self, id: int, title: str, description: str, date: str): self.id = id self.title = title self.description = description self.date = date # Mock data schedule_items = [ Schedule(1, "Meeting", "Weekly team meeting", "2022-01-05T10:00:00"), Schedule(2, "Lunch", "Lunch with clients", "2022-01-06T12:30:00"), Schedule(3, "Conference", "Python conference", "2022-01-10T09:00:00"), ] @app.post("/schedule") def add_schedule_item(schedule: Schedule): """ Add a new schedule item. """ schedule_items.append(schedule) return {"message": "Schedule item added successfully."} @app.delete("/schedule/{schedule_id}") def delete_schedule_item(schedule_id: int): """ Delete an existing schedule item by ID. """ for i, schedule in enumerate(schedule_items): if schedule.id == schedule_id: del schedule_items[i] return {"message": "Schedule item deleted successfully."} return {"error": "Schedule item not found."} @app.get("/schedule") def get_all_schedule_items() -> List[Schedule]: """ Retrieve a list of all schedule items. """ return schedule_items @app.get("/schedule/{schedule_id}") def get_schedule_item(schedule_id: int) -> Schedule: """ Retrieve a single schedule item by ID. """ for schedule in schedule_items: if schedule.id == schedule_id: return schedule return {"error": "Schedule item not found."} @app.put("/schedule/{schedule_id}") def update_schedule_item(schedule_id: int, schedule: Schedule): """ Update an existing schedule item by ID. """ for i, s in enumerate(schedule_items): if s.id == schedule_id: schedule_items[i] = schedule return {"message": "Schedule item updated successfully."} return {"error": "Schedule item not found."} ``` With this implementation, you can use HTTP requests to add, delete, select, and update schedule items via the API. For example, to add a new schedule item, you could send a POST request to http://localhost:8000/schedule with a JSON payload containing the schedule data: ```json { "id": 4, "title": "Training", "description": "Training session for new recruits", "date": "2022-01-15T14:00:00" } ``` You could then use GET requests to retrieve the list of all schedule items or a single schedule item by ID, and PUT and DELETE requests to update or delete existing schedule items.

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值